WorldWideScience

Sample records for schedules and scheduling

  1. Routing and scheduling problems

    DEFF Research Database (Denmark)

    Reinhardt, Line Blander

    of a connection between two locations. This could be an urban bus schedule where busses are routed and this routing creates a bus schedule which the passengers between locations use. In this thesis various routing and scheduling problems will be presented. The topics covered will be routing from an origin...... set cost making the cost of the individual vehicle routes inter-dependant. Depending on the problem type, the size of the problems and time available for solving, different solution methods can be applicable. In this thesis both heuristic methods and several exact methods are investigated depending...... on the problems needed to be solved. The solution methods applied to the problems cover dynamic programming for multi constrained shortest paths, Branch-and-cut for liner shipping, Simulated annealing for transporting assisted passengers in airports, branch-cut-and-price for vehicle routing with time windows...

  2. Visualization and Simulation in Scheduling

    Directory of Open Access Journals (Sweden)

    R. Čapek

    2008-01-01

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

  3. Scheduling theory, algorithms, and systems

    CERN Document Server

    Pinedo, Michael L

    2016-01-01

    This new edition of the well-established text Scheduling: Theory, Algorithms, and Systems provides an up-to-date coverage of important theoretical models in the scheduling literature as well as important scheduling problems that appear in the real world. The accompanying website includes supplementary material in the form of slide-shows from industry as well as movies that show actual implementations of scheduling systems. The main structure of the book, as per previous editions, consists of three parts. The first part focuses on deterministic scheduling and the related combinatorial problems. The second part covers probabilistic scheduling models; in this part it is assumed that processing times and other problem data are random and not known in advance. The third part deals with scheduling in practice; it covers heuristics that are popular with practitioners and discusses system design and implementation issues. All three parts of this new edition have been revamped, streamlined, and extended. The reference...

  4. 1993 Wholesale Power and Transmission Rate Schedules.

    Energy Technology Data Exchange (ETDEWEB)

    US Bonneville Power Administration

    1993-10-01

    Bonneville Power Administration 1993 Wholesale Power Rate Schedules and General Rate Schedule Provisions and 1993 Transmission Rate Schedules and General Transmission Rate Schedule Provisions, contained herein, were approved on an interim basis effective October 1, 1993. These rate schedules and provisions were approved by the Federal Energy Commission, United States Department of Energy, in September, 1993. These rate schedules and provisions supersede the Administration`s Wholesale Power Rate Schedules and General Rate Schedule Provisions and Transmission Rate Schedules and General Transmission Rate Schedule Provisions effective October 1, 1991.

  5. Robust and Flexible Scheduling with Evolutionary Computation

    DEFF Research Database (Denmark)

    Jensen, Mikkel T.

    the cost of a neighbourhood of schedules. The scheduling algorithm attempts to find a small set of schedules with an acceptable level of performance. The approach is demonstrated to significantly improve the robustness and flexibility of the schedules while at the same time producing schedules with a low...

  6. Multiagent scheduling models and algorithms

    CERN Document Server

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

    2014-01-01

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

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

  8. Immunization Schedules for Infants and Children

    Science.gov (United States)

    ... ACIP Vaccination Recommendations Why Immunize? Vaccines: The Basics Immunization Schedules for Infants and Children United States, 2017 ... any questions. View or Print a Schedule Recommended Immunizations for Children (Birth through 6 years) Schedule for ...

  9. Refinery scheduling

    Energy Technology Data Exchange (ETDEWEB)

    Magalhaes, Marcus V.; Fraga, Eder T. [PETROBRAS, Rio de Janeiro, RJ (Brazil); Shah, Nilay [Imperial College, London (United Kingdom)

    2004-07-01

    This work addresses the refinery scheduling problem using mathematical programming techniques. The solution adopted was to decompose the entire refinery model into a crude oil scheduling and a product scheduling problem. The envelope for the crude oil scheduling problem is composed of a terminal, a pipeline and the crude area of a refinery, including the crude distillation units. The solution method adopted includes a decomposition technique based on the topology of the system. The envelope for the product scheduling comprises all tanks, process units and products found in a refinery. Once crude scheduling decisions are Also available the product scheduling is solved using a rolling horizon algorithm. All models were tested with real data from PETROBRAS' REFAP refinery, located in Canoas, Southern Brazil. (author)

  10. Application of genetic algorithm for scheduling and schedule coordination problems

    Energy Technology Data Exchange (ETDEWEB)

    Shrivastava, P. [S. P. Engineering College, Dept. of Civil Engineering, Andheri (W), Mumbai (India); Dhingra, S. L. [ITT Bombay, Dept. of Civil Enginering, Mumbai (India); Gundaliya, P. J. [L. D. College of Engineeering, Dept. of Civil Engineering, Ahmedabad, Gujrat (India)

    2002-12-31

    Problems of scheduling and schedule co-ordination and the conflicting objectives of transportation system users and transportation system operators are discussed. In schedule coordination problems time plays an important role. Users are interested in coordinating services within acceptable waiting time, whereas operators prefer to have lesser service and want to meet higher demands, which invariably increases waiting time. The problems are complex and conventional approaches to solving them are not useful. Genetic algorithm has been identified as an approach which performs well in solving such multi-objective problems. The general algorithmic approach has been found to be highly sensitive to penalties, but assuming that computational time is no constraint and realistic penalties can be decided in advance, judged in terms of their relative importance to outcomes, results can improve substantially. 13 refs., 3 tabs.

  11. Endogenous scheduling preferences and congestion

    DEFF Research Database (Denmark)

    Fosgerau, Mogens; Small, Kenneth

    2010-01-01

    . Compared to the predictions of an analyst observing untolled equilibrium and taking scheduling preferences as exogenous, we find that both the optimal capacity and the marginal external cost of congestion have changed. The benefits of tolling are greater, and the optimal time varying toll is different....

  12. Endogenous scheduling preferences and congestion

    DEFF Research Database (Denmark)

    Fosgerau, Mogens; Small, Kenneth

    2010-01-01

    Dynamic models of congestion so far rely on exogenous scheduling preferences of travelers, based for example on disutility of deviation from a preferred departure or arrival time for a trip. This paper provides a more fundamental view in which travelers derive utility just from consumption and le...

  13. Rostering and Task Scheduling

    DEFF Research Database (Denmark)

    Dohn, Anders Høeg

    . The rostering process is non-trivial and especially when service is required around the clock, rostering may involve considerable effort from a designated planner. Therefore, in order to minimize costs and overstaffing, to maximize the utilization of available staff, and to ensure a high level of satisfaction......In a modern society, manpower can be both a scarce and an expensive resource. Skilled personnel is usually in high demand and accounts for a significant part of total expenses in many companies. When the work is divided in shifts, a roster is compiled to allocate these to the employees....... Mathematical and logic-based models are presented for the problems considered. Novel components are added to existing models and the modeling decisions are justified. In one case, the model is solved by a simple, but efficient greedy construction heuristic. In the remaining cases, column generation is applied...

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

  15. Project management with dynamic scheduling baseline scheduling, risk analysis and project control

    CERN Document Server

    Vanhoucke, Mario

    2013-01-01

    The topic of this book is known as dynamic scheduling, and is used to refer to three dimensions of project management and scheduling: the construction of a baseline schedule and the analysis of a project schedule's risk as preparation of the project control phase during project progress. This dynamic scheduling point of view implicitly assumes that the usability of a project's baseline schedule is rather limited and only acts as a point of reference in the project life cycle.

  16. DME Prosthetics Orthotics, and Supplies Fee Schedule

    Data.gov (United States)

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

  17. 77 FR 64848 - Proposed Collection; Comment Request for Form 1120S, Schedule D, Schedule K-1, and Schedule M-3

    Science.gov (United States)

    2012-10-23

    ..., etc., Schedule M-3 (Form 1120S), Net Income (Loss) Reconciliation for S Corporations With Total Assets... Losses and Built-In Gains, Schedule M-3 (Form 1120S), Net Income (Loss) Reconciliation for S Corporations With Total Assets of $10 Million or More, and Schedule K-1 (Form 1120S), Shareholder's Share of Income...

  18. AVLIS production plant project schedule and milestones

    Energy Technology Data Exchange (ETDEWEB)

    1984-11-15

    An AVLIS Production Plant Deployment Schedule for the engineering, procurement, and construction for both the Initial Increment of Production and the fully Activated Plant, has been developed by the project team consisting of Lawrence Livermore National Laboratory, Martin Marietta Energy Systems, Inc. with architect-engineer support from Bechtel National, Inc., Stone and Webster Engineering Corporation, and Westinghouse Corporation. The initial deployment phase consists of six separators modules and the three laser power amplifier modules consistent with the FY84 reference design with a name plate capacity of 5 million separative work units/yr followed by a full plant activation to approximately 13 million separative work units/yr. The AVLIS Production Plant project team's strategy for deployment schedule analysis focused on three schedule options: engineering limited schedule; authorization limited schedule; and funding limited project schedule. The three deployment schedule options developed by AVLIS project team have been classified in ranges such as an optimistic, rapid/moderate, or moderate/pessimistic based on the probability of meeting the individual schedule option's major milestones or program objectives of enriching uranium by the AVLIS process in an effective cost and schedule manner. 47 figures, 7 tables.

  19. TECHNICAL COORDINATION, SCHEDULE AND INTEGRATION

    CERN Multimedia

    A. Ball

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

  20. TECHNICAL COORDINATION, SCHEDULE AND INTEGRATION

    CERN Multimedia

    A. Ball

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

  1. TECHNICAL COORDINATION, SCHEDULE AND INTEGRATION

    CERN Multimedia

    A. Ball

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

  2. Clustering and scheduling maintenance tasks over time

    OpenAIRE

    Kreuger, Per

    2008-01-01

    We report results on a maintenance scheduling problem. The problem consists of allocating maintenance task instances to and scheduling the performances of a suitable number of maintenance packages. The number of maintenance packages is not fixed, nor is, in general, the dates or durations of their performances. A constraint programming (CP) model and solver for the problem is presented together with preliminary computational results.

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

    NARCIS (Netherlands)

    Kortbeek, Nikky; Zonderland, Maartje Elisabeth; Braaksma, Aleida; Vliegen, Ingrid; Boucherie, Richardus J.; Litvak, Nelli; Hans, Elias 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

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

  5. Records Control Schedules Repository

    Data.gov (United States)

    National Archives and Records Administration — The Records Control Schedules (RCS) repository provides access to scanned versions of records schedules, or Standard Form 115, Request for Records Disposition...

  6. Schedule Analytics

    Science.gov (United States)

    2016-04-30

    led several cost research initiatives in cloud computing, service-oriented architecture , and agile development and various independent schedule...systems and platforms. Manring is trained and experienced on a number of commercial parametric software cost models and risk analysis tools. She has...and he supports DoD and federal acquisition efforts with a focus on rapid and agile practices to speed solutions with the lowest practical program

  7. Mission Operations Planning and Scheduling System (MOPSS)

    Science.gov (United States)

    Wood, Terri; Hempel, Paul

    2011-01-01

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

  8. Online Scheduling

    OpenAIRE

    Sgall, Jiri

    2005-01-01

    We survey some recent results on scheduling unit jobs. The emphasis of the talk is both on presenting some basic techniques and providing an overview of the current state of the art. The techniques presented cover charging schemes, potential function arguments, and lower bounds based on Yao's principle. The studied problem is equivalent to the following buffer management problem: packets with specified weights and deadlines arrive at a network switch and need to be forwarded so that the total...

  9. Simultaneous scheduling of machines and mobile robots

    DEFF Research Database (Denmark)

    Dang, Vinh Quang; Nielsen, Izabela Ewa

    2013-01-01

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

  10. Integrated Job Scheduling and Network Routing

    DEFF Research Database (Denmark)

    Gamst, Mette; Pisinger, David

    2013-01-01

    We consider an integrated job scheduling and network routing problem which appears in Grid Computing and production planning. The problem is to schedule a number of jobs at a finite set of machines, such that the overall profit of the executed jobs is maximized. Each job demands a number...... of resources which must be sent to the executing machine through a network with limited capacity. A job cannot start before all of its resources have arrived at the machine. The scheduling problem is formulated as a Mixed Integer Program (MIP) and proved to be NP-hard. An exact solution approach using Dantzig......, interior point stabilization is used to decrease the number of columns generated in the branch-and-price algorithm. The algorithm is experimentally evaluated on job scheduling instances for a Grid network. The Dantzig- Wolfe algorithm with stabilization is clearly superior, being able to solve large...

  11. Enabling a New Planning and Scheduling Paradigm

    Science.gov (United States)

    Jaap, John; Davis, Elizabeth

    2004-01-01

    The Flight Projects Directorate at NASA's Marshall Space Flight Center is developing a new planning and scheduling environment and a new scheduling algorithm to enable a paradigm shift in planning and scheduling concepts. Over the past 33 years Marshall has developed and evolved a paradigm for generating payload timelines for Skylab, Spacelab, various other Shuttle payloads, and the International Space Station. The current paradigm starts by collecting the requirements, called "tasks models," from the scientists and technologists for the tasks that they want to be done. Because of shortcomings in the current modeling schema, some requirements are entered as notes. Next a cadre with knowledge of vehicle and hardware modifies these models to encompass and be compatible with the hardware model; again, notes are added when the modeling schema does not provide a better way to represent the requirements. Finally, another cadre further modifies the models to be compatible with the scheduling engine. This last cadre also submits the models to the scheduling engine or builds the timeline manually to accommodate requirements that are expressed in notes. A future paradigm would provide a scheduling engine that accepts separate science models and hardware models. The modeling schema would have the capability to represent all the requirements without resorting to notes. Furthermore, the scheduling engine would not require that the models be modified to account for the capabilities (limitations) of the scheduling engine. The enabling technology under development at Marshall has three major components. (1) A new modeling schema allows expressing all the requirements of the tasks without resorting to notes or awkward contrivances. The chosen modeling schema is both maximally expressive and easy to use. It utilizes graphics methods to show hierarchies of task constraints and networks of temporal relationships. (2) A new scheduling algorithm automatically schedules the models

  12. GSA eLibrary Schedules and Contracts

    Data.gov (United States)

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

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

    Science.gov (United States)

    Majerowicz, Walt; Shinn, Stephen A.

    2016-01-01

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

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

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

  16. Dry kiln schedules for commercial woods : temperate and tropical

    Science.gov (United States)

    R. Sidney Boone; Charles J. Kozlik; Paul J. Bois; Eugene M. Wengert

    1988-01-01

    This report contains suggested dry kiln schedules for over 500 commercial woods, both temperate and tropical. Kiln schedules are completely assembled and written out for easy use. Schedules for several thicknesses and specialty products (e.g. squares, handle stock, gunstock blanks) are given for many species. The majority of the schedules are from the world literature...

  17. Cost and schedule estimation study report

    Science.gov (United States)

    Condon, Steve; Regardie, Myrna; Stark, Mike; Waligora, Sharon

    1993-01-01

    This report describes the analysis performed and the findings of a study of the software development cost and schedule estimation models used by the Flight Dynamics Division (FDD), Goddard Space Flight Center. The study analyzes typical FDD projects, focusing primarily on those developed since 1982. The study reconfirms the standard SEL effort estimation model that is based on size adjusted for reuse; however, guidelines for the productivity and growth parameters in the baseline effort model have been updated. The study also produced a schedule prediction model based on empirical data that varies depending on application type. Models for the distribution of effort and schedule by life-cycle phase are also presented. Finally, this report explains how to use these models to plan SEL projects.

  18. 10 CFR 2.332 - General case scheduling and management.

    Science.gov (United States)

    2010-01-01

    ... 10 Energy 1 2010-01-01 2010-01-01 false General case scheduling and management. 2.332 Section 2... Management for NRC Adjudicatory Hearings § 2.332 General case scheduling and management. (a) Scheduling order... scheduling order must have as its objectives proper case management purposes such as: (1) Expediting the...

  19. Planning, scheduling, and control for automatic telescopes

    Science.gov (United States)

    Drummond, Mark; Swanson, Keith; Philips, Andy; Levinson, Rich; Bresina, John

    1992-01-01

    This paper presents an argument for the appropriateness of Entropy Reduction Engine (ERE) technology to the planning, scheduling, and control components of Automatic Photoelectric Telescope (APT) management. The paper is organized as follows. In the next section, we give a brief summary of the planning and scheduling requirements for APTs. Following this, in section 3, we give an ERE project precis, couched primarily in terms of project objectives. Section 4 gives a sketch of the match-up between problem and technology, and section 5 outlines where we want to go with this work.

  20. Integrated scheduling of tasks and gynecologists to improve patient appointment scheduling : a case study

    NARCIS (Netherlands)

    van de Vrugt, Maartje; Luen-English, Samuel J.; Bastiaansen, W.A.P.; Kleinluchtenbeld, S.; Lardinois, W.T.P.; Pots, M.H.; Schoonbergen, D.H.; Hans, Erwin W.; Hurink, Johann L.; Boucherie, Richardus J.

    Like many hospital departments, the gynecology department of the Jeroen Bosch Hospital experienced difficulties with scheduling outpatient appointments at the medically preferred times. Despite the time invested in creating the schedule, the compliance of the achieved schedules with the preferences

  1. A heuristic approach to incremental and reactive scheduling

    Science.gov (United States)

    Odubiyi, Jide B.; Zoch, David R.

    1989-01-01

    An heuristic approach to incremental and reactive scheduling is described. Incremental scheduling is the process of modifying an existing schedule if the initial schedule does not meet its stated initial goals. Reactive scheduling occurs in near real-time in response to changes in available resources or the occurrence of targets of opportunity. Only minor changes are made during both incremental and reactive scheduling because a goal of re-scheduling procedures is to minimally impact the schedule. The described heuristic search techniques, which are employed by the Request Oriented Scheduling Engine (ROSE), a prototype generic scheduler, efficiently approximate the cost of reaching a goal from a given state and effective mechanisms for controlling search.

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

    NARCIS (Netherlands)

    Gracia, P.; Kalmijn, M.

    2016-01-01

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

  3. Class Schedules Need Class.

    Science.gov (United States)

    Monfette, Ronald J.

    1986-01-01

    Argues that college publications, including class schedules, must be accurate, timely, and easy to read and follow. Describes Schoolcraft College's unified format approach to publications marketing. Offers suggestions on the design, format, and distribution of class schedules. (DMM)

  4. Departure Queue Prediction for Strategic and Tactical Surface Scheduler Integration

    Science.gov (United States)

    Zelinski, Shannon; Windhorst, Robert

    2016-01-01

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

  5. Parental Work Schedules and Children's Cognitive Trajectories

    Science.gov (United States)

    Han, Wen-Jui; Fox, Liana E.

    2011-01-01

    Previous work has shown an association between mothers' nonstandard work schedules and children's well-being. We built on this research by examining the relationship between parental shift work and children's reading and math trajectories from age 5-6 to 13-14. Using data (N = 7,105) from the National Longitudinal Survey of Youth and growth-curve…

  6. Schedule and status of irradiation experiments

    Energy Technology Data Exchange (ETDEWEB)

    Rowcliffe, A.F.; Grossbeck, M.L.; Robertson, J.P. [Oak Ridge National Lab., TN (United States)

    1998-09-01

    The current status of reactor irradiation experiments is presented in tables summarizing the experimental objectives, conditions, and schedule. Currently, the program has one irradiation experiment in reactor and five experiments in the design or construction stages. Postirradiation examination and testing is in progress on ten experiments.

  7. An integrated scheduling and program management system

    Science.gov (United States)

    Porter, D.; Gibson, J. D.; Williams, G. G.

    2012-09-01

    An integrated scheduling and program management system is being developed for the MMT Observatory (MMTO), Arizona, USA. A systems engineering approach is used to combine existing and new relational databases, spreadsheets, file storage systems, and web-based user interfaces into a single unified system. An overview of software design, data management, user interfaces, and techniques for performance assessment is presented. Goals of this system include streamlined data management and an optimized user experience. The MMTO has over a dozen different telescope configurations, including three secondary mirrors and a wide range of observing instruments. Scheduling is complex for the varying telescope configurations, limited available observing time, and appropriate astronomic conditions (e.g., lunar phase) for each science project. Scheduled telescope configurations can be used to perform safety checks of actual configuration during telescope operations. Programmatic information is automatically input into nightly telescope operator (TO) logs by the system. The TO's provide additional information into the system on telescope usage, observing conditions (e.g., weather conditions), and observatory closure (e.g., from instrument malfunction or inclement weather). All of this information is synthesized to assess telescope and observatory performance. Web interfaces to the system can be used by observers to submit information, such as travel plans, instrumentation requirements, and observing catalogs. A service request (SR) (i.e., trouble report) system has also been developed for tracking operational issues. The specific needs of the MMTO have been met through in-house software development of this integrated scheduling and program management system.

  8. Immunization Schedules for Adults

    Science.gov (United States)

    ... ACIP Vaccination Recommendations Why Immunize? Vaccines: The Basics Immunization Schedules for Adults in Easy-to-read Formats ... previous immunizations. View or Print a Schedule Recommended Immunizations for Adults (19 Years and Older) by Age ...

  9. Activity Schedule And Anticipation Training As Counselling ...

    African Journals Online (AJOL)

    Activity Schedule And Anticipation Training As Counselling Strategies In Managing Mild-depression Among Nigerian Adolescents. ... To select the participants for the study, The Self-Rating Depression Scale (SDS) was administered to assess the cognitive, affective, psychomotor, somatic and social interpersonal ...

  10. Project orientated planning, scheduling and controlling technique ...

    African Journals Online (AJOL)

    Project orientated planning, scheduling and controlling technique. ... In the past several years, there has been an explosive growth of management technique to be used for planning and controlling projects. ... Comparison of actual times with available times enables control to be exerted in the performance of the project.

  11. Scheduling in Engineering, Project, and Production Management

    OpenAIRE

    Chien-Ho Ko

    2015-01-01

    This issue presents five papers selected from the 2013 (4th) International Conference on Engineering, Project, and Production Management (EPPM2013) held in Bangkok, Thailand. Three of the papers deal with scheduling problems faced in project and production management, while the remaining two focus on engineering management issues.

  12. Rotating Workforce Scheduling

    OpenAIRE

    Granfeldt, Caroline

    2015-01-01

    Several industries use what is called rotating workforce scheduling. This often means that employees are needed around the clock seven days a week, and that they have a schedule which repeats itself after some weeks. This thesis gives an introduction to this kind of scheduling and presents a review of previous work done in the field. Two different optimization models for rotating workforce scheduling are formulated and compared, and some examples are created to demonstrate how the addition of...

  13. Scheduling of container storage and retrieval

    NARCIS (Netherlands)

    Vis, I.F.A.; Roodbergen, K.J.

    2009-01-01

    We consider the problem of scheduling the storage and retrieval of containers in the storage area of a container terminal. Some arcs in the underlying directed network must be visited; other arcs may be-but need not be-visited. We can. therefore, consider this problem to be a special case of the

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

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

  16. Web Publishing Schedule

    Science.gov (United States)

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

  17. Achieving reutilization of scheduling software through abstraction and generalization

    Science.gov (United States)

    Wilkinson, George J.; Monteleone, Richard A.; Weinstein, Stuart M.; Mohler, Michael G.; Zoch, David R.; Tong, G. Michael

    1995-01-01

    Reutilization of software is a difficult goal to achieve particularly in complex environments that require advanced software systems. The Request-Oriented Scheduling Engine (ROSE) was developed to create a reusable scheduling system for the diverse scheduling needs of the National Aeronautics and Space Administration (NASA). ROSE is a data-driven scheduler that accepts inputs such as user activities, available resources, timing contraints, and user-defined events, and then produces a conflict-free schedule. To support reutilization, ROSE is designed to be flexible, extensible, and portable. With these design features, applying ROSE to a new scheduling application does not require changing the core scheduling engine, even if the new application requires significantly larger or smaller data sets, customized scheduling algorithms, or software portability. This paper includes a ROSE scheduling system description emphasizing its general-purpose features, reutilization techniques, and tasks for which ROSE reuse provided a low-risk solution with significant cost savings and reduced software development time.

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

  19. Endogenous scheduling preferences and congestion

    DEFF Research Database (Denmark)

    Fosgerau, Mogens; Small, Kenneth

    2017-01-01

    We consider the timing of activities through a dynamic model of commuting with congestion, in which workers care solely about leisure and consumption. Implicit preferences for the timing of the commute form endogenously due to temporal agglomeration economies. Equilibrium exists uniquely and is i......We consider the timing of activities through a dynamic model of commuting with congestion, in which workers care solely about leisure and consumption. Implicit preferences for the timing of the commute form endogenously due to temporal agglomeration economies. Equilibrium exists uniquely...... and is indistinguishable from that of a generalized version of the classical Vickrey bottleneck model, based on exogenous trip-timing preferences, but optimal policies differ: the Vickrey model will misstate the benefits of a capacity increase, it will underpredict the benefits of congestion pricing, and pricing may make...

  20. Embedded multiprocessors scheduling and synchronization

    CERN Document Server

    Sriram, Sundararajan

    2009-01-01

    Techniques for Optimizing Multiprocessor Implementations of Signal Processing ApplicationsAn indispensable component of the information age, signal processing is embedded in a variety of consumer devices, including cell phones and digital television, as well as in communication infrastructure, such as media servers and cellular base stations. Multiple programmable processors, along with custom hardware running in parallel, are needed to achieve the computation throughput required of such applications. Reviews important research in key areas related to the multiprocessor implementation of multi

  1. Flexible work schedules, older workers, and retirement.

    Science.gov (United States)

    Siegenthaler, J K; Brenner, A M

    2000-01-01

    Older workers in the United States indicate that they would prefer flexible work arrangements rather than abrupt retirement, yet management has done very little to make this possible. A review of two bodies of literature from the late 1980s is presented: social science writings including sociological, gerontological, and economic literature, and business and management literature. There is a clash between the way jobs are traditionally scheduled and the needs of growing numbers of older workers. Workers continue to be subject to obstacles to phased retirement due to the structuring of health care and pension benefits, downsizing, organizational inflexibility, and "corporate culture." Thus, general views among social scientists regarding the desirability of flexible schedules toward retirement will not produce real changes unless management becomes committed to such changes and they are securely embedded in company policies.

  2. Present and future hydropower scheduling in Statkraft

    Science.gov (United States)

    Bruland, O.

    2012-12-01

    Statkraft produces close to 40 TWH in an average year and is one of the largest hydropower producers in Europe. For hydropower producers the scheduling of electricity generation is the key to success and this depend on optimal use of the water resources. The hydrologist and his forecasts both on short and on long terms are crucial to this success. The hydrological forecasts in Statkraft and most hydropower companies in Scandinavia are based on lumped models and the HBV concept. But before the hydrological model there is a complex system for collecting, controlling and correcting data applied in the models and the production scheduling and, equally important, routines for surveillance of the processes and manual intervention. Prior to the forecasting the states in the hydrological models are updated based on observations. When snow is present in the catchments snow surveys are an important source for model updating. The meteorological forecast is another premise provider to the hydrological forecast and to get as precise meteorological forecast as possible Statkraft hires resources from the governmental forecasting center. Their task is to interpret the meteorological situation, describe the uncertainties and if necessary use their knowledge and experience to manually correct the forecast in the hydropower production regions. This is one of several forecast applied further in the scheduling process. Both to be able to compare and evaluate different forecast providers and to ensure that we get the best available forecast, forecasts from different sources are applied. Some of these forecasts have undergone statistical corrections to reduce biases. The uncertainties related to the meteorological forecast have for a long time been approached and described by ensemble forecasts. But also the observations used for updating the model have a related uncertainty. Both to the observations itself and to how well they represent the catchment. Though well known, these

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

    Directory of Open Access Journals (Sweden)

    Chandramouli Anandaraman

    2011-10-01

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

  4. Training and certification of work schedule managers may improve shift scheduling practices

    Science.gov (United States)

    2011-02-01

    The Federal Railroad Administration (FRA) Human Factors Research and Development (R&D) Program : sponsored the implementation of a strategic job analysis to investigate the job of work schedule managers : (WSMs) across a diverse range of industries t...

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

    Energy Technology Data Exchange (ETDEWEB)

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

    2013-12-06

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

  6. Algorithms for Scheduling and Network Problems

    Science.gov (United States)

    1991-09-01

    Baruch Awerbuch while at MIT, and I thank him for serving on my thesis committee as well. My fellow students Cliff Stein and David Williamson have both...least one processor per operation, this can be done in NC using the edge-coloring algorithm of Lev , Pippinger, and Valiant [84]. We can extend this to...scheduling unrelated parallel machines. Mathematical Programming, 46:259-271, 1990. [84] G. F. Lev , N. Pippenger, and L. G. Valiant. A fast parallel

  7. Projecting Future Scheduled Airline Demand, Schedules and NGATS Benefits Using TSAM

    Science.gov (United States)

    Dollyhigh, Samuel; Smith, Jeremy; Viken, Jeff; Trani, Antonio; Baik, Hojong; Hinze, Nickolas; Ashiabor, Senanu

    2006-01-01

    The Transportation Systems Analysis Model (TSAM) developed by Virginia Tech s Air Transportation Systems Lab and NASA Langley can provide detailed analysis of the effects on the demand for air travel of a full range of NASA and FAA aviation projects. TSAM has been used to project the passenger demand for very light jet (VLJ) air taxi service, scheduled airline demand growth and future schedules, Next Generation Air Transportation System (NGATS) benefits, and future passenger revenues for the Airport and Airway Trust Fund. TSAM can project the resulting demand when new vehicles and/or technology is inserted into the long distance (100 or more miles one-way) transportation system, as well as, changes in demand as a result of fare yield increases or decreases, airport transit times, scheduled flight times, ticket taxes, reductions or increases in flight delays, and so on. TSAM models all long distance travel in the contiguous U.S. and determines the mode choice of the traveler based on detailed trip costs, travel time, schedule frequency, purpose of the trip (business or non-business), and household income level of the traveler. Demand is modeled at the county level, with an airport choice module providing up to three airports as part of the mode choice. Future enplanements at airports can be projected for different scenarios. A Fratar algorithm and a schedule generator are applied to generate future flight schedules. This paper presents the application of TSAM to modeling future scheduled air passenger demand and resulting airline schedules, the impact of NGATS goals and objectives on passenger demand, along with projections for passenger fee receipts for several scenarios for the FAA Airport and Airway Trust Fund.

  8. Message Scheduling and Forwarding in Congested DTNs

    KAUST Repository

    Elwhishi, Ahmed

    2012-08-19

    Multi-copy utility-based routing has been considered as one of the most applicable approaches to effective message delivery in Delay Tolerant Networks (DTNs). By allowing multiple message replicas launched, the ratio of message delivery or delay can be significantly reduced compared with other counterparts. Such an advantage, nonetheless, is at the expense of taking more buffer space at each node and higher complexity in message forwarding decisions. This paper investigates an efficient message scheduling and dropping policy via analytical modeling approach, aiming to achieve optimal performance in terms of message delivery delay. Extensive simulation results, based on a synthetic mobility model and real mobility traces, show that the proposed scheduling framework can achieve superb performance against its counterparts in terms of delivery delay.

  9. Training and Operations Integrated Calendar Scheduler - TROPICS

    Energy Technology Data Exchange (ETDEWEB)

    J.E. Oppenlander; A.J. Levy; V.A. Arbige; A.H. Shoop

    2003-01-27

    TROPICS is a rule-based scheduling system that optimizes the training experience for students in a power (note this change should be everywhere, i.e. Not reactor) plant environment. The problem is complicated by the condition that plant resources and users' time must be simultaneously scheduled to make best use of both. The training facility is highly constrained in how it is used, and, as in many similar environments, subject to dynamic change with little or no advance notice. The flexibility required extends to changes resulting from students' actions such as absences. Even though the problem is highly constrained by plant usage and student objectives, the large number of possible schedules is a concern. TROPICS employs a control strategy for rule firing to prune the possibility tree and avoid combinatorial explosion. The application has been in use since 1996, first as a prototype for testing and then in production. Training Coordinators have a philosophical aspect to teaching students that has made the rule-based approach much more verifiable and satisfying to the domain experts than other forms of capturing expertise.

  10. Mathematical programming and financial objectives for scheduling projects

    CERN Document Server

    Kimms, Alf

    2001-01-01

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

  11. CARMENES instrument control system and operational scheduler

    Science.gov (United States)

    Garcia-Piquer, Alvaro; Guàrdia, Josep; Colomé, Josep; Ribas, Ignasi; Gesa, Lluis; Morales, Juan Carlos; Pérez-Calpena, Ana; Seifert, Walter; Quirrenbach, Andreas; Amado, Pedro J.; Caballero, José A.; Reiners, Ansgar

    2014-07-01

    The main goal of the CARMENES instrument is to perform high-accuracy measurements of stellar radial velocities (1m/s) with long-term stability. CARMENES will be installed in 2015 at the 3.5 m telescope in the Calar Alto Observatory (Spain) and it will be equipped with two spectrographs covering from the visible to the near-infrared. It will make use of its near-IR capabilities to observe late-type stars, whose peak of the spectral energy distribution falls in the relevant wavelength interval. The technology needed to develop this instrument represents a challenge at all levels. We present two software packages that play a key role in the control layer for an efficient operation of the instrument: the Instrument Control System (ICS) and the Operational Scheduler. The coordination and management of CARMENES is handled by the ICS, which is responsible for carrying out the operations of the different subsystems providing a tool to operate the instrument in an integrated manner from low to high user interaction level. The ICS interacts with the following subsystems: the near-IR and visible channels, composed by the detectors and exposure meters; the calibration units; the environment sensors; the front-end electronics; the acquisition and guiding module; the interfaces with telescope and dome; and, finally, the software subsystems for operational scheduling of tasks, data processing, and data archiving. We describe the ICS software design, which implements the CARMENES operational design and is planned to be integrated in the instrument by the end of 2014. The CARMENES operational scheduler is the second key element in the control layer described in this contribution. It is the main actor in the translation of the survey strategy into a detailed schedule for the achievement of the optimization goals. The scheduler is based on Artificial Intelligence techniques and computes the survey planning by combining the static constraints that are known a priori (i.e., target

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

  13. Courts, Scheduled Damages, and Medical Malpractice Insurance

    DEFF Research Database (Denmark)

    Bertoli, Paola; Grembi, Veronica

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

  14. Some extensions of the discrete lotsizing and scheduling problem

    NARCIS (Netherlands)

    M. Salomon (Marc); L.G. Kroon (Leo); R. Kuik (Roelof); L.N. van Wassenhove (Luk)

    1991-01-01

    textabstractIn this paper the Discrete Lotsizing and Scheduling Problem (DLSP) is considered. DLSP relates to capacitated lotsizing as well as to job scheduling problems and is concerned with determining a feasible production schedule with minimal total costs in a single-stage manufacturing process.

  15. Probabilistic Bisimulation for Realistic Schedulers

    DEFF Research Database (Denmark)

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

    2015-01-01

    . This holds in the classical context of arbitrary schedulers, but it has been argued that this class of schedulers is unrealistically powerful. This paper studies a strictly coarser notion of bisimilarity, which still enjoys these properties in the context of realistic subclasses of schedulers: Trace...... distribution equivalence is implied for partial information schedulers, and compositionality is preserved by distributed schedulers. The intersection of the two scheduler classes thus spans a coarser and still reasonable compositional theory of behavioral semantics....

  16. 14 CFR 213.5 - Filing and service of schedules and applications for approval of schedules; procedure thereon.

    Science.gov (United States)

    2010-01-01

    ... applications for approval of schedules; procedure thereon. 213.5 Section 213.5 Aeronautics and Space OFFICE OF... applications for approval of schedules; procedure thereon. (a) Number of copies and certificate of service. An original and three copies of each schedule, and an original and seven (7) copies of application for...

  17. 5 CFR 532.261 - Special wage schedules for leader and supervisory schedules for leader and supervisory wage...

    Science.gov (United States)

    2010-01-01

    ... 5 Administrative Personnel 1 2010-01-01 2010-01-01 false Special wage schedules for leader and supervisory schedules for leader and supervisory wage employees in the Puerto Rico wage area. 532.261 Section... RATE SYSTEMS Prevailing Rate Determinations § 532.261 Special wage schedules for leader and supervisory...

  18. Software sizing, cost estimation and scheduling

    Science.gov (United States)

    Cheadle, William G.

    1988-01-01

    The Technology Implementation and Support Section at Martin Marietta Astronautics Group Denver is tasked with software development analysis, data collection, software productivity improvement and developing and applying various computerized software tools and models. The computerized tools are parametric models that reflect actuals taken from the large data base of completed software development projects. Martin Marietta's data base consists of over 300 completed projects and hundreds of cost estimating relationships (CERs) that are used in sizing, costing, scheduling and productivity improvement equations, studies, models and computerized tools.

  19. Binary Trees and Parallel Scheduling Algorithms.

    Science.gov (United States)

    1980-09-01

    child of N) and t (N)- t (right child of N) . For bur example, the binary comutation tree together with time intervals is shown in Figure 2.2. A...Operationafle, 10.5, Supp.7-33, 1976. 22. Lenstra, J. K., "Sequencing by enumerative methods," Mathematical Centre Tract 69, Mathematisch Centrum, Amsterdam...Theory of Scheduling and its applications, Lecture Notes -Tn Economics and Mathematical Systems, 86 -34- Springer, Berlin, pp. 393-398, i973. 35. Smith, W

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

    Energy Technology Data Exchange (ETDEWEB)

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

    1993-07-01

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

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

  2. The GBT Dynamic Scheduling System: Scheduling Applications of the Knapsack Problem and Sudoku

    Science.gov (United States)

    Sessoms, E.; Clark, M.; Marganian, P.; McCarty, M.; Shelton, A.

    2009-09-01

    We applied algorithmic approaches to both theoretical and practical aspects of scheduling the Robert C. Byrd Green Bank Telescope (GBT). When using a theoretical approach to scheduling, assigning a numerical value, or score, to a telescope period is only half of the problem. The other half consists of using the score to determine the best global arrangement of the telescope periods in order to maximize the scientific throughput of the telescope. The naive brute-force approach of trying all possible schedules is too computationally expensive. Instead we applied a well-studied approach from operations research, known as dynamic programming. Specifically, we found the so-called ``knapsack'' algorithm to be a good fit to this problem. On the other hand, we cannot actually achieve maximum theoretical efficiency due to many practical constraints on telescope scheduling. The most severe practical constraints are fixed periods that must be scheduled at a specific date and time regardless of possible score and windowed periods that must be scheduled in regular, recurring intervals. The primary difficulty in scheduling fixed and windowed sessions is that they have the potential to conflict and even to generate irresolvable conflicts (double booking). In working on this problem, we realized it shared many characteristics with the game of Sudoku. In Sudoku, there are many possible arrangements of the recurring numbers 1 through 9 (telescope sessions). Some of these are fixed (the hints) and the others must live in windows (distinct groups having one instance each of each digit). Sudoku puzzles are solved algorithmically using a heuristic-guided brute-force search. We followed a similar approach. A full brute-force search is, again, too computationally expensive, but we found ways to restrict the search enough to make it feasible. We used a number of heuristics but found the largest gains came from partitioning the problem into distinct subsets than can each be scheduled

  3. Charlo Class Scheduling Plan.

    Science.gov (United States)

    Fiebiger, Leo J.

    The design and implementation of a rotating class schedule which was put into effect in the Charlo High School, Charlo, Montana in September 1969 is discussed in this paper. The schedule, described in this report, consists of a 75-minute period followed by 2, 60-minute periods in the morning and 4, 45-minute afternoon periods. The program…

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

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

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

    NARCIS (Netherlands)

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

    2010-01-01

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

  7. MOV reliability evaluation and periodic verification scheduling

    Energy Technology Data Exchange (ETDEWEB)

    Bunte, B.D.

    1996-12-01

    The purpose of this paper is to establish a periodic verification testing schedule based on the expected long term reliability of gate or globe motor operated valves (MOVs). The methodology in this position paper determines the nominal (best estimate) design margin for any MOV based on the best available information pertaining to the MOVs design requirements, design parameters, existing hardware design, and present setup. The uncertainty in this margin is then determined using statistical means. By comparing the nominal margin to the uncertainty, the reliability of the MOV is estimated. The methodology is appropriate for evaluating the reliability of MOVs in the GL 89-10 program. It may be used following periodic testing to evaluate and trend MOV performance and reliability. It may also be used to evaluate the impact of proposed modifications and maintenance activities such as packing adjustments. In addition, it may be used to assess the impact of new information of a generic nature which impacts safety related MOVs.

  8. Scheduling and congestion control for wireless internet

    CERN Document Server

    Wang, Xin

    2014-01-01

    This brief proposes that the keys to internet cross-layer optimization are the development of non-standard implicit primal-dual solvers for underlying optimization problems, and design of jointly optimal network protocols as decomposition of such solvers. Relying on this novel design-space oriented approach, the author develops joint TCP congestion control and wireless-link scheduling schemes for wireless applications over Internet with centralized and distributed (multi-hop) wireless links. Different from the existing solutions, the proposed schemes can be asynchronously implemented without message passing among network nodes; thus they are readily deployed with current infrastructure. Moreover, global convergence/stability of the proposed schemes to optimal equilibrium is established using the Lyapunov method in the network fluid model. Simulation results are provided to evaluate the proposed schemes in practical networks.

  9. An algorithm for a single machine scheduling problem with sequence dependent setup times and scheduling windows

    Science.gov (United States)

    Moore, J. E.

    1975-01-01

    An enumeration algorithm is presented for solving a scheduling problem similar to the single machine job shop problem with sequence dependent setup times. The scheduling problem differs from the job shop problem in two ways. First, its objective is to select an optimum subset of the available tasks to be performed during a fixed period of time. Secondly, each task scheduled is constrained to occur within its particular scheduling window. The algorithm is currently being used to develop typical observational timelines for a telescope that will be operated in earth orbit. Computational times associated with timeline development are presented.

  10. Healthcare Scheduling by Data Mining: Literature Review and Future Directions

    Directory of Open Access Journals (Sweden)

    Maria M. Rinder

    2012-01-01

    Full Text Available This article presents a systematic literature review of the application of industrial engineering methods in healthcare scheduling, with a focus on the role of patient behavior in scheduling. Nine articles that used mathematical programming, data mining, genetic algorithms, and local searches for optimum schedules were obtained from an extensive search of literature. These methods are new approaches to solve the problems in healthcare scheduling. Some are adapted from areas such as manufacturing and transportation. Key findings from these studies include reduced time for scheduling, capability of solving more complex problems, and incorporation of more variables and constraints simultaneously than traditional scheduling methods. However, none of these methods modeled no-show and walk-ins patient behavior. Future research should include more variables related to patient and/or environment.

  11. Project control integrating cost and schedule in construction

    CERN Document Server

    Del Pico, Wayne J

    2013-01-01

    The key to successful project control is the fusing of cost to schedule whereby the management of one helps to manage the other. Project Control: Integrating Cost and Schedule in Construction explores the reasons behind and the methodologies for proper planning, monitoring, and controlling both project costs and schedule. Filling a current void the topic of project control applied to the construction industry, it is essential reading for students and professionals alike.

  12. Automated Scheduling Via Artificial Intelligence

    Science.gov (United States)

    Biefeld, Eric W.; Cooper, Lynne P.

    1991-01-01

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

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

    Science.gov (United States)

    2017-10-26

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

  14. Staff Scheduling for Inbound Call and Customer Contact Centers

    OpenAIRE

    Fukunaga, Alex; Hamilton, Ed; Fama, Jason; Andre, David; Matan, Ofer; Nourbakhsh, Illah

    2002-01-01

    The staff scheduling problem is a critical problem in the call center (or, more generally, customer contact center) industry. This article describes DIRECTOR, a staff scheduling system for contact centers. DIRECTOR is a constraint-based system that uses AI search techniques to generate schedules that satisfy and optimize a wide range of constraints and service-quality metrics. DIRECTOR has successfully been deployed at more than 800 contact centers, with significant measurable benefits, some ...

  15. Effects of Block Scheduling

    Directory of Open Access Journals (Sweden)

    William R. Veal

    1999-09-01

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

  16. Incubation lighting schedules and their interaction with matched or mismatched post hatch lighting schedules

    NARCIS (Netherlands)

    Pol, van der Carla W.; Roovert-Reijrink, van Inge A.M.; Aalbers, Gerald; Kemp, Bas; Brand, van den Henry

    2017-01-01

    The incidence of leg pathologies in broiler chickens with a developmental origin may be decreased by stimulating embryonic bone development through lighting schedules during incubation, but this may depend on post hatch lighting conditions. Aim was to investigate how lighting schedules during

  17. Scheduling for production teams

    Directory of Open Access Journals (Sweden)

    Yuri Mauergauz

    2015-09-01

    Full Text Available This paper presents a method of calendar (weekly scheduling for production teams, when the average orders utility function is used as the quality criterion. The method is based on the concept of “production intensity”, which is a dynamic parameter of production process. Applied software package allows scheduling for medium quantity of jobs. The result of software application is the team load on the planning horizon. The computed schedule may be corrected and recalculated in interactive mode. Current load of every team is taken into account at each recalculation. The method may be used for any combination of complex and specialized teams.

  18. 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....... By comparing EPS to classical schedules, EPS simulation provides more accurate results with regards to project goals. These instructions give you guidelines for preparing papers for Journal of Software (JSW). Use this document as a template if you are using Microsoft Word 6.0 or later. Otherwise, use...

  19. 18 CFR 5.19 - Tendering notice and schedule.

    Science.gov (United States)

    2010-04-01

    ... 18 Conservation of Power and Water Resources 1 2010-04-01 2010-04-01 false Tendering notice and schedule. 5.19 Section 5.19 Conservation of Power and Water Resources FEDERAL ENERGY REGULATORY COMMISSION, DEPARTMENT OF ENERGY REGULATIONS UNDER THE FEDERAL POWER ACT INTEGRATED LICENSE APPLICATION PROCESS § 5.19 Tendering notice and schedule. (a)...

  20. Introduction to Scheduling

    CERN Document Server

    Robert, Yves

    2009-01-01

    Reviewing classical methods, realistic models, and algorithms, this book offers a through introduction to scheduling. Coverage includes fundamental concepts and basic methods, recent research, and applications with a special focus on distributed systems and computational grids. Other topics include online scheduling, stochastic task-resource systems, and platform models. Examples, theorems, and pedagogical proofs create an interactive learning format. Though rigorous, the book provides enough background to be self-contained and fully accessible to computer scientists, mathematicians, and resea

  1. 5 CFR 9901.212 - Pay schedules and pay bands.

    Science.gov (United States)

    2010-01-01

    ... 5 Administrative Personnel 3 2010-01-01 2010-01-01 false Pay schedules and pay bands. 9901.212... SECURITY PERSONNEL SYSTEM (NSPS) Classification Classification Structure § 9901.212 Pay schedules and pay bands. (a) For purposes of identifying relative levels of work and corresponding pay ranges, the...

  2. Distributed Decision Making in Combined Vehicle Routing and Break Scheduling

    NARCIS (Netherlands)

    Meyer, Christoph Manuel; Kopfer, Herbert; Kok, A.L.; Schutten, Johannes M.J.

    2009-01-01

    The problem of combined vehicle routing and break scheduling comprises three subproblems: clustering of customer requests, routing of vehicles, and break scheduling. In practice, these subproblems are usually solved in the interaction between planners and drivers. We consider the case that the

  3. 78 FR 33444 - Records Schedules; Availability and Request for Comments

    Science.gov (United States)

    2013-06-04

    ...-462-13-1, 12 items, 11 temporary items). Records related to meat and poultry investigations and... permanent. The schedules listed in this notice are media neutral unless specified otherwise. An item in a... medium in which the records are created and maintained. Items included in schedules submitted to NARA on...

  4. On program restructuring, scheduling, and communication for parallel processor systems

    Energy Technology Data Exchange (ETDEWEB)

    Polychronopoulos, Constantine D. [Univ. of Illinois, Urbana, IL (United States)

    1986-08-01

    This dissertation discusses several software and hardware aspects of program execution on large-scale, high-performance parallel processor systems. The issues covered are program restructuring, partitioning, scheduling and interprocessor communication, synchronization, and hardware design issues of specialized units. All this work was performed focusing on a single goal: to maximize program speedup, or equivalently, to minimize parallel execution time. Parafrase, a Fortran restructuring compiler was used to transform programs in a parallel form and conduct experiments. Two new program restructuring techniques are presented, loop coalescing and subscript blocking. Compile-time and run-time scheduling schemes are covered extensively. Depending on the program construct, these algorithms generate optimal or near-optimal schedules. For the case of arbitrarily nested hybrid loops, two optimal scheduling algorithms for dynamic and static scheduling are presented. Simulation results are given for a new dynamic scheduling algorithm. The performance of this algorithm is compared to that of self-scheduling. Techniques for program partitioning and minimization of interprocessor communication for idealized program models and for real Fortran programs are also discussed. The close relationship between scheduling, interprocessor communication, and synchronization becomes apparent at several points in this work. Finally, the impact of various types of overhead on program speedup and experimental results are presented.

  5. The Liner Shipping Routing and Scheduling Problem Under Environmental Considerations

    DEFF Research Database (Denmark)

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

    2017-01-01

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

  6. Analysis and Optimisation of Hierarchically Scheduled Multiprocessor Embedded Systems

    DEFF Research Database (Denmark)

    Pop, Traian; Pop, Paul; Eles, Petru

    2008-01-01

    We present an approach to the analysis and optimisation of heterogeneous multiprocessor embedded systems. The systems are heterogeneous not only in terms of hardware components, but also in terms of communication protocols and scheduling policies. When several scheduling policies share a resource...

  7. Scheduling and Communication Synthesis for Distributed Real-Time Systems

    DEFF Research Database (Denmark)

    Pop, Paul

    2000-01-01

    proposed a less pessimistic schedulability analysis that is able to handle both control and data dependencies. Moreover, we have provided a schedulability analysis for the time-triggered protocol, and we have proposed several optimization strategies for the synthesis of communication protocol parameters...

  8. CMS Records Schedule

    Data.gov (United States)

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

  9. CERN confirms LHC schedule

    CERN Multimedia

    2003-01-01

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

  10. Registration Review Schedules

    Science.gov (United States)

    This schedule indicates plans for completion of risk assessments, proposed interim decisions and interim decisions for pesticides in the Registration Review program, EPA reviews all registered pesticides at least every 15 years as required by FIFRA.

  11. Managerial implications and suitability of a master surgical scheduling approach

    NARCIS (Netherlands)

    J.M. van Oostrum (Jeroen); E. Bredenhoff (Eelco); E.W. Hans (Erwin)

    2008-01-01

    textabstractMaster surgical scheduling can improve manageability and efficiency of operating room departments. This approach cyclically executes a master surgical schedule of surgery types. These surgery types need to be constructed with low variability to be efficient. Each surgery type is

  12. 77 FR 35065 - Records Schedules; Availability and Request for Comments

    Science.gov (United States)

    2012-06-12

    ... schedules). Once approved by NARA, records schedules provide mandatory instructions on what happens to... memorandums, briefing books, and issue papers. Proposed for permanent retention are records establishing the... case sentencing filed with the clerk of court in lieu of transcripts. 24. Federal Communications...

  13. 75 FR 48994 - Records Schedules; Availability and Request for Comments

    Science.gov (United States)

    2010-08-12

    ... schedules). Once approved by NARA, records schedules provide mandatory instructions on what happens to... files of an electronic information system used to track crack cocaine re-sentencing actions. 15... items). Issues files, communications files, committee files and other records of the Ombudsman. 17...

  14. 75 FR 41899 - Records Schedules; Availability and Request for Comments

    Science.gov (United States)

    2010-07-19

    ... schedules). Once approved by NARA, records schedules provide mandatory instructions on what happens to...). Correspondence regarding constituent issues sent the agency by members of Congress. Proposed for permanent..., including routine recordings and recordings that deal with security incidents. ] 37. U.S. Sentencing...

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

  16. Integrating Timetabling and Crew Scheduling at a Freight Railway Operator

    NARCIS (Netherlands)

    L. Bach (Lucas); T.A.B. Dollevoet (Twan); D. Huisman (Dennis)

    2014-01-01

    markdownabstract__Abstract__ We investigate to what degree we can integrate a Train Timetabling / Engine Scheduling Problem with a Crew Scheduling Problem. In the Timetabling Problem we design a timetable for the desired lines by fixing the departure and arrival times. Also, we allocate

  17. PAR Loop Schedule Review

    Energy Technology Data Exchange (ETDEWEB)

    Schaffer, Jr.; W.F.

    1958-04-30

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

  18. Manufacturing Scheduling Using Colored Petri Nets and Reinforcement Learning

    Directory of Open Access Journals (Sweden)

    Maria Drakaki

    2017-02-01

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

  19. Integrated scheduling and resource management. [for Space Station Information System

    Science.gov (United States)

    Ward, M. T.

    1987-01-01

    This paper examines the problem of integrated scheduling during the Space Station era. Scheduling for Space Station entails coordinating the support of many distributed users who are sharing common resources and pursuing individual and sometimes conflicting objectives. This paper compares the scheduling integration problems of current missions with those anticipated for the Space Station era. It examines the facilities and the proposed operations environment for Space Station. It concludes that the pattern of interdependecies among the users and facilities, which are the source of the integration problem is well structured, allowing a dividing of the larger problem into smaller problems. It proposes an architecture to support integrated scheduling by scheduling efficiently at local facilities as a function of dependencies with other facilities of the program. A prototype is described that is being developed to demonstrate this integration concept.

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

  1. ATLAS construction schedule

    CERN Multimedia

    Kotamaki, M

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

  2. Early detection of disease and scheduling of screening examinations.

    Science.gov (United States)

    Lee, Sandra; Huang, Hui; Zelen, Marvin

    2004-12-01

    Special examinations exist for many chronic diseases, which can diagnose the disease while it is asymptomatic, with no signs or symptoms. The earlier detection of disease may lead to more cures or longer survival. This possibility has led to public health programs which recommend populations to have periodic screening examinations for detecting specific chronic diseases, for example, cancer, diabetes, cardiovascular disease and so on. Such examination schedules when embedded in a public health program are invariably costly and are ordinarily not chosen on the basis of possible trade-offs in costs and benefits for different screening schedules. The possible candidate number of examination schedules is so large that it is not feasible to carry out clinical trials to compare different schedules. Instead, this problem can be investigated by developing a theoretical model which can predict the eventual disease specific mortality for different examination schedules. We have developed such a model. It is a stochastic model which assumes that i) the natural history of the disease is progressive and ii) any benefit from earlier diagnosis is due to a change in the distribution of disease stages at diagnosis (stage shift). The model is general and can be applied to any chronic disease which satisfies our two basic assumptions. We discuss the basic ideas of schedule sensitivity and lifetime schedule sensitivity and its relation to the reduction in disease specific mortality. Our theory is illustrated by applications to breast cancer screening. The investigation of schedules compares not only examination schedules with equal intervals between examinations but also staggered schedules using the threshold method. (Examinations are carried out when an individual's risk status reaches a preassigned threshold value.).

  3. Parental work schedules and child overweight and obesity.

    Science.gov (United States)

    Champion, S L; Rumbold, A R; Steele, E J; Giles, L C; Davies, M J; Moore, V M

    2012-04-01

    Studies in school-age children have consistently shown a positive association between maternal paid work hours and child obesity. However, there is conflicting evidence about the impact of maternal work hours scheduled at nonstandard times (for example, evenings, nights or weekends), and no previous examination of paternal work schedules and child weight. We examined the associations between maternal, paternal and combined parental paid work schedules and overweight/obesity in children at age 9 years. Data were analysed from the most recent follow-up of 9-year-old children (n=434) in an Australian birth cohort study. Children were measured and classified as overweight/obese using the International Obesity Taskforce body mass index cutoff points. Current working conditions of parents were obtained from a structured interview with the primary caregiver. Logistic regression analyses were used to investigate the effect of parental work schedules on child overweight/obesity with adjustment for a range of sociodemographic and household factors associated with parental employment and child weight. At 9 years of age, 99 children (22.8%) were overweight or obese. When parental work schedules were examined separately, child overweight/obesity was significantly associated with paternal nonstandard work schedules (adjusted odds ratio (OR) 1.97, 95% confidence interval (CI) 1.08-3.61). There was no association with any type of maternal work schedule. We also found an association between child overweight/obesity and circumstances in which both parents worked nonstandard schedules; however, this was of borderline statistical significance in the adjusted models (adjusted OR 2.26, 95% CI 0.99-5.16). Work hours scheduled at nonstandard times, when worked by the father or both parents, were associated with child overweight and obesity. These findings indicate the potential importance of fathers' paid work arrangements for child overweight/obesity, which until recently has largely

  4. Polygon scheduling

    NARCIS (Netherlands)

    Hurink, Johann L.

    1996-01-01

    Consider a set of circles of the same length and r irregular polygons with vertices on a circle of this length. Each of the polygons has to be arranged on a given subset of all circles and the positions of the polygon on the different circles are depending on each other. How should the polygons be

  5. Routing and Scheduling Algorithms for WirelessHARTNetworks: A Survey.

    Science.gov (United States)

    Nobre, Marcelo; Silva, Ivanovitch; Guedes, Luiz Affonso

    2015-04-24

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

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

    Directory of Open Access Journals (Sweden)

    Eliana María González-Neira

    2017-03-01

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

  7. Distributed Plug-and-Play Planning and Scheduling System Project

    Data.gov (United States)

    National Aeronautics and Space Administration — Planning and scheduling (P&S) is an essential task for managing current and future NASA missions. P&S systems are used in many areas of spacecraft operations...

  8. Instant Childhood Immunization Schedule

    Science.gov (United States)

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

  9. Electric power systems advanced forecasting techniques and optimal generation scheduling

    CERN Document Server

    Catalão, João P S

    2012-01-01

    Overview of Electric Power Generation SystemsCláudio MonteiroUncertainty and Risk in Generation SchedulingRabih A. JabrShort-Term Load ForecastingAlexandre P. Alves da Silva and Vitor H. FerreiraShort-Term Electricity Price ForecastingNima AmjadyShort-Term Wind Power ForecastingGregor Giebel and Michael DenhardPrice-Based Scheduling for GencosGovinda B. Shrestha and Songbo QiaoOptimal Self-Schedule of a Hydro Producer under UncertaintyF. Javier Díaz and Javie

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

  11. An Enabling Technology for New Planning and Scheduling Paradigms

    Science.gov (United States)

    Jaap, John; Davis, Elizabeth

    2004-01-01

    The Night Projects Directorate at NASA's Marshall Space Flight Center is developing a new planning and scheduling environment and a new scheduling algorithm to enable a paradigm shift in planning and scheduling concepts. Over the past 33 years Marshall has developed and evolved a paradigm for generating payload timelines for Skylab, Spacelab, various other Shuttle payloads, and the International Space Station. The current paradigm starts by collecting the requirements, called ?ask models," from the scientists and technologists for the tasks that are to be scheduled. Because of shortcomings in the current modeling schema, some requirements are entered as notes. Next, a cadre with knowledge of vehicle and hardware modifies these models to encompass and be compatible with the hardware model; again, notes are added when the modeling schema does not provide a better way to represent the requirements. Finally, the models are modified to be compatible with the scheduling engine. Then the models are submitted to the scheduling engine for automatic scheduling or, when requirements are expressed in notes, the timeline is built manually. A future paradigm would provide a scheduling engine that accepts separate science models and hardware models. The modeling schema would have the capability to represent all the requirements without resorting to notes. Furthermore, the scheduling engine would not require that the models be modified to account for the capabilities (limitations) of the scheduling engine. The enabling technology under development at Marshall has three major components: (1) A new modeling schema allows expressing all the requirements of the tasks without resorting to notes or awkward contrivances. The chosen modeling schema is both maximally expressive and easy to use. It utilizes graphical methods to show hierarchies of task constraints and networks of temporal relationships. (2) A new scheduling algorithm automatically schedules the models without the

  12. 75 FR 52993 - Records Schedules; Availability and Request for Comments

    Science.gov (United States)

    2010-08-30

    ... process is available on request. Schedules Pending 1. Department of Agriculture, Animal and Plant Health... used to support quality reviews of Medicare payments for goods and services. 5. Department of Homeland...

  13. Integration of Tactical Departure Scheduling and Traffic Flow Management Project

    Data.gov (United States)

    National Aeronautics and Space Administration — In the ATM Select topic area of Integrated Arrival, Departure and Surface (IADS) planning, this proposal addresses Tactical Departure Scheduling (TDS), which is a...

  14. Dose Schedule Optimization and the Pharmacokinetic Driver of Neutropenia

    Science.gov (United States)

    Patel, Mayankbhai; Palani, Santhosh; Chakravarty, Arijit; Yang, Johnny; Shyu, Wen Chyi; Mettetal, Jerome T.

    2014-01-01

    Toxicity often limits the utility of oncology drugs, and optimization of dose schedule represents one option for mitigation of this toxicity. Here we explore the schedule-dependency of neutropenia, a common dose-limiting toxicity. To this end, we analyze previously published mathematical models of neutropenia to identify a pharmacokinetic (PK) predictor of the neutrophil nadir, and confirm this PK predictor in an in vivo experimental system. Specifically, we find total AUC and Cmax are poor predictors of the neutrophil nadir, while a PK measure based on the moving average of the drug concentration correlates highly with neutropenia. Further, we confirm this PK parameter for its ability to predict neutropenia in vivo following treatment with different doses and schedules. This work represents an attempt at mechanistically deriving a fundamental understanding of the underlying pharmacokinetic drivers of neutropenia, and provides insights that can be leveraged in a translational setting during schedule selection. PMID:25360756

  15. Combined Noncyclic Scheduling and Advanced Control for Continuous Chemical Processes

    Directory of Open Access Journals (Sweden)

    Damon Petersen

    2017-12-01

    Full Text Available A novel formulation for combined scheduling and control of multi-product, continuous chemical processes is introduced in which nonlinear model predictive control (NMPC and noncyclic continuous-time scheduling are efficiently combined. A decomposition into nonlinear programming (NLP dynamic optimization problems and mixed-integer linear programming (MILP problems, without iterative alternation, allows for computationally light solution. An iterative method is introduced to determine the number of production slots for a noncyclic schedule during a prediction horizon. A filter method is introduced to reduce the number of MILP problems required. The formulation’s closed-loop performance with both process disturbances and updated market conditions is demonstrated through multiple scenarios on a benchmark continuously stirred tank reactor (CSTR application with fluctuations in market demand and price for multiple products. Economic performance surpasses cyclic scheduling in all scenarios presented. Computational performance is sufficiently light to enable online operation in a dual-loop feedback structure.

  16. Classification of routing and scheduling problems in liner shipping

    DEFF Research Database (Denmark)

    Hjortshøj Kjeldsen, Karina

    A classification scheme for routing and scheduling problems in liner shipping is developed and subsequently used to classify existing literature on the subject. Based on the classification the articles are grouped, and the main characteristics of each group and article are described. The grouping...... may serve as a catalyst towards developing a model or a group of models that covers the main problems within routing and scheduling in liner shipping....

  17. The Scheduling of Kratom and Selective Use of Data.

    Science.gov (United States)

    Griffin, O Hayden; Webb, Megan E

    2017-09-22

    Kratom is a traditional drug from Southeast Asia that has been an emerging new substance in the United States. On August 30, 2016, the DEA announced the intention to emergency schedule kratom into Schedule I. To support this decision, the DEA cited an increase in drug seizures of kratom and an increase in calls to poison control concerning kratom. However, a short time later, on October 12, 2016, the DEA withdrew the intent to schedule kratom after public and congressional backlash. The withdrawal by the DEA was somewhat unprecedented. To better understand both decisions, the current article examines the evidence the DEA cited to support their decision to emergency schedule kratom and the degree and type of media coverage of kratom to determine if a media-driven drug panic occurred.

  18. 78 FR 70586 - Records Schedules; Availability and Request for Comments

    Science.gov (United States)

    2013-11-26

    ... administrative, legal, research, or other value. Notice is published for records schedules in which agencies... system used to manage the food and hospitality services of the Marine Corps. 9. Department of State...

  19. Robust Scheduling for Berth Allocation and Quay Crane Assignment Problem

    National Research Council Canada - National Science Library

    Rodriguez-Molins, M; Salido, M.A; Barber, F

    .... This paper is based on proportionally distributing operational buffers among the tasks. In this paper, we consider the berth allocation problem and the quay crane assignment problem as a representative example of scheduling problems...

  20. Exploiting Elementary Landscapes for TSP, Vehicle Routing and Scheduling

    Science.gov (United States)

    2015-09-03

    AFRL-AFOSR-VA-TR-2015-0320 EXPLOITING ELEMENTARY LANDSCAPES FOR TSP , VEHICLE ROUTING AND SCHEDULING Darrell Whitley COLORADO STATE UNIVERSITY Final...4. TITLE AND SUBTITLE Exploiting Elementary Landscapes for TSP , Vehicle Routing and Scheduling 5a. CONTRACT NUMBER 5b. GRANT NUMBER FA9550-11-1-0088...Traveling Salesman Problem ( TSP ) and Graph Coloring are elementary. Problems such as MAX-kSAT are a superposition of k elementary landscapes. This

  1. Limited access: gender, occupational composition, and flexible work scheduling.

    Science.gov (United States)

    Glauber, Rebecca

    2011-01-01

    The current study draws on national data to explore differences in access to flexible work scheduling by the gender composition of women's and men's occupations. Results show that those who work in integrated occupations are more likely to have access to flexible scheduling. Women and men do not take jobs with lower pay in return for greater access to flexibility. Instead, jobs with higher pay offer greater flexibility. Integrated occupations tend to offer the greatest access to flexible scheduling because of their structural locations. Part-time work is negatively associated with men's access to flexible scheduling but positively associated with women's access. Women have greater flexibility when they work for large establishments, whereas men have greater flexibility when they work for small establishments.

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

  3. Schedules of food postponement: II. Maintenance of behavior by food postponement and effects of the schedule parameter.

    Science.gov (United States)

    Clark, F C; Smith, J B

    1977-11-01

    In Experiment I, food-deprived, feeder-trained squirrel monkeys pressed a lever to postpone brief electric shocks (Response-Shock=Shock-Shock interval=30 seconds). Forty-one three-hour sessions of shock postponement were followed by 120 sessions of concurrent shock and food postponement. The shock schedule was unchanged and the food schedule was Response-food interval-20 seconds, Food-food interval 10 seconds. After concurrent shock and food postponement, the shock schedule was discontinued and 40 sessions of food postponement ensued, followed by 53 sessions of extinction. After extinction, food postponement was resumed for 11 sessions. Stable responding with low food rates was maintained under food-postponement after the concurrent schedule. Responding decreased to low levels under extinction and recovered immediately to previous levels when the food-postponement schedule was re-instated. In Experiment II, a parameter of the food-postponement schedule was studied sequentially. Using the same subjects, the Response-food-Food-food interval was manipulated from four seconds to 80 seconds with several orders of presentation. Relations of response rates and food rates to the parameter were similar to those seen under shock postponement. Exposure to very short postponement times (four seconds), resulting in very high food rates, decreased but did not abolish subsequent responding at longer postponement times. Results are discussed from the point of view that reinforcing functions of stimuli consequent on responding depend on a prior history of scheduled contact with those stimuli.

  4. Intelligent retail logistics scheduling

    Energy Technology Data Exchange (ETDEWEB)

    Rowe, J.; Jewers, K. [Stamford House, London (United Kingdom); Codd, A.; Alcock, A. [Inference Corp., Slough, Berkshire (United Kingdom)

    1996-12-31

    The Supply Chain Integrated Ordering Network (SCION) Depot Bookings system automates the planning and scheduling of perishable and non-perishable commodities and the vehicles that carry them into J. Sainsbury depots. This is a strategic initiative, enabling the business to make the key move from weekly to daily ordering. The system is mission critical, managing the inwards flow of commodities from suppliers into J. Sainsbury`s depots. The system leverages Al techniques to provide a business solution that meets challenging functional and performance needs. The SCION Depot Bookings system is operational providing schedules for 22 depots across the UK.

  5. Design Principles and Algorithms for Air Traffic Arrival Scheduling

    Science.gov (United States)

    Erzberger, Heinz; Itoh, Eri

    2014-01-01

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

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

  7. Scheduling Parallel Jobs Using Migration and Consolidation in the Cloud

    Directory of Open Access Journals (Sweden)

    Xiaocheng Liu

    2012-01-01

    Full Text Available An increasing number of high performance computing parallel applications leverages the power of the cloud for parallel processing. How to schedule the parallel applications to improve the quality of service is the key to the successful host of parallel applications in the cloud. The large scale of the cloud makes the parallel job scheduling more complicated as even simple parallel job scheduling problem is NP-complete. In this paper, we propose a parallel job scheduling algorithm named MEASY. MEASY adopts migration and consolidation to enhance the most popular EASY scheduling algorithm. Our extensive experiments on well-known workloads show that our algorithm takes very good care of the quality of service. For two common parallel job scheduling objectives, our algorithm produces an up to 41.1% and an average of 23.1% improvement on the average response time; an up to 82.9% and an average of 69.3% improvement on the average slowdown. Our algorithm is robust even in terms that it allows inaccurate CPU usage estimation and high migration cost. Our approach involves trivial modification on EASY and requires no additional technique; it is practical and effective in the cloud environment.

  8. Post LS1 schedule

    CERN Document Server

    Lamont, M

    2014-01-01

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

  9. 21 CFR 1308.12 - Schedule II.

    Science.gov (United States)

    2010-04-01

    ... 21 Food and Drugs 9 2010-04-01 2010-04-01 false Schedule II. 1308.12 Section 1308.12 Food and Drugs DRUG ENFORCEMENT ADMINISTRATION, DEPARTMENT OF JUSTICE SCHEDULES OF CONTROLLED SUBSTANCES Schedules § 1308.12 Schedule II. (a) Schedule II shall consist of the drugs and other substances, by...

  10. 21 CFR 1308.14 - Schedule IV.

    Science.gov (United States)

    2010-04-01

    ... 21 Food and Drugs 9 2010-04-01 2010-04-01 false Schedule IV. 1308.14 Section 1308.14 Food and Drugs DRUG ENFORCEMENT ADMINISTRATION, DEPARTMENT OF JUSTICE SCHEDULES OF CONTROLLED SUBSTANCES Schedules § 1308.14 Schedule IV. (a) Schedule IV shall consist of the drugs and other substances, by...

  11. 21 CFR 1308.11 - Schedule I.

    Science.gov (United States)

    2010-04-01

    ... 21 Food and Drugs 9 2010-04-01 2010-04-01 false Schedule I. 1308.11 Section 1308.11 Food and Drugs DRUG ENFORCEMENT ADMINISTRATION, DEPARTMENT OF JUSTICE SCHEDULES OF CONTROLLED SUBSTANCES Schedules § 1308.11 Schedule I. (a) Schedule I shall consist of the drugs and other substances, by whatever...

  12. 21 CFR 1308.15 - Schedule V.

    Science.gov (United States)

    2010-04-01

    ... 21 Food and Drugs 9 2010-04-01 2010-04-01 false Schedule V. 1308.15 Section 1308.15 Food and Drugs DRUG ENFORCEMENT ADMINISTRATION, DEPARTMENT OF JUSTICE SCHEDULES OF CONTROLLED SUBSTANCES Schedules § 1308.15 Schedule V. (a) Schedule V shall consist of the drugs and other substances, by whatever...

  13. CMS multicore scheduling strategy

    Energy Technology Data Exchange (ETDEWEB)

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

    2014-01-01

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

  14. Efficient Aircrew Scheduling in an Operational Test and Evaluation Organization

    Science.gov (United States)

    1991-09-01

    28 Office Organization ....... ............. 28 Objectives ....... .................. 28 The Process ...... ................. 28 Additional Duties...the use of scheduling tools made available to the scheduling office during the course of this study. 25 IV. Findings Office Organization The

  15. Combinatory CPU Scheduling Algorithm

    OpenAIRE

    Saeeda Bibi; Farooque Azam; Yasir Chaudhry

    2010-01-01

    Central Processing Unit (CPU) plays a significant role in computer system by transferring its control among different processes. As CPU is a central component, hence it must be used efficiently. Operating system performs an essential task that is known as CPU scheduling for efficient utilization of CPU. CPU scheduling has strong effect on resource utilization as well as overall performance of the system. In this paper, a new CPU scheduling algorithm called Combinatory is proposed that combine...

  16. 18 CFR 35.10 - Form and style of rate schedules, tariffs and service agreements.

    Science.gov (United States)

    2010-04-01

    ... OF RATE SCHEDULES AND TARIFFS Application § 35.10 Form and style of rate schedules, tariffs and service agreements. (a) Every rate schedule, tariff or service agreement offered for filing with the... schedules, tariffs and service agreements. 35.10 Section 35.10 Conservation of Power and Water Resources...

  17. Case mix classification and a benchmark set for surgery scheduling

    NARCIS (Netherlands)

    Leeftink, Gréanne; Hans, Erwin W.

    2017-01-01

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

  18. 77 FR 48551 - Records Schedules; Availability and Request for Comments

    Science.gov (United States)

    2012-08-14

    ... schedules). Once approved by NARA, records schedules provide mandatory instructions on what happens to... copy of any records schedule identified in this notice by contacting Records Management Services (ACNR... Pending 1. Department of the Army, Agency-wide (N1-AU-10-75, 1 item, 1 temporary item). Master files of an...

  19. A feature model and development approach for schedulers

    NARCIS (Netherlands)

    Hatun, Kardelen; Bockisch, Christoph; Sözer, Hasan; Aksit, Mehmet

    Schedulers decide when to execute what in a system. They often work in constrained environments, where these decisions have high impact on performance. Since schedulers should be designed according to a system's needs, it is imperative that scheduling requirements are well defined. Building a

  20. Constrained Task Assignment and Scheduling On Networks of Arbitrary Topology

    Science.gov (United States)

    Jackson, Justin Patrick

    This dissertation develops a framework to address centralized and distributed constrained task assignment and task scheduling problems. This framework is used to prove properties of these problems that can be exploited, develop effective solution algorithms, and to prove important properties such as correctness, completeness and optimality. The centralized task assignment and task scheduling problem treated here is expressed as a vehicle routing problem with the goal of optimizing mission time subject to mission constraints on task precedence and agent capability. The algorithm developed to solve this problem is able to coordinate vehicle (agent) timing for task completion. This class of problems is NP-hard and analytical guarantees on solution quality are often unavailable. This dissertation develops a technique for determining solution quality that can be used on a large class of problems and does not rely on traditional analytical guarantees. For distributed problems several agents must communicate to collectively solve a distributed task assignment and task scheduling problem. The distributed task assignment and task scheduling algorithms developed here allow for the optimization of constrained military missions in situations where the communication network may be incomplete and only locally known. Two problems are developed. The distributed task assignment problem incorporates communication constraints that must be satisfied; this is the Communication-Constrained Distributed Assignment Problem. A novel distributed assignment algorithm, the Stochastic Bidding Algorithm, solves this problem. The algorithm is correct, probabilistically complete, and has linear average-case time complexity. The distributed task scheduling problem addressed here is to minimize mission time subject to arbitrary predicate mission constraints; this is the Minimum-time Arbitrarily-constrained Distributed Scheduling Problem. The Optimal Distributed Non-sequential Backtracking Algorithm

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

    Energy Technology Data Exchange (ETDEWEB)

    Guzzetta, M.B. [comp.

    1996-06-01

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

  2. Predicting Scheduling and Attending for an Oral Cancer Examination

    Science.gov (United States)

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

    2015-01-01

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

  3. Construction management scheduling and control: The familiar historical overview

    Directory of Open Access Journals (Sweden)

    Behnam Ali

    2016-01-01

    Full Text Available The paper suggests that ‘management by exception’ is an historical default control mechanism based on the perception of control as a static process. However, increasingly scholars claim that a dynamic and proactive systems model is a more effective form of project control. These findings are the result of an historical desktop research method that analysed content from a small sample of scheduling methods and control approaches found in online and university library resources. The concept of control has historically influenced both visualization and analytics of different scheduling methods for construction project management. This paper focuses on two control ideals; static and dynamic control mechanisms. The overview begins with the description of early graphical scheduling techniques: Gantt charts and Harmonogram. It continues with examples of contributors to scheduling and control that include: CPM, PERT, LOB, Flowline and Location Based Management. The finding of this simple history suggests that change is the constant element for project control mechanisms. An object-based digital environment such as the data-rich building information modelling (BIM appears to be continuing the change for new scheduling methods and control mechanisms.

  4. Analysis of feeder bus network design and scheduling problems.

    Science.gov (United States)

    Almasi, Mohammad Hadi; Mirzapour Mounes, Sina; Koting, Suhana; Karim, Mohamed Rehan

    2014-01-01

    A growing concern for public transit is its inability to shift passenger's mode from private to public transport. In order to overcome this problem, a more developed feeder bus network and matched schedules will play important roles. The present paper aims to review some of the studies performed on Feeder Bus Network Design and Scheduling Problem (FNDSP) based on three distinctive parts of the FNDSP setup, namely, problem description, problem characteristics, and solution approaches. The problems consist of different subproblems including data preparation, feeder bus network design, route generation, and feeder bus scheduling. Subsequently, descriptive analysis and classification of previous works are presented to highlight the main characteristics and solution methods. Finally, some of the issues and trends for future research are identified. This paper is targeted at dealing with the FNDSP to exhibit strategic and tactical goals and also contributes to the unification of the field which might be a useful complement to the few existing reviews.

  5. Dynamic scheduling and analysis of real time systems with multiprocessors

    Directory of Open Access Journals (Sweden)

    M.D. Nashid Anjum

    2016-08-01

    Full Text Available This research work considers a scenario of cloud computing job-shop scheduling problems. We consider m realtime jobs with various lengths and n machines with different computational speeds and costs. Each job has a deadline to be met, and the profit of processing a packet of a job differs from other jobs. Moreover, considered deadlines are either hard or soft and a penalty is applied if a deadline is missed where the penalty is considered as an exponential function of time. The scheduling problem has been formulated as a mixed integer non-linear programming problem whose objective is to maximize net-profit. The formulated problem is computationally hard and not solvable in deterministic polynomial time. This research work proposes an algorithm named the Tube-tap algorithm as a solution to this scheduling optimization problem. Extensive simulation shows that the proposed algorithm outperforms existing solutions in terms of maximizing net-profit and preserving deadlines.

  6. Routing and Scheduling in Tramp Shipping - Integrating Bunker Optimization

    DEFF Research Database (Denmark)

    Vilhelmsen, Charlotte; Lusby, Richard Martin; Larsen, Jesper

    A tramp ship operator typically has some contracted cargoes that must be carried and seeks to maximize pro_t by carrying optional cargoes. Hence, tramp ships operate much like taxies following available cargoes and not according to a _xed route network and itinerary as liner ships. Marine fuel...... is referred to as bunker fuel or simply bunker and bunker costs constitute a signi_cant part of the daily operating costs. There can be great variations in bunker prices across bunker ports so it is important to carefully plan bunkering for each ship. As ships operate 24 hours a day, they must refuel during...... operations. Therefore, route and schedule decisions a_ect the options for bunkering. Current practice is, however, to separate the two planning problems by first constructing fleet schedules and then plan bunkering for these fixed schedules. In this paper we explore the effects of integrating bunker planning...

  7. Routing and Scheduling in Tramp Shipping - Integrating Bunker Optimization

    DEFF Research Database (Denmark)

    Vilhelmsen, Charlotte; Lusby, Richard Martin; Larsen, Jesper

    A tramp ship operator typically has some contracted cargoes that must be carried and seeks to maximize proFIt by carrying optional cargoes. Hence, tramp ships operate much like taxies following available cargoes and not according to a fixed route network and itinerary as liner ships. Marine fuel...... is referred to as bunker and bunker costs constitute a significant part of the daily operating costs. There can be great variations in bunker prices across bunker ports so it is important to carefully plan bunkering for each ship. As ships operate 24 hours a day, they must refuel during operations. Therefore......, route and schedule decisions affect the options for bunkering. Current practice is, however, to separate the two planning problems by first constructing fleet schedules and then plan bunkering for these fixed schedules. In this paper we explore the effects of integrating bunker planning in the routing...

  8. Tramp ship routing and scheduling with integrated bunker optimization

    DEFF Research Database (Denmark)

    Vilhelmsen, Charlotte; Lusby, Richard Martin; Larsen, Jesper

    2014-01-01

    A tramp ship operator typically has some contracted cargoes that must be carried and seeks to maximize prot by carrying optional cargoes. Hence, tramp ships operate much like taxies following available cargoes and not according to a fixed route network and itinerary as liner ships. Marine fuel...... is referred to as bunker and bunker costs constitute a significant part of the daily operating costs. There can be great variations in bunker prices across bunker ports so it is important to carefully plan bunkering for each ship. As ships operate 24 hours a day, they must refuel during operations. Therefore......, route and schedule decisions affect the options for bunkering. Current practice is, however, to separate the two planning problems by first constructing fleet schedules and then plan bunkering for these fixed schedules. In this paper we explore the effects of integrating bunker planning in the routing...

  9. An architecture for scheduling and QoS management in multimedia workstations

    NARCIS (Netherlands)

    Sijben, P.G.A.; Sijben, Paul G.A.; Mullender, Sape J.

    1994-01-01

    We present an architecture for the scheduling of processes in a system running multimedia applications. The scheduler must take into account the Quality of Service and real time requirements of the processes it schedules. We allow processes to adjust their resource use to current load and schedule

  10. Design and Scheduling of Microgrids using Benders Decomposition

    Energy Technology Data Exchange (ETDEWEB)

    Nagarajan, Adarsh; Ayyanar, Raja

    2016-11-21

    The distribution feeder laterals in a distribution feeder with relatively high PV generation as compared to the load can be operated as microgrids to achieve reliability, power quality and economic benefits. However, renewable resources are intermittent and stochastic in nature. A novel approach for sizing and scheduling an energy storage system and microturbine for reliable operation of microgrids is proposed. The size and schedule of an energy storage system and microturbine are determined using Benders' decomposition, considering PV generation as a stochastic resource.

  11. Microgrid Reliability Modeling and Battery Scheduling Using Stochastic Linear Programming

    Energy Technology Data Exchange (ETDEWEB)

    Cardoso, Goncalo; Stadler, Michael; Siddiqui, Afzal; Marnay, Chris; DeForest, Nicholas; Barbosa-Povoa, Ana; Ferrao, Paulo

    2013-05-23

    This paper describes the introduction of stochastic linear programming into Operations DER-CAM, a tool used to obtain optimal operating schedules for a given microgrid under local economic and environmental conditions. This application follows previous work on optimal scheduling of a lithium-iron-phosphate battery given the output uncertainty of a 1 MW molten carbonate fuel cell. Both are in the Santa Rita Jail microgrid, located in Dublin, California. This fuel cell has proven unreliable, partially justifying the consideration of storage options. Several stochastic DER-CAM runs are executed to compare different scenarios to values obtained by a deterministic approach. Results indicate that using a stochastic approach provides a conservative yet more lucrative battery schedule. Lower expected energy bills result, given fuel cell outages, in potential savings exceeding 6percent.

  12. Non-standard work schedules, gender, and parental stress

    Directory of Open Access Journals (Sweden)

    Mariona Lozano

    2016-02-01

    Full Text Available Background: Working non-standard hours changes the temporal structure of family life, constraining the time that family members spend with one another and threatening individuals' well-being. However, the empirical research on the link between stress and non-standard schedules has provided mixed results. Some studies have indicated that working non-standard hours is harmful whereas others have suggested that working atypical hours might facilitate the balance between family and work. Moreover, there is some evidence that the association between stress and non-standard employment has different implications for men and women. Objective: This paper examines the association between non-standard work schedules and stress among dual-earner couples with children. Two research questions are addressed. First, do predictability of the schedule and time flexibility moderate the link between non-standard work hours and stress? Second, do non-standard schedules affect men's and women's perceptions of stress differently? Methods: We use a sample of 1,932 working parents from the Canadian 2010 General Social Survey, which includes a time-use diary. A sequential logit regression analysis stratified by gender is employed to model two types of result. First, we estimate the odds of being stressed versus not being stressed. Second, for all respondents feeling stressed, we estimate the odds of experiencing high levels versus moderate levels of stress. Results: Our analysis shows that the link between non-standard working hours and perceived stress differs between mothers and fathers. First, fathers with non-standard schedules appear more likely to experience stress than those working standard hours, although the results are not significant. Among mothers, having a non-standard schedule is associated with a significantly lower risk of experiencing stress. Second, the analysis focusing on the mediating role of flexibility and predictability indicates that

  13. Nonstandard Work Schedules and Partnership Quality : Quantitative and Qualitative Findings

    NARCIS (Netherlands)

    Mills, Melinda; Täht, K

    This article questions existing findings and provides new evidence about the consequences of nonstandard work schedules on partnership quality. Using quantitative couple data from The Netherlands Kinship Panel Study (NKPS) (N = 3,016) and semistructured qualitative interviews (N = 34), we found

  14. Routing and scheduling and fleet management for liner shipping

    DEFF Research Database (Denmark)

    Kjeldsen, Karina Hjortshøj

    2009-01-01

    The problem of routing, scheduling and fleet management in global liner shipping is presented. The developed model incorporates the ships' speed as a decision variable. Furthermore, the model must be able to handle problems of the size and complexity experienced by the global liner shipping...

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

    Science.gov (United States)

    2017-05-03

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

  16. DPS - Dynamic Parallel Schedules

    OpenAIRE

    IEEE Press; Gerlach, S.; Hersch, R. D.

    2003-01-01

    Dynamic Parallel Schedules (DPS) is a high-level framework for developing parallel applications on distributed memory computers (e.g. clusters of PC). Its model relies on compositional customizable split-compute-merge graphs of operations (directed acyclic flow graphs). The graphs and the mapping of operations to processing nodes are specified dynamically at runtime. DPS applications are pipelined and multithreaded by construction, ensuring a maximal overlap of computations and communications...

  17. Generating Variable and Random Schedules of Reinforcement Using Microsoft Excel Macros

    OpenAIRE

    Bancroft, Stacie L; Bourret, Jason C

    2008-01-01

    Variable reinforcement schedules are used to arrange the availability of reinforcement following varying response ratios or intervals of time. Random reinforcement schedules are subtypes of variable reinforcement schedules that can be used to arrange the availability of reinforcement at a constant probability across number of responses or time. Generating schedule values for variable and random reinforcement schedules can be difficult. The present article describes the steps necessary to writ...

  18. Suitability and managerial implications of a Master Surgical Scheduling approach

    NARCIS (Netherlands)

    van Oostrum, Jeroen M.; Bredenhoff, Eelco; Bredenhoff, E.; Hans, Elias W.

    2010-01-01

    Operating room (OR) planning and scheduling is a popular and challenging subject within the operational research applied to health services research (ORAHS). However, the impact in practice is very limited. The organization and culture of a hospital and the inherent characteristics of its processes

  19. Integrating and scheduling an open set of static analyses

    DEFF Research Database (Denmark)

    Eichberg, Michael; Mezini, Mira; Kloppenburg, Sven

    2006-01-01

    to keep the set of analyses open. We propose an approach to integrating and scheduling an open set of static analyses which decouples the individual analyses and coordinates the analysis executions such that the overall time and space consumption is minimized. The approach has been implemented...

  20. Improving Dense Network Performance through Centralized Scheduling and Interference Coordination

    DEFF Research Database (Denmark)

    Lopez, Victor Fernandez; Pedersen, Klaus I.; Alvarez, Beatriz Soret

    2017-01-01

    and the receiver sides. As a network coordination scheme, we apply a centralized joint cell association and scheduling mechanism based on dynamic cell switching, by which users are not always served by the strongest perceived cell. The method simultaneously resultsin more balanced loads and increased performance...

  1. 18 CFR 1312.21 - Surveys and schedules.

    Science.gov (United States)

    2010-04-01

    ... 18 Conservation of Power and Water Resources 2 2010-04-01 2010-04-01 false Surveys and schedules. 1312.21 Section 1312.21 Conservation of Power and Water Resources TENNESSEE VALLEY AUTHORITY PROTECTION... the purpose of the Act regarding the protection of archaeological resources. (b) The Secretaries of...

  2. An Analysis of Construction Cost and Schedule Performance

    Science.gov (United States)

    2008-03-01

    paradigm to develop project success measures. Griffith, Gibson, Hamilton, Tortora , and Wilson (1999 categorized projects by their cost, schedule, and...E., Hamilton, M. R., Tortora , A. L., & Wilson, C. T. (1999). Project success index for capital facility construction projects. Journal of

  3. Scheduling technicians and tasks in a telecommunications company

    DEFF Research Database (Denmark)

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

    2010-01-01

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

  4. The Simultaneous Vehicle Scheduling and Passenger Service Problem

    DEFF Research Database (Denmark)

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

    2013-01-01

    , by modifying the timetable. The planning approach is referred to as the simultaneous vehicle scheduling and passenger service problem (SVSPSP). The SVSPSP is modelled as an integer programming problem and solved using a large neighborhood search metaheuristic. The proposed framework is tested on data inspired...

  5. Do the Math: Course Redesign's Impact on Learning and Scheduling

    Science.gov (United States)

    Squires, John; Faulkner, Jerry; Hite, Carl

    2009-01-01

    The math department at Cleveland State Community College embarked upon course redesign in 2008. As a result of this project, student engagement, learning, and success rates have increased dramatically. By including both developmental and college level math courses in the redesign, the department has been able to implement innovative scheduling and…

  6. A transformation system for CLP with dynamic scheduling and CCP

    NARCIS (Netherlands)

    Etalle, Sandro; Gabbrielli, Maurizio; Marchiori, Elena

    In this paper we study unfold/fold transormations for constraint logic programs (CLP) with dynamic scheduling and for concurrent constraint programming (CCP). We define suitable applicability conditions for these transformations which guarantee that the original and the transformed program have the

  7. Integrated cargo routing and ship scheduling in liner shipping

    DEFF Research Database (Denmark)

    Kjeldsen, Karina Hjortshøj

    The problem consists of creating routes and schedules for a heterogeneous fleet of ships while determining the cargo routing and the speed for all relevant port pair/ship combinations. Transshipment is allowed in ports with transshipment capabilities. The service frequency is fixed at one week...

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

  9. 77 FR 58179 - Records Schedules; Availability and Request for Comments

    Science.gov (United States)

    2012-09-19

    ... performance and to evaluate customer service and employee training activities. 8. Congressional Budget Office... received in writing on or before October 19, 2012. Once the appraisal of the records is completed, NARA will send a copy of the schedule. NARA staff usually prepare appraisal memorandums that contain...

  10. Classification of Ship Routing and Scheduling Problems in Liner Shipping

    DEFF Research Database (Denmark)

    Kjeldsen, Karina Hjortshøj

    2011-01-01

    This article provides a classification scheme for ship routing and scheduling problems in liner shipping in line with the current and future operational conditions of the liner shipping industry. Based on the classification, the literature is divided into groups whose main characteristics are des...

  11. Selection and scheduling of jobs with time-dependent duration

    African Journals Online (AJOL)

    job scheduling where the duration of the jobs is time dependent [1, 6]. A vast number ..... The description of the variables required in modelling the case where the job duration depends on the start times is given .... (8), (18) and (19), that should also be taken into account and that are not reflected in. Table 1. All four of the ...

  12. A stochastic simulation approach for production scheduling and ...

    African Journals Online (AJOL)

    The present paper aims to develop a simulation tool for tile manufacturing companies. The paper shows how simulation approach can be useful to support management decisions related to production scheduling and investment planning. Particularly the aim is to demonstrate the importance of an information system in tile ...

  13. Irrigation scheduling research: South African experiences and future ...

    African Journals Online (AJOL)

    Many scheduling approaches have been developed with Water Research Commission funding over the past 4 decades and deployed with varying levels of success; 2 approaches have won prestigious international awards. Soil-based approaches which include measurement of matric potential (tensiometry), water content ...

  14. Synthesis and stochastic assessment of cost-optimal schedules

    NARCIS (Netherlands)

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

    We treat the problem of generating cost-optimal schedules for orders with individual due dates and cost functions based on earliness/tardiness. Orders can run in parallel in a resource-constrained manufacturing environment, where resources are subject to stochastic breakdowns. The goal is to

  15. Games and mechanism design in machine scheduling - an introduction

    NARCIS (Netherlands)

    Heydenreich, Birgit; Müller, Rudolf; Uetz, Marc Jochen

    We survey different models, techniques, and some recent results to tackle machine scheduling problems within a distributed setting. In traditional optimization, a central authority is asked to solve a (computationally hard) optimization problem. In contrast, in distributed settings there are several

  16. FLOW-SHOP SCHEDULING WITH MULTIPLE OPERATIONS AND TIME LAGS

    NARCIS (Netherlands)

    RIEZEBOS, J; GAALMAN, GJC; GUPTA, JND

    A scheduling system is proposed and developed for a special type of flow shop. Ln this flow shop there is one machine at each stage. A job may require multiple operations at each stage. The first operation of a job on stage j cannot start until the last operation of the job on stage j - 1 has

  17. Selection and scheduling of jobs with time-dependent duration ...

    African Journals Online (AJOL)

    In this paper two mathematical programming models, both with multiple objective functions, are proposed to solve four related categories of job scheduling problems. All four of these categories have the property that the duration of the jobs is dependent on the time of implementation and in some cases the preceding job.

  18. Optimal adaptive scheduling and control of beer membrane filtration

    NARCIS (Netherlands)

    Willigenburg, van L.G.; Vollebregt, H.M.; Sman, van der R.G.M.

    2015-01-01

    An adaptive optimal scheduling and controller design is presented that attempts to improve the performance of beer membrane filtration over the ones currently obtained by operators. The research was performed as part of a large European research project called EU Cafe with the aim to investigate the

  19. Models, algorithms and performance analysis for adaptive operating room scheduling

    NARCIS (Netherlands)

    G. Xiao (Guanlian); W.L. van Jaarsveld (Willem); M. Dong (Ming); J.J. van de Klundert (Joris)

    2017-01-01

    textabstractThe complex optimisation problems arising in the scheduling of operating rooms have received considerable attention in recent scientific literature because of their impact on costs, revenues and patient health. For an important part, the complexity stems from the stochastic nature of the

  20. 78 FR 10214 - Records Schedules; Availability and Request for Comments

    Science.gov (United States)

    2013-02-13

    ... files of an electronic system used to evaluate product quality and employee performance. 11... received in writing on or before March 15, 2013. Once the appraisal of the records is completed, NARA will send a copy of the schedule. NARA staff usually prepare appraisal memorandums that contain additional...

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

    Science.gov (United States)

    Hill, Duncan L.

    2010-01-01

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

  2. Modeling the Cray memory scheduler

    Energy Technology Data Exchange (ETDEWEB)

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

    1992-04-01

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

  3. Optimal load scheduling in commercial and residential microgrids

    Science.gov (United States)

    Ganji Tanha, Mohammad Mahdi

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

  4. Nontraditional work schedules for pharmacists.

    Science.gov (United States)

    Mahaney, Lynnae; Sanborn, Michael; Alexander, Emily

    2008-11-15

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

  5. Stochastic scheduling on unrelated machines

    NARCIS (Netherlands)

    Skutella, Martin; Sviridenko, Maxim; Uetz, Marc Jochen; Mayr, Ernst W.; Portier, Natacha

    2014-01-01

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

  6. Integrated and Dynamic Vehicle and Crew Scheduling

    NARCIS (Netherlands)

    D. Huisman (Dennis)

    2004-01-01

    textabstractDue to increased competition in the public transport market and the pressure on governments to cut expenses, increasing attention has been paid to cost reductions in public transportation. Since the main resources used in public transportation are vehicles and crews, producing efficient

  7. Intelligent Planning and Scheduling for Controlled Life Support Systems

    Science.gov (United States)

    Leon, V. Jorge

    1996-01-01

    Planning in Controlled Ecological Life Support Systems (CELSS) requires special look ahead capabilities due to the complex and long-term dynamic behavior of biological systems. This project characterizes the behavior of CELSS, identifies the requirements of intelligent planning systems for CELSS, proposes the decomposition of the planning task into short-term and long-term planning, and studies the crop scheduling problem as an initial approach to long-term planning. CELSS is studied in the realm of Chaos. The amount of biomass in the system is modeled using a bounded quadratic iterator. The results suggests that closed ecological systems can exhibit periodic behavior when imposed external or artificial control. The main characteristics of CELSS from the planning and scheduling perspective are discussed and requirements for planning systems are given. Crop scheduling problem is identified as an important component of the required long-term lookahead capabilities of a CELSS planner. The main characteristics of crop scheduling are described and a model is proposed to represent the problem. A surrogate measure of the probability of survival is developed. The measure reflects the absolute deviation of the vital reservoir levels from their nominal values. The solution space is generated using a probability distribution which captures both knowledge about the system and the current state of affairs at each decision epoch. This probability distribution is used in the context of an evolution paradigm. The concepts developed serve as the basis for the development of a simple crop scheduling tool which is used to demonstrate its usefulness in the design and operation of CELSS.

  8. Constraint-Based Scheduling System

    Science.gov (United States)

    Zweben, Monte; Eskey, Megan; Stock, Todd; Taylor, Will; Kanefsky, Bob; Drascher, Ellen; Deale, Michael; Daun, Brian; Davis, Gene

    1995-01-01

    Report describes continuing development of software for constraint-based scheduling system implemented eventually on massively parallel computer. Based on machine learning as means of improving scheduling. Designed to learn when to change search strategy by analyzing search progress and learning general conditions under which resource bottleneck occurs.

  9. Clinical Laboratory Fee Schedule

    Data.gov (United States)

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

  10. Childhood Vaccine Schedule

    Science.gov (United States)

    ... Navigation Bar Home Current Issue Past Issues Childhood Vaccine Schedule Past Issues / Spring 2008 Table of Contents ... please turn Javascript on. When to Vaccinate What Vaccine Why Birth (or any age if not previously ...

  11. Physician Fee Schedule Search

    Data.gov (United States)

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

  12. Fee Schedules - General Information

    Data.gov (United States)

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

  13. A Data Scheduling and Management Infrastructure for the TEAM Network

    Science.gov (United States)

    Andelman, S.; Baru, C.; Chandra, S.; Fegraus, E.; Lin, K.; Unwin, R.

    2009-04-01

    currently partnering with the San Diego Super Computer Center to build the data management infrastructure. Data collected from the three core protocols as well as others are currently made available through the TEAM Network portal, which provides the content management framework, the data scheduling and management framework, an administrative framework to implement and manage TEAM sites, collaborative tools and a number of tools and applications utilizing Google Map and Google Earth products. A critical element of the TEAM Network data management infrastructure is to make the data publicly available in as close to real-time as possible (the TEAM Network Data Use Policy: http://www.teamnetwork.org/en/data/policy). This requires two essential tasks to be accomplished, 1) A data collection schedule has to be planned, proposed and approved for a given TEAM site. This is a challenging process since TEAM sites are geographically distributed across the tropics and hence have different seasons where they schedule field sampling for the different TEAM protocols. Capturing this information and ensuring that TEAM sites follow the outlined legal contract is key to the data collection process and 2) A stream-lined and efficient information management system to ensure data collected from the field meet the minimum data standards (i.e. are of the highest scientific quality) and are securely transferred, archived, processed and be rapidly made publicaly available, as a finished consumable product via the TEAM Network portal. The TEAM Network is achieving these goals by implementing an end-to-end framework consisting of the Sampling Scheduler application and the Data Management Framework. Sampling Scheduler The Sampling Scheduler is a project management, calendar based portal application that will allow scientists at a TEAM site to schedule field sampling for each of the TEAM protocols implemented at that site. The sampling scheduler addresses the specific requirements established in the

  14. Multiuser Switched Diversity Scheduling Schemes

    CERN Document Server

    Shaqfeh, Mohammad; 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 sys...

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

    Science.gov (United States)

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

    1975-01-01

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

  16. Multiple schedules in practical application: Research trends and implications for future investigation.

    Science.gov (United States)

    Saini, Valdeep; Miller, Scott A; Fisher, Wayne W

    2016-06-01

    Researchers began studying multiple schedules in basic laboratories, but recent advances have extended research on multiple schedules to a wide variety of socially significant applications, especially during the last decade. Applied researchers have used multiple schedules to (a) promote stimulus control over high-rate appropriate behaviors, (b) thin the schedule of reinforcement following functional communication training, and (c) obtain stimulus control over problem behaviors maintained by automatic reinforcement. In the current paper, we reviewed 31 studies with 147 applications identified through a search of the applied literature on multiple schedules. Using these studies, we (a) reviewed the empirical literature on multiple schedules, (b) recommended multiple-schedule procedures that serve as best practice guidelines for applied behavior analysts, (c) identified the generality and boundaries of current knowledge about the effectiveness of multiple schedules, and (d) critically analyzed the literature to provide directions for future multiple-schedule research. © 2016 Society for the Experimental Analysis of Behavior.

  17. Approximation and online algorithms in scheduling and coloring

    OpenAIRE

    Fishkin, Aleksei V.

    2003-01-01

    In the last three decades, approximation and online algorithms have become a major area of theoretical computer science and discrete mathematics. Scheduling and coloring problems are among the most popular ones for which approximation and online algorithms have been analyzed. On one hand, motivated by the well-known difficulty to obtain good lower bounds for the problems, it is particularly hard to prove results on the online and offline performance of algorithms. On the other hand, the theor...

  18. Planning and Scheduling at ASD - A Review and Preliminary Assessment.

    Science.gov (United States)

    1980-12-01

    at a sumnary level, the quality of the planning and scheduling support that is necessary including the CMD/AFPRO support? Ten other questions are asked...planni% prescrcbes an approach and input 4dta, the analytical apprnach will be dependent upon the quality and quantity of availablc Gata. IT is highly... Contril organizations. The functions and respon- sibilities listed in this policy letter represent a minimum level of performance that must be met by all

  19. Artificial intelligence approaches to astronomical observation scheduling

    Science.gov (United States)

    Johnston, Mark D.; Miller, Glenn

    1988-01-01

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

  20. Support system for process flow scheduling

    OpenAIRE

    Salomone, Enrique; Chiotti, Omar Juan Alfredo; Lerch, Juan

    2001-01-01

    Process flow scheduling is a concept that refers to the scheduling of flow shop process plants, whose scheduling calculations are guided by the process structure. In a wide variety of high-volume process industries, the process flow scheduling concept implies an integrated structure for planning and scheduling. This integrated vision of the planning function and the very particular characteristics of the process industry production environment challenge the application of the most traditio...

  1. Temporal Partitioning and Multi-Processor Scheduling for Reconfigurable Architectures

    DEFF Research Database (Denmark)

    Popp, Andreas; Le Moullec, Yannick; Koch, Peter

    This poster presentation outlines a proposed framework for handling mapping of signal processing applications to heterogeneous reconfigurable architectures. The methodology consists of an extension to traditional multi-processor scheduling by creating a separate HW track for generation of groups...... of tasks that are handled similarly to SW processes in a traditional multi-processor scheduling context....

  2. 75 FR 19663 - Records Schedules; Availability and Request for Comments

    Science.gov (United States)

    2010-04-15

    ... records not previously authorized for disposal or reduce the retention period of records already authorized for disposal. NARA invites public comments on such records schedules, as required by 44 U.S.C... appraisal of the records is completed, NARA will send a copy of the schedule. NARA staff usually prepare...

  3. Location-based Scheduling

    DEFF Research Database (Denmark)

    Andersson, Niclas; Christensen, Knud

    The coordination of activities and resources in order to establish an effective production flow is central to the management of construction projects. The traditional technique for coordination of activities and resources in construction projects is the CPM-scheduling, which has been...... 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...

  4. Technological roadmap on AI planning and scheduling

    OpenAIRE

    Biundo, Susanne; Aylett, Ruth; Beetz, Michael; Borrajo, Daniel; Cesta, Amedeo; Grant, Tim; McCluskey, T.L.; Milani, Alfredo; Verfaille, Gerard

    2003-01-01

    At the beginning of the new century, Information Technologies had become basic and indispensable\\ud constituents of the production and preparation processes for all kinds of goods and services and\\ud with that are largely influencing both the working and private life of nearly every citizen. This\\ud development will continue and even further grow with the continually increasing use of the Internet\\ud in production, business, science, education, and everyday societal and private undertaking.\\u...

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

    Directory of Open Access Journals (Sweden)

    Lianfei Yu

    2017-01-01

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

  6. Resource Efficient Scheduling, Optimization and Control.

    NARCIS (Netherlands)

    van den Akker, Marjan|info:eu-repo/dai/nl/112066453; Derksen, Christian; Kowalczyk, Ryszard; Mönch, Lars; Valogianni, Konstantina; van Heck, Erik; Zhang, Minjie

    2014-01-01

    This report documents the program and the outcomes of Dagstuhl Seminar 14181 "Multi-agent systems and their role in future energy grids". A number of recent events (e.g. Fukushima, Japan, and the largest blackout in history, India) have once again increased global attention on climate change and

  7. Decentralized sensing and tracking for UAV scheduling

    Science.gov (United States)

    Crespi, Valentine; Chung, Wayne W.; Jordan, Alex B.

    2004-09-01

    This paper presents a fully automated and decentralized surveillance system for the problem of detecting and possibly tracking mobile unknown ground vehicles in a bounded area. The system consists ideally of unmanned aerial vehicles (UAVs) and unattended fixed sensors with limited communication and detection range that are deployed in the area of interest. Each component of the system (UAV and/or sensor) is completely autonomous and programmed to scan the area searching for targets and share its knowledge with other components within communication range. We assume that both UAVs and sensors have similar computing and sensing capabilities and differ only in their mobility (sensors are stationary while UAVs are mobile). Gathered information is reported to a base station (monitor) that computes an estimate of the global state of the system and quantifies the quality of the surveillance based on a measure of the uncertainty on the number and position of the targets overtime. The present solution has been achieved through a robotic implementation of a software simulation that was in turn realized under the principles of a novel top-down methodology for the design of provably performant agent-based control systems. In this paper we provide a description of our solution including the distributed algorithms that have been employed in the control of the UAV navigation and monitoring. Finally we show the results of an novel experimental performance analysis of our surveillance system.

  8. Underwater Acoustic Localization and Packet Scheduling

    OpenAIRE

    Mashhadi Ramezani, H.

    2016-01-01

    In the beginning of the 21th century, the goal of telecommunications was to connect everyone anytime anywhere in the world. Now, with the tremendous developments in electronics and communications, we are thinking to go beyond our prior goal and connect anything anytime anywhere (Internet of things). This dream would not have been shaped without the recent advances in wireless sensor networks, and the exploding use of this technology in our everyday life. Still to fulfill such a purpose, we ha...

  9. Sleep Schedules and Daytime Functioning in Adolescents.

    Science.gov (United States)

    Wolfson, Amy R.; Carskadon, Mary A.

    1998-01-01

    Studied relationship between adolescents' sleep/wake habits and daytime functioning. Found that self-reported total sleep times decreased from age 13 to 19 years. Struggling or failing students obtained less sleep, went to bed later, and had greater weekend delays of sleep than those with better grades. Students with inadequate sleep reported…

  10. Communication, Scheduling, and Resource Management in SINA

    NARCIS (Netherlands)

    Tripathi, A.; Aksit, Mehmet

    1988-01-01

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

  11. Underwater Acoustic Localization and Packet Scheduling

    NARCIS (Netherlands)

    Mashhadi Ramezani, H.

    2016-01-01

    In the beginning of the 21th century, the goal of telecommunications was to connect everyone anytime anywhere in the world. Now, with the tremendous developments in electronics and communications, we are thinking to go beyond our prior goal and connect anything anytime anywhere (Internet of things).

  12. Planning and scheduling in an FMS

    NARCIS (Netherlands)

    Aanen, E.; Gaalman, G.J.; Nawijn, W.M.

    1989-01-01

    The Dutch institute of applied physics of TNO and the Institute of Metals TNO (Apeldoorn) have installed a flexible manufacturing system (FMS). The main components of this FMS are a turret lathe, a machining centre and a transport system. One of the objectives of this system is to produce a wide

  13. Verifiable Task Assignment and Scheduling Controller

    Science.gov (United States)

    2017-07-01

    of one such tool, Specification Pattern Editor and Checker (SPEC), with an emphasis on providing the human operator a way to communicate their high...subscales. The top panel shows the tests of display condition main effect. The bottom panel shows the test of the Scenario main effect. Significant...goal for the envisioned capability would be for humans to communicate specifications and for automated routines to generate satisfactory mission

  14. Economic and psychological burden of scheduled surgery ...

    African Journals Online (AJOL)

    malaria in a medico-economic study. In this study, the indirect cost to patients and their caregivers was evaluated considering the type of job, age and the period of .... 3. 1.3. Change in treatment plan. 3. 1.3. Error of blood cross-matching. 1. 0.4. Intravenous access failure. 1. 0.4. Lack of paediatric anaesthetic equipment. 1.

  15. Microcomputer-Based Vehicle Routing and Scheduling

    Science.gov (United States)

    1991-06-17

    SUITE 132ArS.R )1 O (5 DAYTON, OH 45431 ESTR ol65 9. SPONSOR.ING ’MONITORING AGLN(:f NAME(S) AND ADDRESS(ES) 10. SPONOR-ING’ MONITORING AGENCY REPORT...Microstructure of Cognition MIT Press, Cambridge, 1986. Schaffer, D., Caruana, R.A., Eshelman, L.J., and Das, R. A Study of Control Parameters Affecting Online

  16. Software Intensive Systems Cost and Schedule Estimation

    Science.gov (United States)

    2013-06-13

    Identification, Communication, Controls And Displays, Data Links, Safety, Target Data Extractor , Digital Measurement Receiver, Sensor Analysis, Flight...upgrade queues waiting to be pulled forward are given management attention to  find and fix bottleneck  root  causes or to rebalance the manpower

  17. Decompression Mechanisms and Decompression Schedule Calculations.

    Science.gov (United States)

    1984-01-20

    March 1984. o .I ° , , , , , . , . . . , , . , , . . . - -, , . , -# . , -, .r , 9 REFERENCES (References marked ’*’ were prepared with support from... preparation of this manuscript. 1 The authors wish to thank the divers, J. Albright, P. Barry, J. Blackwell, M. Kaiser, R. Maxson, W. Phoel, S. Ramsey, R...5. Philp, R.B., P.B. Bennett, J.C. Andersen, G.N. Fields, B.A. McIntyre, I. Francey, and W. Briner. Effects of asprin and dipyridamole on platelet

  18. EDITORIAL: Publication Schedule for 1986 and 1987

    Science.gov (United States)

    Hudson, R. P.

    1986-01-01

    In the second half of 1985 we experienced an unusually high submission rate of articles, which event, while being highly desirable in itself, has caused something of a problem. The economics of this journal is such that these could not be absorbed, thereby avoiding unusual delays in publishing, by simply increasing the number of printed pages for 1986. After considerable discussion between myself and the publishers, the best solution appeared to be to publish two 4-issue volumes in "1987" and to bring 2 issues of the first of those volumes forward so as to actually appear towards the end of 1986. To do nothing would incur a sudden, rather drastic increase in publication-delay which would take a very long time to dissipate. The introduction of a second volume in 1987 must result, regrettably, in a doubling of the subscription price for that year. That will be, fortunately, a one-time phenomenon and I hope that our subscribers will be able to tolerate it and will remain loyally supportive. [One should perhaps add, by way of clarification, that the appearance of the special issue 1986 (3), while contributing to the aforementioned problem, only did so to the extent of a single issue and offers "compensation" by being over twice the normal size.] In fact, it is not unreasonable to hope for wider support in the years ahead, given the uniqueness of this journal (now in its 22nd year of publication), the importance of its role in measurement science, its wide coverage of topics and the very high quality of its articles.

  19. First LHC Shutdown: Coordination and Schedule Issues

    OpenAIRE

    Coupard, J; Foraz, K; Grillot, S

    2010-01-01

    The first LHC shutdown started in fall 2008, just after the incident on the 19th of September 2008. In addition to the typical work of a shutdown, a large number of interventions, related to the “consolidation after the incident” were performed in the LHC loop. Moreover the amount of work increased during the shutdown, following the recommendations and conclusions of the different working groups in charge of the safety of the personnel and of the machine. This paper will give an overview of t...

  20. Generating Variable and Random Schedules of Reinforcement Using Microsoft Excel Macros

    Science.gov (United States)

    Bancroft, Stacie L; Bourret, Jason C

    2008-01-01

    Variable reinforcement schedules are used to arrange the availability of reinforcement following varying response ratios or intervals of time. Random reinforcement schedules are subtypes of variable reinforcement schedules that can be used to arrange the availability of reinforcement at a constant probability across number of responses or time. Generating schedule values for variable and random reinforcement schedules can be difficult. The present article describes the steps necessary to write macros in Microsoft Excel that will generate variable-ratio, variable-interval, variable-time, random-ratio, random-interval, and random-time reinforcement schedule values. PMID:18595286

  1. Personnel preferences in personnel planning and scheduling

    NARCIS (Netherlands)

    van der Veen, Egbert

    2013-01-01

    Summary The personnel of an organization often has two conflicting goals. Individual employees like to have a good work-life balance, by having personal preferences taken into account, whereas there is also the common goal to work efficiently. By applying techniques and methods from Operations

  2. Memory, expectation formation and scheduling choices

    NARCIS (Netherlands)

    Koster, P.R.; Peer, S.; Dekker, T.

    2015-01-01

    Limited memory capacity, retrieval constraints and anchoring are central to expectation formation processes. We develop a model of adaptive expectations where individuals are able to store only a finite number of past experiences of a stochastic state variable. Retrieval of these experiences is

  3. Immunization Schedules for Preteens and Teens

    Science.gov (United States)

    ... the quiz in Spanish . Spanish Version (en español) Vacunas recomendadas para los niños desde los 7 hasta ... Immunizations for Preteens and Teens (7-18 years)) Vacunas recomendadas [2 pages] (Recommended Immunizations) You can display ...

  4. TECHNICAL COORDINATION,SCHEDULE AND INTEGRATION

    CERN Multimedia

    A. Ball

    A pivotal milestone in CMS underground installation will be reached during this CMS week when the 1920 ton central wheel (YB0) of the iron yoke is lowered into the experimental cavern on Wednesday 28 February. This milestone will be reached on the on the date planned due to the hard work and dedication of many people, on the surface, underground and at supporting sites. Details of the programme for 28 February, visit opportunities and progress updates, can be found on the TC web pages on iCMS. http://cms.cern.ch/iCMS/jsp/page.jsp?mode=cms&ac-tion=url&urlkey=CMS_TC Heavy lowering The build-up to the above event started shortly after the December CMS week, when the YE+2 endcap disk was safely lowered into the cavern, followed by the YE+1 on January 9. The lowering of YE+1 was the most complicated so far because, due to the calorimetry nose, the centre of gravity lies outside the plane of the disk. However, after 10 hours it touched-down safely without any problems. On Jan. 19 the first barrel wheel ...

  5. The childhood immunization schedule and safety: stakeholder concerns, scientific evidence, and future studies

    National Research Council Canada - National Science Library

    Board on Population Health and Public Health Practice; Institute of Medicine; Committee on the Assessment of Studies of Health Outcomes Related to the Recommended Childhood Immunization Schedule

    2013-01-01

    "The Childhood Immunization Schedule and Safety: Stakeholder Concerns, Scientific Evidence, and Future Studies reviews scientific findings and stakeholders concerns related to the safety of the recommended childhood immunization schedule...

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

  7. A new model of scheduling in manufacturing: tasks, roles, and monitoring.

    Science.gov (United States)

    Jackson, Sarah; Wilson, John R; MacCarthy, Bart L

    2004-01-01

    For over 3 decades there was a belief that computer-based solutions would "solve" complex industrial scheduling problems, yet most manufacturing organizations still require human contributions for effective scheduling performance. We present a new model of scheduling for the development and implementation of effective scheduling systems within manufacturing companies. The model derives from investigating the work of 7 schedulers in 4 manufacturing environments using a qualitative field study approach, for which novel field-based data collection and analysis methods were developed. The results show that scheduling in practice comprises task, role, and monitoring activities and that the business environment influences a scheduler at work. A new definition of scheduling is presented that includes the significant facilitation and implementation aspects of human scheduling ignored by many computer-based scheduling approaches. The implications for this model extend across the domains of human factors and operations management, especially for the analysis and improvement of existing and new production planning and control processes and enterprise information systems. Actual or potential applications of this research include the analysis, design, and management of planning, scheduling, and control processes in industry; the selection, training, and support of production schedulers; and the allocation of tasks to humans and computer systems in industrial planning, scheduling, and control processes.

  8. Tramp ship routing and scheduling with voyage separation requirements

    DEFF Research Database (Denmark)

    Vilhelmsen, Charlotte; Lusby, Richard Martin; Larsen, Jesper

    2017-01-01

    in time. We have developed a new and exact branch-and-price procedure for this problem. We use a dynamic programming algorithm to generate columns and describe a time window branching scheme used to enforce the voyage separation requirements which we relax in the master problem. Computational results show...... in the spot market. Routing and scheduling a tramp fleet to best utilise fleet capacity according to current demand is therefore an ongoing and complicated problem. Here we add further complexity to the routing and scheduling problem by incorporating voyage separation requirements that enforce a minimum time...... spread between some voyages. The incorporation of these separation requirements helps balance the conflicting objectives of maximising profit for the tramp operator and minimising inventory costs for the charterer, since these costs increase if similar voyages are not performed with some separation...

  9. Backfilling with Fairness and Slack for Parallel Job Scheduling

    Science.gov (United States)

    Sodan, Angela C.; Jin, Wei

    2010-11-01

    Parallel job scheduling typically combines a basic policy like FCFS with backfilling, i.e. moving jobs to an earlier than their regular scheduling position if they do not delay the jobs ahead in the queue according to the rules of the backfilling approach applied. Commonly used are conservative and easy backfilling which either have worse response times but better predictability or better response times and poor predictability. The paper proposes a relaxation of conservative backfilling by permitting to shift jobs within certain constraints to backfill more jobs and reduce fragmentation and subsequently obtain better response times. At the same time, deviation from fairness is kept low and predictability remains high. The results of the experimentation evaluation show that the goals are met, with response-time performance lying as expected between conservative and easy backfilling.

  10. Industrial insights into lot sizing and scheduling modeling

    OpenAIRE

    Almada-Lobo, B.; Clark, A.; Guimarães, Luís; Figueira,Gonçalo; Amorim, P.

    2015-01-01

    ABSTRACT Lot sizing and scheduling by mixed integer programming has been a hot research topic in the last 20 years. Researchers have been trying to develop stronger formulations, as well as to incorporate real-world requirements from different applications. This paper illustrates some of these requirements and demonstrates how small- and big-bucket models have been adapted and extended. Motivation comes from different industries, especially from process and fast-moving consumer goods industries.

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

    Science.gov (United States)

    Li, Guoliang; Xing, Lining; Chen, Yingwu

    2017-11-01

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

  12. WFIRST: Exoplanet Target Selection and Scheduling with Greedy Optimization

    Science.gov (United States)

    Keithly, Dean; Garrett, Daniel; Delacroix, Christian; Savransky, Dmitry

    2018-01-01

    We present target selection and scheduling algorithms for missions with direct imaging of exoplanets, and the Wide Field Infrared Survey Telescope (WFIRST) in particular, which will be equipped with a coronagraphic instrument (CGI). Optimal scheduling of CGI targets can maximize the expected value of directly imaged exoplanets (completeness). Using target completeness as a reward metric and integration time plus overhead time as a cost metric, we can maximize the sum completeness for a mission with a fixed duration. We optimize over these metrics to create a list of target stars using a greedy optimization algorithm based off altruistic yield optimization (AYO) under ideal conditions. We simulate full missions using EXOSIMS by observing targets in this list for their predetermined integration times. In this poster, we report the theoretical maximum sum completeness, mean number of detected exoplanets from Monte Carlo simulations, and the ideal expected value of the simulated missions.

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

    Directory of Open Access Journals (Sweden)

    Cheng Chen

    2014-01-01

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

  14. Individual differences in strategic flight management and scheduling

    Science.gov (United States)

    Wickens, Christopher D.; Raby, Mireille

    1991-01-01

    A group of 30 instrument-rated pilots was made to fly simulator approaches to three airports under conditions of low, medium, and high workload conditions. An analysis is presently conducted of the difference in discrete task scheduling between the group of 10 highest and 10 lowest performing pilots in the sample; this categorization was based on the mean of various flight-profile measures. The two groups were found to differ from each other only in terms of the time when specific events were conducted, and of the optimality of scheduling for certain high-priority tasks. These results are assessed in view of the relative independence of task-management skills from aircraft-control skills.

  15. Non-standard work schedules, gender, and parental stress

    OpenAIRE

    Mariona Lozano; Dana Hamplová; Céline Le Bourdais

    2016-01-01

    Background: Working non-standard hours changes the temporal structure of family life, constraining the time that family members spend with one another and threatening individuals' well-being. However, the empirical research on the link between stress and non-standard schedules has provided mixed results. Some studies have indicated that working non-standard hours is harmful whereas others have suggested that working atypical hours might facilitate the balance between family and work. Moreover...

  16. Effective Schedule and Cost Management as a Product Development Lead

    Science.gov (United States)

    Simmons, Cynthia

    2015-01-01

    The presentation will be given at the 26th Annual Thermal Fluids Analysis Workshop (TFAWS 2015) hosted by the Goddard SpaceFlight Center (GSFC) Thermal Engineering Branch (Code 545). This course provides best practices, helpful tools and lessons learned for staying on plan and day-to-day management of Subsystem flight development after getting Project approval for your Subsystem schedule and budget baseline.

  17. REPNET: project scheduling and workflow optimization for Construction Projects

    OpenAIRE

    Marco Alvise Bragadin; Kalle Kahkonen

    2013-01-01

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

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

  19. Forecasting project schedule performance using probabilistic and deterministic models

    Directory of Open Access Journals (Sweden)

    S.A. Abdel Azeem

    2014-04-01

    Full Text Available Earned value management (EVM was originally developed for cost management and has not widely been used for forecasting project duration. In addition, EVM based formulas for cost or schedule forecasting are still deterministic and do not provide any information about the range of possible outcomes and the probability of meeting the project objectives. The objective of this paper is to develop three models to forecast the estimated duration at completion. Two of these models are deterministic; earned value (EV and earned schedule (ES models. The third model is a probabilistic model and developed based on Kalman filter algorithm and earned schedule management. Hence, the accuracies of the EV, ES and Kalman Filter Forecasting Model (KFFM through the different project periods will be assessed and compared with the other forecasting methods such as the Critical Path Method (CPM, which makes the time forecast at activity level by revising the actual reporting data for each activity at a certain data date. A case study project is used to validate the results of the three models. Hence, the best model is selected based on the lowest average percentage of error. The results showed that the KFFM developed in this study provides probabilistic prediction bounds of project duration at completion and can be applied through the different project periods with smaller errors than those observed in EV and ES forecasting models.

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

  1. Scheduling and Topology Design in Networks with Directional Antennas

    Science.gov (United States)

    2017-05-19

    Wireless Mesh Networks , IEEE ICC 2006. [7] E. Gelal, et. al., “Topology Management in Directional Antenna-Equipped Ad Hoc Networks , IEEE Trans. Mobile...Scheduling and Topology Design in Networks with Directional Antennas Thomas Stahlbuhk, Nathaniel M. Jones, Brooke Shrader Lincoln Laboratory...Massachusetts Institute of Technology Lexington, Massachusetts 02420–9108 Abstract—In multihop wireless networks equipped with direc- tional antennas, network

  2. Optimal Results and Numerical Simulations for Flow Shop Scheduling Problems

    Directory of Open Access Journals (Sweden)

    Tao Ren

    2012-01-01

    Full Text Available This paper considers the m-machine flow shop problem with two objectives: makespan with release dates and total quadratic completion time, respectively. For Fm|rj|Cmax, we prove the asymptotic optimality for any dense scheduling when the problem scale is large enough. For Fm‖ΣCj2, improvement strategy with local search is presented to promote the performance of the classical SPT heuristic. At the end of the paper, simulations show the effectiveness of the improvement strategy.

  3. Implementation Learning and Forgetting Curve to Scheduling in Garment Industry

    Science.gov (United States)

    Muhamad Badri, Huda; Deros, Baba Md; Syahri, M.; Saleh, Chairul; Fitria, Aninda

    2016-02-01

    The learning curve shows the relationship between time and the cumulative number of units produced which using the mathematical description on the performance of workers in performing repetitive works. The problems of this study is level differences in the labors performance before and after the break which affects the company's production scheduling. The study was conducted in the garment industry, which the aims is to predict the company production scheduling using the learning curve and forgetting curve. By implementing the learning curve and forgetting curve, this paper contributes in improving the labors performance that is in line with the increase in maximum output 3 hours productive before the break are 15 unit product with learning curve percentage in the company is 93.24%. Meanwhile, the forgetting curve improving maximum output 3 hours productive after the break are 11 unit product with the percentage of forgetting curve in the company is 92.96%. Then, the obtained 26 units product on the productive hours one working day is used as the basic for production scheduling.

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

    CERN Document Server

    Baptiste, Philippe; Nuijten, Wim

    2001-01-01

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

  5. Planning and Scheduling of Payloads of AstroSat During Initial and ...

    Indian Academy of Sciences (India)

    R. Pandiyan

    2017-06-20

    Jun 20, 2017 ... The process is found to be labour intensive and several operational software tools, encompassing spacecraft sub-systems, on-orbit, .... ing of scheduling and command generating software packages that were part of 'optimal .... Scheduler design for payloads. The payload scheduler has several modules ...

  6. Neural network computing model for highway construction project scheduling and management : final report, October 1999.

    Science.gov (United States)

    1999-10-01

    A general mathematical formulation has been developed for scheduling of construction projects and applied to the problem of highway construction scheduling. Repetitive and non-repetitive tasks, work continuity considerations, multiple-crew strategies...

  7. 78 FR 40186 - Proposed Aggregate Production Quotas for Schedule I and II Controlled Substances and Proposed...

    Science.gov (United States)

    2013-07-03

    ... class--schedule I quotas (1-Pentyl-1H-indol-3-yl)(2,2,3,3- 15 g tetramethylcyclopropyl)methanone (UR-144... Trimeperidine 2 g Proposed 2014 Basic class--schedule II quotas 1-Phenylcyclohexylamine 3 g 1... Enforcement Administration Proposed Aggregate Production Quotas for Schedule I and II Controlled Substances...

  8. Intelligent perturbation algorithms for space scheduling optimization

    Science.gov (United States)

    Kurtzman, Clifford R.

    1991-01-01

    Intelligent perturbation algorithms for space scheduling optimization are presented in the form of the viewgraphs. The following subject areas are covered: optimization of planning, scheduling, and manifesting; searching a discrete configuration space; heuristic algorithms used for optimization; use of heuristic methods on a sample scheduling problem; intelligent perturbation algorithms are iterative refinement techniques; properties of a good iterative search operator; dispatching examples of intelligent perturbation algorithm and perturbation operator attributes; scheduling implementations using intelligent perturbation algorithms; major advances in scheduling capabilities; the prototype ISF (industrial Space Facility) experiment scheduler; optimized schedule (max revenue); multi-variable optimization; Space Station design reference mission scheduling; ISF-TDRSS command scheduling demonstration; and example task - communications check.

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

    Science.gov (United States)

    Luczynski, Kevin C; Hanley, Gregory P

    2014-01-01

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

  10. 47 CFR 1.1104 - Schedule of charges for applications and other filings for media services.

    Science.gov (United States)

    2010-10-01

    ... 47 Telecommunication 1 2010-10-01 2010-10-01 false Schedule of charges for applications and other... GENERAL PRACTICE AND PROCEDURE Schedule of Statutory Charges and Procedures for Payment § 1.1104 Schedule of charges for applications and other filings for media services. Remit manual filings and/or payment...

  11. Scheduling algorithms for saving energy and balancing load

    Energy Technology Data Exchange (ETDEWEB)

    Antoniadis, Antonios

    2012-08-03

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

  12. 9 CFR 318.303 - Critical factors and the application of the process schedule.

    Science.gov (United States)

    2010-01-01

    ... application of the process schedule. Critical factors specified in the process schedule shall be measured... 9 Animals and Animal Products 2 2010-01-01 2010-01-01 false Critical factors and the application of the process schedule. 318.303 Section 318.303 Animals and Animal Products FOOD SAFETY AND...

  13. The Effects of Work-Reinforcer Schedules on Performance and Preference in Students with Autism

    Science.gov (United States)

    Bukala, Magdalena; Hu, Meng Yao; Lee, Ronald; Ward-Horner, John C.; Fienup, Daniel M.

    2015-01-01

    This study investigated performance under and preference for continuous and discontinuous work-reinforcer schedules in 3 students who had been diagnosed with autism. Under continuous schedules, participants completed all work and consumed all reinforcers in contiguous units. Under discontinuous schedules, work and reinforcer access were broken up…

  14. MULTIPLE SCHEDULES IN PRACTICAL APPLICATION: RESEARCH TRENDS AND IMPLICATIONS FOR FUTURE INVESTIGATION

    OpenAIRE

    Saini, Valdeep; Miller, Scott A.; Fisher, Wayne W.

    2016-01-01

    Researchers began studying multiple schedules in basic laboratories, but recent advances have extended research on multiple schedules to a wide variety of socially significant applications, especially during the last decade. Applied researchers have used multiple schedules (a) to promote stimulus control over high-rate appropriate behaviors, (b) to thin the schedule of reinforcement following functional communication training, and (c) to obtain stimulus control over problem behaviors maintain...

  15. 21 CFR 1301.33 - Application for bulk manufacture of Schedule I and II substances.

    Science.gov (United States)

    2010-04-01

    ... manufacture of Schedule I and II substances. (a) In the case of an application for registration or reregistration to manufacture in bulk a basic class of controlled substance listed in Schedule I or II, the... 21 Food and Drugs 9 2010-04-01 2010-04-01 false Application for bulk manufacture of Schedule I and...

  16. Schedule Sales Query Raw Data

    Data.gov (United States)

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

  17. Executive Schedule C System (ESCS)

    Data.gov (United States)

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

  18. Extending the range of linear scheduling in highway construction

    OpenAIRE

    Bafna, Tarun

    1991-01-01

    Linear Scheduling Method is a powerful graphical scheduling method which is best suited for scheduling projects involving repetitive activities. Highway construction projects are excellent examples of projects displaying repetitive characteristics. The research explores usefulness of linear scheduling in highway construction. The Linear Scheduling Method (LSM) was implemented in the field to schedule highway projects. Problems encountered during the field experience were studied and res...

  19. 32 CFR 644.8 - Planning and scheduling real estate activities.

    Science.gov (United States)

    2010-07-01

    ... 32 National Defense 4 2010-07-01 2010-07-01 true Planning and scheduling real estate activities... (CONTINUED) REAL PROPERTY REAL ESTATE HANDBOOK Project Planning Civil Works § 644.8 Planning and scheduling real estate activities. (a) Normal scheduling. (1) The objective of a planned program is to provide for...

  20. Alternative Scheduling Models and Their Effect on Science Achievement at the High School Level

    Science.gov (United States)

    Dostal, Jay Roland

    2010-01-01

    This study will evaluate alternative scheduling methods implemented in secondary level schools. Students were selected based on parent selection of programs. Traditional scheduling involves numerous academic subjects with small increments of time in each class and block scheduling focuses on fewer academic subjects and more instructional time.…

  1. Harmonious personnel scheduling

    NARCIS (Netherlands)

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

    2006-01-01

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

  2. Iterative robust multiprocessor scheduling

    NARCIS (Netherlands)

    Adyanthaya, S.; Geilen, M.; Basten, T.; Voeten, J.; Schiffelers, R.

    2015-01-01

    General purpose platforms are characterized by unpredictable timing behavior. Real-time schedules of tasks on general purpose platforms need to be robust against variations in task execution times. We define robustness in terms of the expected number of tasks that miss deadlines. We present an

  3. Decentralized Ground Staff Scheduling

    DEFF Research Database (Denmark)

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

    2002-01-01

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

  4. Tramp Ship Routing and Scheduling - Models, Methods and Opportunities

    DEFF Research Database (Denmark)

    Vilhelmsen, Charlotte; Larsen, Jesper; Lusby, Richard Martin

    In tramp shipping, ships operate much like taxies, following the available demand. This contrasts liner shipping where vessels operate more like busses on a fixed route network according to a published timetable. Tramp operators can enter into long term contracts and thereby determine some...... and scheduling problem, focus should now be on extending this basic problem to include additional real-world complexities and develop suitable solution methods for those extensions. Such extensions will enable more tramp operators to benefit from the solution methods while simultaneously creating new...

  5. Nonstandard maternal work schedules and infant mental health in impoverished families: A brief report.

    Science.gov (United States)

    Grzywacz, Joseph G; Leerkes, Esther M; Reboussin, Beth A; Suerken, Cynthia K; Payne, Chris C; Daniel, Stephanie S

    2016-11-01

    Guided by a bioecological model, this study examines variability in infant mental health by maternal work schedule in the context of poverty. More time in irregular work schedules, but not fixed night/evening schedules, predicts maternal depression and subsequent behavior problems in infants. Copyright © 2016 Elsevier Inc. All rights reserved.

  6. 75 FR 54598 - Schedules for Atlantic Shark Identification Workshops and Protected Species Safe Handling...

    Science.gov (United States)

    2010-09-08

    ... National Oceanic and Atmospheric Administration RIN 0648-XW44 Schedules for Atlantic Shark Identification... cancelling the Atlantic Shark Identification workshop that was scheduled for September 2, 2010, in Wilmington... South College Road, Wilmington, NC 28403. DATES: The Atlantic Shark Identification Workshop scheduled...

  7. Gemcitabine and cisplatin in locally advanced and metastatic bladder cancer; 3- or 4-week schedule?

    DEFF Research Database (Denmark)

    Als, Anne Birgitte; Sengeløv, Lisa; Von Der Maase, Hans

    2008-01-01

    BACKGROUND: Chemotherapy with gemcitabine and cisplatin (GC) is an active regimen in advanced transitional cell carcinoma (TCC). Traditionally, GC has been administered as a 4-week schedule. However, an alternative 3-week schedule may be more feasible. Long-term survival data for the alternative 3......-week schedule and comparisons of the feasibility and toxicity between the two schedules have not previously been published. MATERIAL AND METHODS: We performed a retrospective analysis of patients with stage IV TCC, treated with GC by a standard 4-week or by an alternative 3-week schedule. RESULTS...

  8. Search Strategies for Scheduling Problems

    OpenAIRE

    Kypta, Tomáš

    2012-01-01

    In the present work I compare the search strategies for solving scheduling problems from the view of constraint programming. The thesis is focused on scheduling problems containing alternative activities. An analysis of previously published various ways of modelling the problems is provided, next description and experimental comparison of search strategies targetting these models is provided. The influence of strategies on the speed of the solver is studied primarily. As a sideeffect the work...

  9. Construction schedules slack time minimizing

    Science.gov (United States)

    Krzemiński, Michał

    2017-07-01

    The article presents two copyright models for minimizing downtime working brigades. Models have been developed for construction schedules performed using the method of work uniform. Application of flow shop models is possible and useful for the implementation of large objects, which can be divided into plots. The article also presents a condition describing gives which model should be used, as well as a brief example of optimization schedule. The optimization results confirm the legitimacy of the work on the newly-developed models.

  10. Estimating exponential scheduling preferences

    DEFF Research Database (Denmark)

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

    time by maximising expected total utility over the day, their departure times are conditional on rates of utility derived at these locations. For forecasting and economic evaluation of planning alternatives, it is desirable to have simple forms of utility rates with few parameters. Several forms......Extended abstract Choice of departure time is a travel choice dimension that transportation planners often need to forecast in appraisal. A traveller may shift departure time in response to changes in expected travel time or travel time variability (TTV) or in response to time......-differentiated congestion pricing. The direction and size of such shifts depend on the traveller’s scheduling preferences, i.e. his preferences for travelling and being at the origin and destination at different times of day (Vickrey, 1973). Moreover, the traveller’s response to and economic value of TTV can be derived...

  11. Non-clairvoyant Scheduling Games

    Science.gov (United States)

    Dürr, Christoph; Nguyen, Kim Thang

    In a scheduling game, each player owns a job and chooses a machine to execute it. While the social cost is the maximal load over all machines (makespan), the cost (disutility) of each player is the completion time of its own job. In the game, players may follow selfish strategies to optimize their cost and therefore their behaviors do not necessarily lead the game to an equilibrium. Even in the case there is an equilibrium, its makespan might be much larger than the social optimum, and this inefficiency is measured by the price of anarchy - the worst ratio between the makespan of an equilibrium and the optimum. Coordination mechanisms aim to reduce the price of anarchy by designing scheduling policies that specify how jobs assigned to a same machine are to be scheduled. Typically these policies define the schedule according to the processing times as announced by the jobs. One could wonder if there are policies that do not require this knowledge, and still provide a good price of anarchy. This would make the processing times be private information and avoid the problem of truthfulness. In this paper we study these so-called non-clairvoyant policies. In particular, we study the RANDOM policy that schedules the jobs in a random order without preemption, and the EQUI policy that schedules the jobs in parallel using time-multiplexing, assigning each job an equal fraction of CPU time.

  12. Scheduling the powering tests

    CERN Document Server

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

    2008-01-01

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

  13. PHENIX Work Breakdown Structure. Cost and schedule review copy

    Energy Technology Data Exchange (ETDEWEB)

    1994-02-01

    The Work Breakdown Structure (WBS) Book begins with this Overview section, which contains the high-level summary cost estimate, the cost profile, and the global construction schedule. The summary cost estimate shows the total US cost and the cost in terms of PHENIX construction funds for building the PHENIX detector. All costs in the WBS book are shown in FY 1993 dollars. Also shown are the institutional and foreign contributions, the level of pre-operations funding, and the cost of deferred items. Pie charts are presented at PHENIX WBS level 1 and 2 that show this information. The PHENIX construction funds are shown broken down to PHENIX WBS level 3 items per fiscal year, and the resulting profile is compared to the RHIC target profile. An accumulated difference of the two profiles is also shown. The PHENIX global construction schedule is presented at the end of the Overview section. Following the Overview are sections for each subsystem. Each subsystem section begins with a summary cost estimate, cost profile, and critical path. The total level 3 cost is broken down into fixed costs (M&S), engineering costs (EDIA) and labor costs. Costs are further broken down in terms of PHENIX construction funds, institutional and foreign contributions, pre-operations funding, and deferred items. Also shown is the contingency at level 3 and the level 4 breakdown of the total cost. The cost profile in fiscal years is shown at level 3. The subsystem summaries are followed by the full cost estimate and schedule sheets for that subsystem. These detailed sheets are typically carried down to level 7 or 8. The cost estimate shows Total, M&S, EDIA, and Labor breakdowns, as well as contingency, for each WBS entry.

  14. PHENIX WBS notes. Cost and schedule review copy

    Energy Technology Data Exchange (ETDEWEB)

    1994-02-01

    The Work Breakdown Structure (WBS) Book begins with this Overview section, which contains the high-level summary cost estimate, the cost profile, and the global construction schedule. The summary cost estimate shows the total US cost and the cost in terms of PHENIX construction funds for building the PHENIX detector. All costs in the WBS book are shown in FY 1993 dollars. Also shown are the institutional and foreign contributions, the level of pre-operations funding, and the cost of deferred items. Pie charts are presented at PHENIX WBS level 1 and 2 that show this information. The PHENIX construction funds are shown broken down to PHENIX WBS level 3 items per fiscal year, and the resulting profile is compared to the RHIC target profile. An accumulated difference of the two profiles is also shown. The PHENIX global construction schedule is presented at the end of the Overview section. Following the Overview are sections for each subsystem. Each subsystem section begins with a summary cost estimate, cost profile, and critical path. The total level 3 cost is broken down into fixed costs (M&S), engineering costs (EDIA) and labor costs. Costs are further broken down in terms of PHENIX construction funds, institutional and foreign contributions, pre-operations funding, and deferred items. Also shown is the contingency at level 3 and the level 4 breakdown of the total cost. The cost profile in fiscal years is shown at level 3. The subsystem summaries are followed by the full cost estimate and schedule sheets for that subsystem. These detailed sheets are typically carried down to level 7 or 8. The cost estimate Total, M&S, EDIA, and Labor breakdowns, as well as contingency, for each WBS entry.

  15. Sleep and sleepiness of fishermen on rotating schedules.

    Science.gov (United States)

    Gander, Philippa; van den Berg, Margo; Signal, Leigh

    2008-04-01

    Seafaring is a hazardous occupation with high death and injury rates, but the role of seafarer fatigue in these events is generally not well documented. The International Maritime Organization has identified seafarer fatigue as an important health and safety issue. Most research to date has focused on more regularly scheduled types of operations (e.g., merchant vessels, ferries), but there is relatively little information on commercial fishing, which often involves high day-to-day and seasonal variability in work patterns and workload. The present study was designed to monitor the sleep and sleepiness of commercial fishermen at home and during extended periods at sea during the peak of the hoki fishing season, with a view to developing better fatigue management strategies for this workforce. Sleep (wrist actigraphy and sleep diaries) and sleepiness (Karolinska Sleepiness Scale [KSS] before and after each sleep period) of 20 deckhands were monitored for 4-13 days at home and for 5-9 days at sea while working a nominal 12 h on/6 h off schedule. On the 12 h on/6 hoff schedule, there was still a clear preference for sleep at night. Comparing the last three days at home and the first three days at sea showed that fishermen were more likely to have split sleep at sea (Wilcoxon signed ranks p or= 7 on 24% of days at sea vs. 9% of days at home (Wilcoxon signed ranks p fishing season increases the risk of performance impairment due to greater cumulative sleep loss than would be expected on typical three-day trips. Key fatigue management strategies in this environment include that fishermen report to work as well rested as possible. Once at sea, the day-to-day variability in activities due to uncontrollable factors, such as fishing success, repairing gear, and weather conditions, mean that contingency planning is required for managing situations where the entire crew have experienced long periods of intensive work with minimum recovery opportunities.

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

    Science.gov (United States)

    Giles, Aimee; Markham, Victoria

    2017-09-01

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

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

  18. Design issues in the semantics and scheduling of asynchronous tasks.

    Energy Technology Data Exchange (ETDEWEB)

    Olivier, Stephen L.

    2013-07-01

    The asynchronous task model serves as a useful vehicle for shared memory parallel programming, particularly on multicore and manycore processors. As adoption of model among programmers has increased, support has emerged for the integration of task parallel language constructs into mainstream programming languages, e.g., C and C++. This paper examines some of the design decisions in Cilk and OpenMP concerning semantics and scheduling of asynchronous tasks with the aim of informing the efforts of committees considering language integration, as well as developers of new task parallel languages and libraries.

  19. Automated mixed traffic vehicle control and scheduling study

    Science.gov (United States)

    Peng, T. K. C.; Chon, K.

    1976-01-01

    The operation and the expected performance of a proposed automatic guideway transit system which uses low speed automated mixed traffic vehicles (AMTVs) were analyzed. Vehicle scheduling and headway control policies were evaluated with a transit system simulation model. The effect of mixed traffic interference on the average vehicle speed was examined with a vehicle pedestrian interface model. Control parameters regulating vehicle speed were evaluated for safe stopping and passenger comfort. Some preliminary data on the cost and operation of an experimental AMTV system are included. These data were the result of a separate task conducted at JPL, and were included as background information.

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

  1. Simulator for Optimization of Software Project Cost and Schedule

    OpenAIRE

    Suri, P. K.; Bhushan, B.

    2008-01-01

    Each phase of the software design consumes some resources and hence has cost associated with it. In most of the cases cost will vary to some extent with the amount of time consumed by the design of each phase .The total cost of project, which is aggregate of the activities costs will also depends upon the project duration, can be cut down to some extent. The aim is always to strike a balance between the cost and time and to obtain an optimum software project schedule. An optimum minimum cost ...

  2. Improved NSGA model for multi objective operation scheduling and its evaluation

    Science.gov (United States)

    Li, Weining; Wang, Fuyu

    2017-09-01

    Reasonable operation can increase the income of the hospital and improve the patient’s satisfactory level. In this paper, by using multi object operation scheduling method with improved NSGA algorithm, it shortens the operation time, reduces the operation costand lowers the operation risk, the multi-objective optimization model is established for flexible operation scheduling, through the MATLAB simulation method, the Pareto solution is obtained, the standardization of data processing. The optimal scheduling scheme is selected by using entropy weight -Topsis combination method. The results show that the algorithm is feasible to solve the multi-objective operation scheduling problem, and provide a reference for hospital operation scheduling.

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

  4. Partitioning and Scheduling DSP Applications with Maximal Memory Access Hiding

    Directory of Open Access Journals (Sweden)

    Sha Edwin Hsing-Mean

    2002-01-01

    Full Text Available This paper presents an iteration space partitioning scheme to reduce the CPU idle time due to the long memory access latency. We take into consideration both the data accesses of intermediate and initial data. An algorithm is proposed to find the largest overlap for initial data to reduce the entire memory traffic. In order to efficiently hide the memory latency, another algorithm is developed to balance the ALU and memory schedules. The experiments on DSP benchmarks show that the algorithms significantly outperform the known existing methods.

  5. On the Integrated Job Scheduling and Constrained Network Routing Problem

    DEFF Research Database (Denmark)

    Gamst, Mette

    This paper examines the NP-hard problem of scheduling a number of jobs on a finite set of machines such that the overall profit of executed jobs is maximized. Each job demands a number of resources, which must be sent to the executing machine via constrained paths. Furthermore, two resource demand...... transmissions cannot use the same edge in the same time period. An exact solution approach based on Dantzig-Wolfe decomposition is proposed along with several heuristics. The methods are computationally evaluated on test instances arising from telecommunications with up to 500 jobs and 500 machines. Results...

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

    Directory of Open Access Journals (Sweden)

    Chun-Cheng Lin

    2014-01-01

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

  7. Off-Line and Dynamic Production Scheduling – A Comparative Case Study

    Directory of Open Access Journals (Sweden)

    Bożek Andrzej

    2016-03-01

    Full Text Available A comprehensive case study of manufacturing scheduling solutions development is given. It includes highly generalized scheduling problem as well as a few scheduling modes, methods and problem models. The considered problem combines flexible job shop structure, lot streaming with variable sublots, transport times, setup times, and machine calendars. Tabu search metaheuristic and constraint programming methods have been used for the off-line scheduling. Two dynamic scheduling methods have also been implemented, i.e., dispatching rules for the completely reactive scheduling and a multi-agent system for the predictivereactive scheduling. In these implementations three distinct models of the problem have been used, based on: graph representation, optimal constraint satisfaction, and Petri net formalism. Each of these solutions has been verified in computational experiments. The results are compared and some findings about advantages, disadvantages, and suggestions on using the solutions are formulated.

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

    CERN Document Server

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

    2014-01-01

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

  9. A Decision Support System for Academic Scheduling.

    Science.gov (United States)

    Burleson, Donald K.; Leivano, Rodrigo J.

    1986-01-01

    Describes the use of a decision support system to operate on a database for academic scheduling. Discusses the scheduling environment, database subsystem, dialog subsystem, modeling subsystem, and output formats. (JM)

  10. A Survey on Gain-Scheduled Control and Filtering for Parameter-Varying Systems

    Directory of Open Access Journals (Sweden)

    Guoliang Wei

    2014-01-01

    Full Text Available This paper presents an overview of the recent developments in the gain-scheduled control and filtering problems for the parameter-varying systems. First of all, we recall several important algorithms suitable for gain-scheduling method including gain-scheduled proportional-integral derivative (PID control, H2, H∞ and mixed H2/H∞ gain-scheduling methods as well as fuzzy gain-scheduling techniques. Secondly, various important parameter-varying system models are reviewed, for which gain-scheduled control and filtering issues are usually dealt with. In particular, in view of the randomly occurring phenomena with time-varying probability distributions, some results of our recent work based on the probability-dependent gain-scheduling methods are reviewed. Furthermore, some latest progress in this area is discussed. Finally, conclusions are drawn and several potential future research directions are outlined.

  11. Scheduling of Fault-Tolerant Embedded Systems with Soft and Hard Timing Constraints

    DEFF Research Database (Denmark)

    Izosimov, Viacheslav; Pop, Paul; Eles, Petru

    2008-01-01

    /utility functions to capture the utility of soft processes. Process re-execution is employed to recover from multiple faults. A single static schedule computed off-line is not fault tolerant and is pessimistic in terms of utility, while a purely online approach, which computes a new schedule every time a process...... fails or completes, incurs an unacceptable overhead. Thus, we use a quasi-static scheduling strategy, where a set of schedules is synthesized off-line and, at run time, the scheduler will select the right schedule based on the occurrence of faults and the actual execution times of processes......In this paper we present an approach to the synthesis of fault-tolerant schedules for embedded applications with soft and hard real-time constraints. We are interested to guarantee the deadlines for the hard processes even in the case of faults, while maximizing the overall utility. We use time...

  12. Systematic Hybrid Network Scheduling for Multiple Traffic Classes with Host Timing and Phase Constraints

    Science.gov (United States)

    Varadarajan, Srivatsan (Inventor); Hall, Brendan (Inventor); Smithgall, William Todd (Inventor); Bonk, Ted (Inventor); DeLay, Benjamin F. (Inventor)

    2017-01-01

    Systems and methods for systematic hybrid network scheduling for multiple traffic classes with host timing and phase constraints are provided. In certain embodiments, a method of scheduling communications in a network comprises scheduling transmission of virtual links pertaining to a first traffic class on a global schedule to coordinate transmission of the virtual links pertaining to the first traffic class across all transmitting end stations on the global schedule; and scheduling transmission of each virtual link pertaining to a second traffic class on a local schedule of the respective transmitting end station from which each respective virtual link pertaining to the second traffic class is transmitted such that transmission of each virtual link pertaining to the second traffic class is coordinated only at the respective end station from which each respective virtual link pertaining to the second traffic class is transmitted.

  13. PRACTICAL IMPLICATIONS OF LOCATION-BASED SCHEDULING

    OpenAIRE

    Andersson, Niclas; Christensen, Knud

    2007-01-01

    The traditional method for planning, scheduling and controlling activities and resources in construction projects is the CPM-scheduling, which has been the predominant scheduling method since its introduction in the late 1950s. Over the years, CPM has proven to be a very powerful technique for planning, scheduling and controlling projects. However, criticism has been raised on the CPM method, specifically in the case of construction projects, for deficient management of construction work and ...

  14. Self-optimization aspects for dynamic scheduling

    OpenAIRE

    Pereira, Ivo; Madureira, Ana Maria

    2010-01-01

    Scheduling is a critical function that is present throughout many industries and applications. A great need exists for developing scheduling approaches that can be applied to a number of different scheduling problems with significant impact on performance of business organizations. A challenge is emerging in the design of scheduling support systems for manufacturing environments where dynamic adaptation and optimization become increasingly important. At this scenario, self-o...

  15. Partially clairvoyant scheduling for aggregate constraints

    OpenAIRE

    Subramani, K.

    2005-01-01

    The problem of partially clairvoyant scheduling is concerned with checking whether an ordered set of jobs, having nonconstant execution times and subject to a collection of imposed constraints, has a partially clairvoyant schedule. Variability of execution times of jobs and nontrivial relationships constraining their executions, are typical features of real-time systems. A partially clairvoyant scheduler parameterizes the schedule, in that the start time of a job in a sequence can depend u...

  16. Vehicle scheduling schemes for commercial and emergency logistics integration.

    Science.gov (United States)

    Li, Xiaohui; Tan, Qingmei

    2013-01-01

    In modern logistics operations, large-scale logistics companies, besides active participation in profit-seeking commercial business, also play an essential role during an emergency relief process by dispatching urgently-required materials to disaster-affected areas. Therefore, an issue has been widely addressed by logistics practitioners and caught researchers' more attention as to how the logistics companies achieve maximum commercial profit on condition that emergency tasks are effectively and performed satisfactorily. In this paper, two vehicle scheduling models are proposed to solve the problem. One is a prediction-related scheme, which predicts the amounts of disaster-relief materials and commercial business and then accepts the business that will generate maximum profits; the other is a priority-directed scheme, which, firstly groups commercial and emergency business according to priority grades and then schedules both types of business jointly and simultaneously by arriving at the maximum priority in total. Moreover, computer-based simulations are carried out to evaluate the performance of these two models by comparing them with two traditional disaster-relief tactics in China. The results testify the feasibility and effectiveness of the proposed models.

  17. Vehicle scheduling schemes for commercial and emergency logistics integration.

    Directory of Open Access Journals (Sweden)

    Xiaohui Li

    Full Text Available In modern logistics operations, large-scale logistics companies, besides active participation in profit-seeking commercial business, also play an essential role during an emergency relief process by dispatching urgently-required materials to disaster-affected areas. Therefore, an issue has been widely addressed by logistics practitioners and caught researchers' more attention as to how the logistics companies achieve maximum commercial profit on condition that emergency tasks are effectively and performed satisfactorily. In this paper, two vehicle scheduling models are proposed to solve the problem. One is a prediction-related scheme, which predicts the amounts of disaster-relief materials and commercial business and then accepts the business that will generate maximum profits; the other is a priority-directed scheme, which, firstly groups commercial and emergency business according to priority grades and then schedules both types of business jointly and simultaneously by arriving at the maximum priority in total. Moreover, computer-based simulations are carried out to evaluate the performance of these two models by comparing them with two traditional disaster-relief tactics in China. The results testify the feasibility and effectiveness of the proposed models.

  18. Vehicle Scheduling Schemes for Commercial and Emergency Logistics Integration

    Science.gov (United States)

    Li, Xiaohui; Tan, Qingmei

    2013-01-01

    In modern logistics operations, large-scale logistics companies, besides active participation in profit-seeking commercial business, also play an essential role during an emergency relief process by dispatching urgently-required materials to disaster-affected areas. Therefore, an issue has been widely addressed by logistics practitioners and caught researchers' more attention as to how the logistics companies achieve maximum commercial profit on condition that emergency tasks are effectively and performed satisfactorily. In this paper, two vehicle scheduling models are proposed to solve the problem. One is a prediction-related scheme, which predicts the amounts of disaster-relief materials and commercial business and then accepts the business that will generate maximum profits; the other is a priority-directed scheme, which, firstly groups commercial and emergency business according to priority grades and then schedules both types of business jointly and simultaneously by arriving at the maximum priority in total. Moreover, computer-based simulations are carried out to evaluate the performance of these two models by comparing them with two traditional disaster-relief tactics in China. The results testify the feasibility and effectiveness of the proposed models. PMID:24391724

  19. Biopharmaceutical Process Optimization with Simulation and Scheduling Tools

    Directory of Open Access Journals (Sweden)

    Demetri Petrides

    2014-09-01

    Full Text Available Design and assessment activities associated with a biopharmaceutical process are performed at different levels of detail, based on the stage of development that the product is in. Preliminary “back-of-the envelope” assessments are performed early in the development lifecycle, whereas detailed design and evaluation are performed prior to the construction of a new facility. Both the preliminary and detailed design of integrated biopharmaceutical processes can be greatly assisted by the use of process simulators, discrete event simulators or finite capacity scheduling tools. This report describes the use of such tools for bioprocess development, design, and manufacturing. The report is divided into three sections. Section One provides introductory information and explains the purpose of bioprocess simulation. Section Two focuses on the detailed modeling of a single batch bioprocess that represents the manufacturing of a therapeutic monoclonal antibody (MAb. This type of analysis is typically performed by engineers engaged in the development and optimization of such processes. Section Three focuses on production planning and scheduling models for multiproduct plants.

  20. 21 CFR 1308.49 - Emergency scheduling.

    Science.gov (United States)

    2010-04-01

    ... 21 Food and Drugs 9 2010-04-01 2010-04-01 false Emergency scheduling. 1308.49 Section 1308.49 Food and Drugs DRUG ENFORCEMENT ADMINISTRATION, DEPARTMENT OF JUSTICE SCHEDULES OF CONTROLLED SUBSTANCES Hearings § 1308.49 Emergency scheduling. Pursuant to 21 U.S.C. 811(h) and without regard to the...

  1. The GBT Dynamic Scheduling System: Development and Testing

    Science.gov (United States)

    McCarty, M.; Clark, M.; Marganian, P.; O'Neil, K.; Shelton, A.; Sessoms, E.

    2009-09-01

    During the summer trimester of 2008, all observations on the Robert C. Byrd Green Bank Telescope (GBT) were scheduled using the new Dynamic Scheduling System (DSS). Beta testing exercised the policies, algorithms, and software developed for the DSS project. Since observers are located all over the world, the DSS was implemented as a web application. Technologies such as iCalendar, Really Simple Syndication (RSS) feeds, email, and instant messaging are used to transfer as much or as little information to observers as they request. We discuss the software engineering challenges leading to our implementation such as information distribution and building rich user interfaces in the web browser. We also relate our adaptation of agile development practices to design and develop the DSS. Additionally, we describe handling differences in expected versus actual initial conditions in the pool of project proposals for the 08B trimester. We then identify lessons learned from beta testing and present statistics on how the DSS was used during the trimester.

  2. Humanoid Walking Robot: Modeling, Inverse Dynamics, and Gain Scheduling Control

    Directory of Open Access Journals (Sweden)

    Elvedin Kljuno

    2010-01-01

    Full Text Available This article presents reference-model-based control design for a 10 degree-of-freedom bipedal walking robot, using nonlinear gain scheduling. The main goal is to show concentrated mass models can be used for prediction of the required joint torques for a bipedal walking robot. Relatively complicated architecture, high DOF, and balancing requirements make the control task of these robots difficult. Although linear control techniques can be used to control bipedal robots, nonlinear control is necessary for better performance. The emphasis of this work is to show that the reference model can be a bipedal walking model with concentrated mass at the center of gravity, which removes the problems related to design of a pseudo-inverse system. Another significance of this approach is the reduced calculation requirements due to the simplified procedure of nominal joint torques calculation. Kinematic and dynamic analysis is discussed including results for joint torques and ground force necessary to implement a prescribed walking motion. This analysis is accompanied by a comparison with experimental data. An inverse plant and a tracking error linearization-based controller design approach is described. We propose a novel combination of a nonlinear gain scheduling with a concentrated mass model for the MIMO bipedal robot system.

  3. Nurse Scheduling Using Genetic Algorithm

    Directory of Open Access Journals (Sweden)

    Komgrit Leksakul

    2014-01-01

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

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

  5. Effectiveness of Instruction Performed through Computer-Assisted Activity Schedules on On-Schedule and Role-Play Skills of Children with Autism Spectrum Disorder

    Science.gov (United States)

    Ulke-Kurkcuoglu, Burcu; Bozkurt, Funda; Cuhadar, Selmin

    2015-01-01

    This study aims to investigate the effectiveness of the instruction process provided through computer-assisted activity schedules in the instruction of on-schedule and role-play skills to children with autism spectrum disorder. Herein, a multiple probe design with probe conditions across participants among single subject designs was used. Four…

  6. Bulletin publication schedule

    CERN Multimedia

    Publications Section, DG-CO Group

    2011-01-01

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

  7. A planning language for activity scheduling

    Science.gov (United States)

    Zoch, David R.; Lavallee, David; Weinstein, Stuart; Tong, G. Michael

    1991-01-01

    Mission planning and scheduling of spacecraft operations are becoming more complex at NASA. Described here are a mission planning process; a robust, flexible planning language for spacecraft and payload operations; and a software scheduling system that generates schedules based on planning language inputs. The mission planning process often involves many people and organizations. Consequently, a planning language is needed to facilitate communication, to provide a standard interface, and to represent flexible requirements. The software scheduling system interprets the planning language and uses the resource, time duration, constraint, and alternative plan flexibilities to resolve scheduling conflicts.

  8. TECHNICAL COORDINATION SCHEDULE & INTEGRATION

    CERN Multimedia

    W. Zeuner

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

  9. Lag Schedules and Functional Communication Training: Persistence of Mands and Relapse of Problem Behavior.

    Science.gov (United States)

    Falcomata, Terry S; Muething, Colin S; Silbaugh, Bryant C; Adami, Summer; Hoffman, Katherine; Shpall, Cayenne; Ringdahl, Joel E

    2017-11-01

    We evaluated the effects of lag schedules of reinforcement and functional communication training (FCT) on mand variability and problem behavior in two children with autism spectrum disorder. Specifically, we implemented FCT with increasing lag schedules and compared its effects on problem behavior with baseline conditions. The results showed that both participants exhibited low rates of problem behavior during treatment relative to baseline during and following schedule thinning (up to a Lag 5 schedule arrangement). Variable and total mands remained high during schedule thinning. With one participant, variable manding persisted when the value of the lag schedule was reduced to zero. The current results are discussed in terms of implications for training multiple mand topographies during FCT for the potential prevention and/or mitigation of clinical relapse during challenges to treatment.

  10. Comparison Performance of Genetic Algorithm and Ant Colony Optimization in Course Scheduling Optimizing

    Directory of Open Access Journals (Sweden)

    Imam Ahmad Ashari

    2016-11-01

    Full Text Available Scheduling problems at the university is a complex type of scheduling problems. The scheduling process should be carried out at every turn of the semester's. The core of the problem of scheduling courses at the university is that the number of components that need to be considered in making the schedule, some of the components was made up of students, lecturers, time and a room with due regard to the limits and certain conditions so that no collision in the schedule such as mashed room, mashed lecturer and others. To resolve a scheduling problem most appropriate technique used is the technique of optimization. Optimization techniques can give the best results desired. Metaheuristic algorithm is an algorithm that has a lot of ways to solve the problems to the very limit the optimal solution. In this paper, we use a genetic algorithm and ant colony optimization algorithm is an algorithm metaheuristic to solve the problem of course scheduling. The two algorithm will be tested and compared to get performance is the best. The algorithm was tested using data schedule courses of the university in Semarang. From the experimental results we conclude that the genetic algorithm has better performance than the ant colony optimization  algorithm in solving the case of course scheduling.

  11. Fuzzy scheduled RTDA controller design.

    Science.gov (United States)

    Srinivasan, K; Anbarasan, K

    2013-03-01

    In this paper, the design and development of fuzzy scheduled robustness, tracking, disturbance rejection and overall aggressiveness (RTDA) controller design for non-linear processes are discussed. pH process is highly non-linear and the design of good controller for this process is always a challenging one due to large gain variation. Fuzzy scheduled RTDA controller design based on normalized integral square error (N_ISE) performance criteria for pH neutralization process is developed. The applicability of the proposed controller is tested for other different non-linear processes like type I diabetic process and conical tank process. The servo and regulatory performance of fuzzy scheduled RTDA controller design is compared with well-tuned internal model control (IMC) and dynamic matrix control (DMC)-based control schemes. Copyright © 2012 ISA. Published by Elsevier Ltd. All rights reserved.

  12. Automating Mid- and Long-Range Scheduling for NASA's Deep Space Network

    Science.gov (United States)

    Johnston, Mark D.; Tran, Daniel; Arroyo, Belinda; Sorensen, Sugi; Tay, Peter; Carruth, Butch; Coffman, Adam; Wallace, Mike

    2012-01-01

    NASA has recently deployed a new mid-range scheduling system for the antennas of the Deep Space Network (DSN), called Service Scheduling Software, or S(sup 3). This system is architected as a modern web application containing a central scheduling database integrated with a collaborative environment, exploiting the same technologies as social web applications but applied to a space operations context. This is highly relevant to the DSN domain since the network schedule of operations is developed in a peer-to-peer negotiation process among all users who utilize the DSN (representing 37 projects including international partners and ground-based science and calibration users). The initial implementation of S(sup 3) is complete and the system has been operational since July 2011. S(sup 3) has been used for negotiating schedules since April 2011, including the baseline schedules for three launching missions in late 2011. S(sup 3) supports a distributed scheduling model, in which changes can potentially be made by multiple users based on multiple schedule "workspaces" or versions of the schedule. This has led to several challenges in the design of the scheduling database, and of a change proposal workflow that allows users to concur with or to reject proposed schedule changes, and then counter-propose with alternative or additional suggested changes. This paper describes some key aspects of the S(sup 3) system and lessons learned from its operational deployment to date, focusing on the challenges of multi-user collaborative scheduling in a practical and mission-critical setting. We will also describe the ongoing project to extend S(sup 3) to encompass long-range planning, downtime analysis, and forecasting, as the next step in developing a single integrated DSN scheduling tool suite to cover all time ranges.

  13. Environmental surveillance master sampling schedule

    Energy Technology Data Exchange (ETDEWEB)

    Bisping, L.E.

    1997-01-01

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

  14. Range and mission scheduling automation using combined AI and operations research techniques

    Science.gov (United States)

    Arbabi, Mansur; Pfeifer, Michael

    1987-01-01

    Ground-based systems for Satellite Command, Control, and Communications (C3) operations require a method for planning, scheduling and assigning the range resources such as: antenna systems scattered around the world, communications systems, and personnel. The method must accommodate user priorities, last minute changes, maintenance requirements, and exceptions from nominal requirements. Described are computer programs which solve 24 hour scheduling problems, using heuristic algorithms and a real time interactive scheduling process.

  15. PRACTICAL IMPLICATIONS OF LOCATION-BASED SCHEDULING

    DEFF Research Database (Denmark)

    Andersson, Niclas; Christensen, Knud

    2007-01-01

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

  16. Optimal randomized scheduling by replacement

    Energy Technology Data Exchange (ETDEWEB)

    Saias, I.

    1996-05-01

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

  17. Design and analysis of scheduling strategies for multi-CPU and multi-GPU architectures

    OpenAIRE

    Ferreira Lima, Joao Vicente; Gautier, Thierry; Danjean, Vincent; Raffin, Bruno; Maillard, Nicolas

    2015-01-01

    International audience; In this paper, we present a comparison of scheduling strategies for heterogeneous multi-CPU and multi-GPU architectures. We designed and evaluated four scheduling strategies on top of XKaapi runtime: work stealing, data-aware work stealing, locality-aware work stealing, and Heterogeneous Earliest-Finish-Time (HEFT). On a heterogeneous architecture with 12 CPUs and 8 GPUs, we analysed our scheduling strategies with four benchmarks: a BLAS-1 AXPY vector operation, a Jaco...

  18. Schedulability Analysis for Java Finalizers

    DEFF Research Database (Denmark)

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

    2010-01-01

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

  19. Cure Schedule for Stycast 2651/Catalyst 9.

    Energy Technology Data Exchange (ETDEWEB)

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

    2017-11-01

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

  20. Online Algorithms for Parallel Job Scheduling and Strip Packing

    NARCIS (Netherlands)

    Hurink, Johann L.; Paulus, J.J.

    We consider the online scheduling problem of parallel jobs on parallel machines, $P|online{−}list,m_j |C_{max}$. For this problem we present a 6.6623-competitive algorithm. This improves the best known 7-competitive algorithm for this problem. The presented algorithm also applies to the problem

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

  2. Hubble Systems Optimize Hospital Schedules

    Science.gov (United States)

    2009-01-01

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

  3. Method and apparatus for scheduling broadcasts in social networks

    KAUST Repository

    Manzoor, Emaad Ahmed

    2016-08-25

    A method, apparatus, and computer readable medium are provided for maximizing consumption of broadcasts by a producer. An example method includes receiving selection of a total number of time slots to use for scheduling broadcasts, and receiving information regarding the producer\\'s followers. The example method further 5 includes identifying, by a processor and based on the received information, discount factors associated with the producer\\'s followers, and calculating, by the processor and based on the received information, a predicted number of competitor broadcasts during each time slot of the total number of time slots. Finally, the example method includes determining, by the processor and based on the discount factors and the predicted 10 number of competitor broadcasts during each time slot, a number of broadcasts for the producer to transmit in each time slot of the total number of time slots.

  4. Terminal Control Area Aircraft Scheduling and Trajectory Optimization Approaches

    Directory of Open Access Journals (Sweden)

    Samà Marcella

    2017-01-01

    Full Text Available Aviation authorities are seeking optimization methods to better use the available infrastructure and better manage aircraft movements. This paper deals with the realtime scheduling of take-off and landing aircraft at a busy terminal control area and with the optimization of aircraft trajectories during the landing procedures. The first problem aims to reduce the propagation of delays, while the second problem aims to either minimize the travel time or reduce the fuel consumption. Both problems are particularly complex, since the first one is NP-hard while the second one is nonlinear and a combined solution needs to be computed in a short-time during operations. This paper proposes a framework for the lexicographic optimization of the two problems. Computational experiments are performed for the Milano Malpensa airport and show the existing gaps between the performance indicators of the two problems when different lexicographic optimization approaches are considered.

  5. Schedulability Analysis for Java Finalizers

    DEFF Research Database (Denmark)

    Bøgholm, Thomas; Hansen, Rene Rydhof; Søndergaard, Hans

    2010-01-01

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

  6. Limited Area Forecasting and Statistical Modelling for Wind Energy Scheduling

    DEFF Research Database (Denmark)

    Rosgaard, Martin Haubjerg

    forecast accuracy for operational wind power scheduling. Numerical weather prediction history and scales of atmospheric motion are summarised, followed by a literature review of limited area wind speed forecasting. Hereafter, the original contribution to research on the topic is outlined. The quality...... control of wind farm data used as forecast reference is described in detail, and a preliminary limited area forecasting study illustrates the aggravation of issues related to numerical orography representation and accurate reference coordinates at ne weather model resolutions. For the o shore and coastal...... sites studied limited area forecasting is found to deteriorate wind speed prediction accuracy, while inland results exhibit a steady forecast performance increase with weather model resolution. Temporal smoothing of wind speed forecasts is shown to improve wind power forecast performance by up to almost...

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

  8. Tramp Ship Routing and Scheduling - Incorporating Additional Complexities

    DEFF Research Database (Denmark)

    Vilhelmsen, Charlotte

    In tramp shipping, ships operate much like taxies, following the available demand. This contrasts liner shipping where vessels operate more like busses on a fixed route network according to a published timetable. Tramp operators can enter into long term contracts and thereby determine some...... for tramp ship routing and scheduling problems. This is done in the context of Operations Research, a research field that has achieved great success within optimisation-based planning for vehicle routing problems and in many other areas. The first part of this thesis contains a comprehensive introduction...... problem, focus should now be on extending this basic problem to include additional complexities and develop suitable solution methods for those extensions. Such extensions will enable more tramp operators to benefit from the solution methods while simultaneously creating new opportunities for operators...

  9. Frequency deviations and generation scheduling in the nordic system

    DEFF Research Database (Denmark)

    Li, Zhongwei; Samuelsson, Olaf; Garcia-Valle, Rodrigo

    2011-01-01

    deviations and hourly scheduled generation. A simple model is given to reproduce these deterministic frequency variations. Simulations indicate that smaller system size as is typical for island operation does not necessarily increase these frequency variations provided load, generation, load response......High penetration of variable generation such as wind power increases the demands on frequency control. The same applies to island operation and in particular if this involves variable generation, which is planned at the Danish island Bornholm. While it is obvious that the frequency control need...... to be considered, the disturbances caused to this control by the hourly dispatch of generation has received less attention and is the focus of this paper. Based on years of recorded PMU data, statistics of frequency events and analysis of frequency quality are made to demonstrate the relation between the frequency...

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

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

  12. A System for Automatically Generating Scheduling Heuristics

    Science.gov (United States)

    Morris, Robert

    1996-01-01

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

  13. Integrated approach in solving parallel machine scheduling and location (ScheLoc) problem

    OpenAIRE

    Mohsen Rajabzadeh; Mohsen Ziaee; Ali Bozorgi-Amiri

    2016-01-01

    Scheduling and layout planning are two important areas of operations research, which are used in the areas of production planning, logistics and supply chain management. In many industries locations of machines are not specified, previously, therefore, it is necessary to consider both location and scheduling, simultaneously. This paper presents a mathematical model to consider both scheduling and layout planning for parallel machines in discrete and continuous spaces, concurrently. The prelim...

  14. Optimizing the Slab Yard Planning and Crane Scheduling Problem using a Two-Stage Heuristic

    OpenAIRE

    Dohn, Anders; Clausen, Jens

    2010-01-01

    Abstract 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 cranes. The problem is decomposed and modeled in two parts, namely a planning problem and a scheduling proble...

  15. SafeTREC - UCTC Seminar: Flexible Work Schedules and Transportation Behavior at UC Berkeley

    OpenAIRE

    Ng, Wei-Shiuen

    2014-01-01

    Flexible work schedules could be a solution to the problems of increasing transportation demand, congestion, energy use, and carbon emissions. The higher the flexibility of work schedule, the less time employees would spend commuting to work. Hence, reducing trip frequency and total distance traveled. Flexible work schedules have been studied extensively in transportation studies, especially in areas of peak period congestion, road pricing, transit services peak and off-peak utilization, and ...

  16. Development and Application of Linear Scheduling Techniques to Highway Construction Projects

    OpenAIRE

    Harmelink, D. J.; Yamin, Rene Antonio

    2001-01-01

    Crucial to the successful outcome of major highway construction and reconstruction projects today is the ability to accurately plan, predict and control the construction process. Evermore sensitive to budget control, schedule control, resource allocation and impacts on the motoring public, highway constructors today require sophisticated project management tools to achieve project goals. One of the tools recently being used across the country is project scheduling. The use of scheduling techn...

  17. The impact of changing work schedules on American firefighters’ sleep patterns and well-being

    OpenAIRE

    Caputo, Lisa M; Salottolo, Kristin M; Gosche, Emily E; Allison P Hawkes; Vellman, Peter W; Lange, Neale R; Coniglio, Raymond; Mains, Charles W.

    2015-01-01

    Across the nation, fire departments are adopting the 48/96 work schedule, in which firefighters work 48 consecutive hours with the following 96 hours off. Our study objective was to explain and quantify the impact of switching from the Kelly schedule to the 48/96 schedule by measuring changes in sleep, feelings of daytime function, as well as perceptions of professional and personal well-being for American firefighters. Sleep diaries and self-reported surveys were administered to firefighters...

  18. Implementation of multi - priority and variable - length DRRM scheduling algorithm based on FPGA

    Science.gov (United States)

    Xu, Hui; Sun, Xue; Cao, Suzhi; Zhan, Yueying

    2017-10-01

    In order to improve the bandwidth utilization of the switch fabric, reduce the complexity of the arbitration module and reduce the processing of the packet, the existing DRRM scheduling algorithm is improved to support the variable-length cell scheduling and provide multi-priority level support. We use Xilinx xc7k325t FPGA to achieve a 16×16 ports data exchange structure, providing six different priorities to support the complete variable-length cells directly involved in scheduling.

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

    OpenAIRE

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

    2016-01-01

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

  20. Scheduling and Optimization of Fault-Tolerant Embedded Systems with Transparency/Performance Trade-Offs

    DEFF Research Database (Denmark)

    Izosimov, Viacheslav; Pop, Paul; Eles, Petru

    2012-01-01

    In this article, we propose a strategy for the synthesis of fault-tolerant schedules and for the mapping of fault-tolerant applications. Our techniques handle transparency/performance trade-offs and use the faultoccurrence information to reduce the overhead due to fault tolerance. Processes and m...... of the application so that they do not affect the schedule of other processes and messages. While leading to longer schedules, transparent recovery has the advantage of both improved debuggability and less memory needed to store the faulttolerant schedules....

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

    Energy Technology Data Exchange (ETDEWEB)

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

    2009-08-01

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

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

    Energy Technology Data Exchange (ETDEWEB)

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

    1984-12-01

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

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

    DEFF Research Database (Denmark)

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

    2016-01-01

    The contribution of this paper is a hierarchical algorithm for integrated scheduling and control via model predictive control of hybrid systems. The controlled system is a linear system composed of continuous control, state, and output variables. Binary variables occur as scheduling decisions...... in the optimal control problem (OCP). The scheduling decisions are made on a slow time scale compared with the system dynamics. This gives rise to a temporal separation of the scheduling and control variables in the OCP. Accordingly, the proposed hierarchical algorithm consists of two optimization levels...

  4. An Integrated Constraint Programming Approach to Scheduling Sports Leagues with Divisional and Round-robin Tournaments

    Energy Technology Data Exchange (ETDEWEB)

    Carlsson, Mats; Johansson, Mikael; Larson, Jeffrey

    2014-01-01

    Previous approaches for scheduling a league with round-robin and divisional tournaments involved decomposing the problem into easier subproblems. This approach, used to schedule the top Swedish handball league Elitserien, reduces the problem complexity but can result in suboptimal schedules. This paper presents an integrated constraint programming model that allows to perform the scheduling in a single step. Particular attention is given to identifying implied and symmetry-breaking constraints that reduce the computational complexity significantly. The experimental evaluation of the integrated approach takes considerably less computational effort than the previous approach.

  5. Towards a Fair and Efficient Packet Scheduling Scheme in Inter-Flow Network Coding

    Directory of Open Access Journals (Sweden)

    Jin Wang

    2014-11-01

    Full Text Available Network coding techniques are usually applied upon network-layer protocols to improve throughput in wireless networks. In scenarios with multiple unicast sessions, fairness is also an important factor. Therefore, a network coding-aware packet-scheduling algorithm is required. A packet-scheduling algorithm determines which packet to send next from a node’s packet backlog. Existing protocols mostly employ a basic round-robin scheduling algorithm to give “equal” opportunities to different packet flows. In fact, this “equal”-opportunity scheduling is neither fair, nor efficient. This paper intends to accentuate the importance of a coding-aware scheduling scheme. With a good scheduling scheme, we can gain more control over the per-flow throughput and fairness. Specifically, we first formulate a static scheduling problem and propose an algorithm to find the optimal scheduling scheme. We then extend the technique to a dynamic setting and, later, to practical routing protocols. Results show that the algorithm is comparatively scalable, and it can improve the throughput gain when the network is not severely saturated. The fairness among flows is drastically improved as a result of this scheduling scheme.

  6. Analysis and design of gain scheduled control systems. Ph.D. Thesis

    Science.gov (United States)

    Shamma, Jeff S.

    1988-01-01

    Gain scheduling, as an idea, is to construct a global feedback control system for a time varying and/or nonlinear plant from a collection of local time invariant designs. However in the absence of a sound analysis, these designs come with no guarantees on the robustness, performance, or even nominal stability of the overall gain schedule design. Such an analysis is presented for three types of gain scheduling situations: (1) a linear parameter varying plant scheduling on its exogenous parameters, (2) a nonlinear plant scheduling on a prescribed reference trajectory, and (3) a nonlinear plant scheduling on the current plant output. Conditions are given which guarantee that the stability, robustness, and performance properties of the fixed operating point designs carry over to the global gain scheduled designs, such as the scheduling variable should vary slowly and capture the plants nonlinearities. Finally, an alternate design framework is proposed which removes the slowing varying restriction or gain scheduled systems. This framework addresses some fundamental feedback issues previously ignored in standard gain.

  7. Stochastic scheduling on unrelated machines

    NARCIS (Netherlands)

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

    2013-01-01

    Two important characteristics encountered in many real-world scheduling problems are heterogeneous machines/processors and a certain degree of uncertainty about the actual sizes of jobs. The first characteristic entails machine dependent processing times of jobs and is captured by the classical

  8. Models and Algorithms for Production Planning and Scheduling in Foundries – Current State and Development Perspectives

    Directory of Open Access Journals (Sweden)

    A. Stawowy

    2012-04-01

    Full Text Available Mathematical programming, constraint programming and computational intelligence techniques, presented in the literature in the field of operations research and production management, are generally inadequate for planning real-life production process. These methods are in fact dedicated to solving the standard problems such as shop floor scheduling or lot-sizing, or their simple combinations such as scheduling with batching. Whereas many real-world production planning problems require the simultaneous solution of several problems (in addition to task scheduling and lot-sizing, the problems such as cutting, workforce scheduling, packing and transport issues, including the problems that are difficult to structure. The article presents examples and classification of production planning and scheduling systems in the foundry industry described in the literature, and also outlines the possible development directions of models and algorithms used in such systems.

  9. SOME NOTES ON CONDITIONED SUPPRESSION AND REINFORCEMENT SCHEDULES.

    Science.gov (United States)

    LYON, D O

    1964-07-01

    Two pigeons were trained on an FR 150 schedule of reinforcement. An Estes-Skinner conditioned suppression procedure was then superimposed on this performance at varied intervals. If the CS occurred during the early stages of the ratio run, complete suppression resulted. If the CS occurred during the later stages of the run, the birds continued to respond until the reinforcement was obtained, which was then followed by complete suppression.

  10. Scheduling EURO-k Conferences

    DEFF Research Database (Denmark)

    Stidsen, Thomas Jacob Riis; Pisinger, David; Vigo, Daniele

    2017-01-01

    EURO-k conferences are among the largest Operations Research conferences in the world, typically including more than 2000 presentations. As opposed to many other conferences, EURO-k conferences are hierarchically organized, and the conference schedule should reflect this structure to make...

  11. Planning and scheduling of the make-and-pack dairy production under lifetime uncertainty

    NARCIS (Netherlands)

    Sel, Çağrı; Bilgen, Bilge; Bloemhof-Ruwaard, Jacqueline

    2017-01-01

    In the dairy processing, the rapid quality decay of milk-based intermediate mixture to make and pack restricts productivity and, forces organizations to carefully plan and schedule their production. Hereby, in this study, we consider a planning and scheduling problem encountered in the dairy

  12. Scheduling language and algorithm development study. Volume 2: Use of the basic language and module library

    Science.gov (United States)

    Chamberlain, R. A.; Cornick, D. E.; Flater, J. F.; Odoherty, R. J.; Peterson, F. M.; Ramsey, H. R.; Willoughby, J. K.

    1974-01-01

    The capabilities of the specified scheduling language and the program module library are outlined. The summary is written with the potential user in mind and, therefore, provides maximum insight on how the capabilities will be helpful in writing scheduling programs. Simple examples and illustrations are provided to assist the potential user in applying the capabilities of his problem.

  13. 9 CFR 381.303 - Critical factors and the application of the process schedule.

    Science.gov (United States)

    2010-01-01

    ... Canning and Canned Products § 381.303 Critical factors and the application of the process schedule... 9 Animals and Animal Products 2 2010-01-01 2010-01-01 false Critical factors and the application of the process schedule. 381.303 Section 381.303 Animals and Animal Products FOOD SAFETY AND...

  14. 15 CFR 710.4 - Overview of scheduled chemicals and examples of affected industries.

    Science.gov (United States)

    2010-01-01

    ... Commerce and Foreign Trade (Continued) BUREAU OF INDUSTRY AND SECURITY, DEPARTMENT OF COMMERCE CHEMICAL... REGULATIONS (CWCR) § 710.4 Overview of scheduled chemicals and examples of affected industries. The following... 15 Commerce and Foreign Trade 2 2010-01-01 2010-01-01 false Overview of scheduled chemicals and...

  15. 78 FR 47319 - Fee Schedule for Reference Biological Standards and Biological Preparations

    Science.gov (United States)

    2013-08-05

    ... HUMAN SERVICES Centers for Disease Control and Prevention Fee Schedule for Reference Biological Standards and Biological Preparations AGENCY: Centers for Disease Control and Prevention (CDC), Department... HHS/CDC has reviewed and updated its fee schedule for reference biological standards and biological...

  16. Reduced labor and condensed schedules with cellular concrete solutions

    Energy Technology Data Exchange (ETDEWEB)

    Lavis, D. [CEMATRIX Inc., Calgary, AB (Canada)

    2008-07-01

    This paper discussed the use of cellular concrete materials in oil sands tank base foundation systems, shallow buried utility insulation systems, roadways, slabs, and buried modules. The concrete is formed from Portland cement, water, specialized pre-formed foaming agents, and air mixed in controlled proportions. Fly ash and polypropylene or glass fibers can also be used as additions. Cellular concrete can often be used to speed up construction and minimize labour requirements. Cellular concrete can be cast-in-place, and has soil-stabilizing and self-compacting features. The concrete can be produced and placed on-site at rates exceeding 120 cubic meters per hour. Cellular concrete can be pumped into place over long distances through flexible hoses. A case study comparing the cellular concrete to traditional plastic foam insulation was used to demonstrate the equivalency and adequacy of insulation, structural properties and installation costs. The study showed that although the cellular concrete had a high installation cost, greater compressive strength was gained. The concrete was self-levelling and did not require compaction or vibration. The use of the cellular concrete resulted in an accelerated construction schedule. 6 refs., 2 tabs., 6 figs.

  17. Resource Allocation and Outpatient Appointment Scheduling Using Simulation Optimization

    Directory of Open Access Journals (Sweden)

    Carrie Ka Yuk Lin

    2017-01-01

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

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

  19. 78 FR 58342 - Proposed Fee Schedule for Commercial Filming and Still Photography Permits

    Science.gov (United States)

    2013-09-23

    ... Forest Service Proposed Fee Schedule for Commercial Filming and Still Photography Permits AGENCY: Office... proposed fee schedule for commercial filming and still photography conducted on public lands under their... commercial filming and still photography that are consistent for the National Park Service, the U.S. Fish and...

  20. The Schedule for Nonadaptive and Adaptive Personality (SNAP)

    Science.gov (United States)

    Melley, Alison H.; Oltmanns, Thomas F.; Turkheimer, Eric

    2015-01-01

    The authors investigated the test-retest reliability and predictive validity of the diagnostic scales from the Schedule for Nonadaptive and Adaptive Personality (SNAP). Participants were identified from a sample of 240 undergraduates who completed the SNAP and the Social Adjustment Scale (SAS-SR) at Time 1. The authors selected 50 people who met criteria for a personality disorder (PD) based on the SNAP and 50 who did not qualify for a diagnosis. Eighty-three of these people completed the SNAP and the SAS-SR for a second time approximately 9 months after initial screening. SNAP PD scales were relatively stable over time. Test-retest correlation coefficients ranged from .58 to .81. Scores on diagnostic scales for paranoid, schizoid, and schizotypal PD were inversely related to self-reported levels of adjustment for social roles concerned with work as a student, leisure activities, and relationships with family. The results provide some evidence for the validity of the SNAP. PMID:12066833

  1. CERN Technical Training 2006: Software and System Technologies Curriculum - Scheduled

    CERN Multimedia

    2006-01-01

    Course Sessions (October 2006-March 2007) The Software and System Technologies Curriculum of the CERN Technical Training Programme offers comprehensive training in C++, Java, Perl, Python, XML, OO programming, JCOP/PVSS, database design and Oracle. In the PERL, C++, OO and Java course series there are some places available on the following course sessions, currently scheduled until March 2007: Object-Oriented Analysis and Design using UML: 17-19 October 2006 (3 days) JAVA 2 Enterprise Edition - Part 1: Web Applications: 19-20 October 2006 (2 days) JAVA - Level 1: 30 October -1 November 2006 (3 days) PERL 5 - Advanced Aspects: 2 November 2006 (1 day) C++ Programming Part 1 - Introduction to Object-Oriented Design and Programming: 14-16 November 2006 (3 days) JAVA - Level 2: 4-7 December 2006 (4 days) C++ Programming Part 2 - Advanced C++ and its Traps and Pitfalls: 12-15 December 2006 (4 days) JAVA 2 Enterprise Edition - Part 2: Enterprise JavaBeans: 18-20 December 2006 (3 days) C++ for Particle Physicists:...

  2. Combined Scheduling and Mapping for Scalable Computing with Parallel Tasks

    Directory of Open Access Journals (Sweden)

    Jörg Dümmler

    2012-01-01

    Full Text Available Recent and future parallel clusters and supercomputers use symmetric multiprocessors (SMPs and multi-core processors as basic nodes, providing a huge amount of parallel resources. These systems often have hierarchically structured interconnection networks combining computing resources at different levels, starting with the interconnect within multi-core processors up to the interconnection network combining nodes of the cluster or supercomputer. The challenge for the programmer is that these computing resources should be utilized efficiently by exploiting the available degree of parallelism of the application program and by structuring the application in a way which is sensitive to the heterogeneous interconnect. In this article, we pursue a parallel programming method using parallel tasks to structure parallel implementations. A parallel task can be executed by multiple processors or cores and, for each activation of a parallel task, the actual number of executing cores can be adapted to the specific execution situation. In particular, we propose a new combined scheduling and mapping technique for parallel tasks with dependencies that takes the hierarchical structure of modern multi-core clusters into account. An experimental evaluation shows that the presented programming approach can lead to a significantly higher performance compared to standard data parallel implementations.

  3. The school bus routing and scheduling problem with transfers.

    Science.gov (United States)

    Bögl, Michael; Doerner, Karl F; Parragh, Sophie N

    2015-03-01

    In this article, we study the school bus routing and scheduling problem with transfers arising in the field of nonperiodic public transportation systems. It deals with the transportation of pupils from home to their school in the morning taking the possibility that pupils may change buses into account. Allowing transfers has several consequences. On the one hand, it allows more flexibility in the bus network structure and can, therefore, help to reduce operating costs. On the other hand, transfers have an impact on the service level: the perceived service quality is lower due to the existence of transfers; however, at the same time, user ride times may be reduced and, thus, transfers may also have a positive impact on service quality. The main objective is the minimization of the total operating costs. We develop a heuristic solution framework to solve this problem and compare it with two solution concepts that do not consider transfers. The impact of transfers on the service level in terms of time loss (or user ride time) and the number of transfers is analyzed. Our results show that allowing transfers reduces total operating costs significantly while average and maximum user ride times are comparable to solutions without transfers. © 2015 Wiley Periodicals, Inc. NETWORKS, Vol. 65(2), 180-203 2015.

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

  5. Production and Resource Scheduling in Mass Customization with Dependent Setup Consideration

    DEFF Research Database (Denmark)

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

    2014-01-01

    Mass customization has been implemented in services and manufactures to increase the competitiveness of companies. In a manufacturing company, the procedure for production and resource scheduling has to be changed to adapt to mass customization. A good production and resource scheduling...

  6. Family Roles as Moderators of the Relationship between Schedule Flexibility and Stress

    Science.gov (United States)

    Jang, Soo Jung; Zippay, Allison; Park, Rhokeun

    2012-01-01

    Employer initiatives that address the spillover of work strain onto family life include flexible work schedules. This study explored the mediating role of negative work-family spillover in the relationship between schedule flexibility and employee stress and the moderating roles of gender, family workload, and single-parent status. Data were drawn…

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

    DEFF Research Database (Denmark)

    Eles, Petru; Kuchcinski, Krzysztof; Peng, Zebo

    1998-01-01

    The paper presents an approach to process scheduling for embedded systems. Target architectures consist of several processors and ASICs connected by shared busses. We have developed algorithms for process graph scheduling based on listscheduling and branch-and-bound strategies. One essential cont...

  8. Dutch national immunization schedule: compliance and associated characteristics for the primary series.

    NARCIS (Netherlands)

    Scheepers, Elsemieke D; van Lier, Alies; Drijfhout, Ingrid H; Berbers, Guy; van der Maas, Nicoline A T; de Melker, Hester E; Knol, Mirjam J

    In the Netherlands, the recommended priming immunization schedule for diphtheria, tetanus, pertussis and polio (DTaP-IPV) is at 2, 3 and 4 months of age. We evaluated the compliance with the recommended schedule, as well as its characteristics. We included all infants born between 2007 and 2012 who

  9. 18 CFR 35.1 - Application; obligation to file rate schedules, tariffs and certain service agreements.

    Science.gov (United States)

    2010-04-01

    ... THE FEDERAL POWER ACT FILING OF RATE SCHEDULES AND TARIFFS Application § 35.1 Application; obligation... 18 Conservation of Power and Water Resources 1 2010-04-01 2010-04-01 false Application; obligation to file rate schedules, tariffs and certain service agreements. 35.1 Section 35.1 Conservation of...

  10. 10 CFR Appendix A to Part 602 - Schedule of Renewal Applications and Reports

    Science.gov (United States)

    2010-01-01

    ... 10 Energy 4 2010-01-01 2010-01-01 false Schedule of Renewal Applications and Reports A Appendix A... HEALTH STUDIES FINANCIAL ASSISTANCE PROGRAM Pt. 602, App. A Appendix A to Part 602—Schedule of Renewal Applications and Reports Type When due Number of copies for awarding office 1. Summary: 200 words on scope and...

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

    Science.gov (United States)

    2010-04-01

    ... § 157.9 Notice of application and notice of schedule for environmental review. (a) Notice of each... schedule for the environmental review will be issued within 90 days of the notice of the application, and... 18 Conservation of Power and Water Resources 1 2010-04-01 2010-04-01 false Notice of application...

  12. 78 FR 52209 - Proposed Fee Schedule for Commercial Filming and Still Photography Permits

    Science.gov (United States)

    2013-08-22

    ... Forest Service Proposed Fee Schedule for Commercial Filming and Still Photography Permits AGENCY: Office... commercial filming and still photography conducted on public lands under their jurisdiction. The proposed fee schedule would establish land-use fees for commercial filming and still photography that are consistent for...

  13. The Green Ship Routing and Scheduling Problem (GSRSP): A conceptual approach

    DEFF Research Database (Denmark)

    Kontovas, Christos A.

    2014-01-01

    to 'green' routing and scheduling and outlines some possible ways to incorporate the air emissions dimension into maritime transportation OR. The main contribution of this note vis-a-vis the state of the art is that it conceptualizes the formulation of the 'Green Ship Routing and Scheduling Problem' (GSRSP...

  14. A visual representation system for the scheduling and management of projects

    NARCIS (Netherlands)

    Pollalis, S.N.

    1992-01-01

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

  15. Optimization of Hierarchically Scheduled Heterogeneous Embedded Systems

    DEFF Research Database (Denmark)

    Pop, Traian; Pop, Paul; Eles, Petru

    2005-01-01

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

  16. 77 FR 71447 - Notice of Fee Schedule for Reviewing Historic Preservation Certification Applications and...

    Science.gov (United States)

    2012-11-30

    ... National Park Service Notice of Fee Schedule for Reviewing Historic Preservation Certification Applications... for reviewing Historic Preservation Certification Applications in accordance with the schedule... applications received by State Historic Preservation Offices after the effective date of this fee schedule...

  17. Educational Conference Scheduling, Patient Discharge Time, and Resident Satisfaction.

    Science.gov (United States)

    Campbell, Steffanie; Campbell, Matthew; Shah, Chirayu; Djuricich, Alexander M

    2014-09-01

    Limits on resident duty hours instituted in 2003 and 2011 have compressed medical resident daily workload. Despite this compression, residents must gain competence to practice medicine without supervision. We sought to determine whether moving the time our educational conference is scheduled affects the time when patient discharges are completed on an internal medicine teaching service. The study was conducted at a county hospital within a large internal medicine residency program. During the 4-month study period, the morning report conference for internal medicine residents was shifted from 8:30 am to 2 pm. Patient discharge times, defined as the time the discharge order set was signed, were obtained for the service via the electronic health record. The outcomes measured were patient discharge time variation and internal medicine resident preference for conference time. Survey response rate was 82% (42 of 51). Of the residents who responded, 64% (27 of 42) preferred the 8:30 am report time, and 74% (31 of 42) felt the 8:30 am time was also better for education and timing of teaching rounds. There was no difference in discharge times for 2999 patients on the medicine teaching service, whether educational case conference morning report occurred at 8:30 am or at 2 pm. Medical patient average discharge time was not influenced by time of educational conference. Factors other than the timing of educational conference appear to influence hospital discharge times on an inpatient internal medicine service.

  18. Analysis of gain scheduled control for nonlinear plants

    Science.gov (United States)

    Shamma, Jeff S.; Athans, Michael

    1990-01-01

    Gain scheduling has proven to be a successful design methodology in many engineering applications. In the absence of a sound theoretical analysis, these designs come with no guarantees of the robustness, performance, or even nominal stability of the overall gain-scheduled design. An analysis is presented for two types of nonlinear gain-scheduled control systems: (1) scheduling on a reference trajectory and (2) scheduling on the plant output. Conditions which guarantee stability, robustness, and performance properties of the global gain schedule designs are given. These conditions confirm and formalize popular notions regarding gain-scheduled designs, such as that the scheduling variable should vary slowly and capture the plant's nonlinearities.

  19. Lightweight scheduling for delay and bandwidth assurance in differentiated services

    Science.gov (United States)

    Shin, Jitae; Lee, Daniel C.; Kuo, C.-C. Jay

    1999-11-01

    To overcome the inherent limitation of the single best- effort service currently provided the Internet, providing differentiated services for different classes of applications is being discussed in IETF. In this paper, we propose a lightweight packet scheduling algorithm that allocates forwarding resources to different classes, which we name controlled priority (CP) gateway algorithm. The proposed CP algorithm consists of two mechanisms denoted by CP-CQD (controllable queuing delay) and CP-STI (service time interval), respectively. CP-CQD controls the queuing delay for a class of delay/jitter-sensitive traffic. CP-STI is to service classes that require bandwidth assurance. The proposed algorithm can provide guaranteed bounds of delay, jitter, rate, and packet loss to certain aggregate flows. The CP-CQD can accommodate variable bit rate as well as constant bit rate flow without bandwidth reservation for end-to-end delay bound and minimum delay jitter. The CP-STI enables tagged classes to get guaranteed throughput. These two modules can control resources allocated to the traffic classes by adjusting parameters in response to local congestion level. The simulation results show that CP gateway algorithm can provide required quality of service to certain classes while easing the negative effects on best- effort classes.

  20. Integrated Requirement Selection and Scheduling for the Release Planning of a Software Product

    NARCIS (Netherlands)

    Li, C.; Akkermans, J.M.; Brinkkemper, S.; Diepen, G.

    2007-01-01

    This paper investigates two integer linear programming models that integrate requirement scheduling into software release planning. The first model can schedule the development of the requirements for the new release exactly in time so that the project span is minimized and the resource and

  1. 7 CFR 29.9404 - Marketing area opening dates and marketing schedules.

    Science.gov (United States)

    2010-01-01

    ... 7 Agriculture 2 2010-01-01 2010-01-01 false Marketing area opening dates and marketing schedules... MARKETING SERVICE (Standards, Inspections, Marketing Practices), DEPARTMENT OF AGRICULTURE COMMODITY....9404 Marketing area opening dates and marketing schedules. (a) The Flue-Cured Tobacco Advisory...

  2. Optimizing Plant-Line Schedules and an Application at Hidden Valley Manufacturing Company

    Science.gov (United States)

    2002-06-01

    hour. This is much faster than manual scheduling was—and the schedules are better. (Industries: agriculture –food. Production: scheduling–planning.) W e...the companymoved production of the originalHidden Valley Ranch salad dressing—a dry packet of season- ings to which the consumer adds buttermilk and

  3. Designing scheduling concept and computer support in the food processing industries

    NARCIS (Netherlands)

    van Donk, DP; van Wezel, W; Gaalman, G; Bititci, US; Carrie, AS

    1998-01-01

    Food processing industries cope with a specific production process and a dynamic market. Scheduling the production process is thus important in being competitive. This paper proposes a hierarchical concept for structuring the scheduling and describes the (computer) support needed for this concept.

  4. 77 FR 38775 - Schedules for Atlantic Shark Identification Workshops and Protected Species Safe Handling...

    Science.gov (United States)

    2012-06-29

    ... National Oceanic and Atmospheric Administration RIN 0648-XC042 Schedules for Atlantic Shark Identification... Shark Identification workshop originally scheduled for August 9, 2012, in Rosenberg, TX, has been... 77471. The July and September workshop dates remain unchanged. Atlantic Shark Identification workshops...

  5. 7 CFR 305.40 - Garbage treatment schedules for insect pests and pathogens.

    Science.gov (United States)

    2010-01-01

    ... Garbage § 305.40 Garbage treatment schedules for insect pests and pathogens. (a) T415-a, heat treatment... maintained adequately to ensure operation. (b) T415-b, dry heat or steam. The garbage must be heated to an... 7 Agriculture 5 2010-01-01 2010-01-01 false Garbage treatment schedules for insect pests and...

  6. Effectiveness of cytopenia prophylaxis for different filgrastim and pegfilgrastim schedules in a chemotherapy mouse model.

    Science.gov (United States)

    Scholz, Markus; Ackermann, Manuela; Emmrich, Frank; Loeffler, Markus; Kamprad, Manja

    2009-01-01

    Recombinant human granulocyte colony-stimulating factor (rhG-CSF) is widely used to treat neutropenia during cytotoxic chemotherapy. The optimal scheduling of rhG-CSF is unknown and can hardly be tested in clinical studies due to numerous therapy parameters affecting outcome (chemotherapeutic regimen, rhG-CSF schedules, individual covariables). Motivated by biomathematical model simulations, we aim to investigate different rhG-CSF schedules in a preclinical chemotherapy mouse model. The time course of hematotoxicity was studied in CD-1 mice after cyclophosphamide (CP) administration. Filgrastim was applied concomitantly in a 2 x 3-factorial design of two dosing options (2 x 20 mug and 4 x 10 mug) and three timing options (directly, one, and two days after CP). Alternatively, a single dose of 40 mug pegfilgrastim was applied at the three timing options. The resulting cytopenia was compared among the schedules. Dosing and timing had a significant influence on the effectiveness of filgrastim schedules whereas for pegfilgrastim the timing effect was irrelevant. The best filgrastim and pegfilgrastim schedules exhibited equivalent toxicity. Monocytes dynamics performed analogously to granulocytes. All schedules showed roughly the same lymphotoxicity. We conclude that effectiveness of filgrastim application depends heavily on its scheduling during chemotherapy. There is an optimum of timing. Dose splitting is better than concentrated applications. Effectiveness of pegfilgrastim is less dependent on timing.

  7. Effects of an advanced sleep schedule and morning short wavelength light exposure on circadian phase in young adults with late sleep schedules.

    Science.gov (United States)

    Sharkey, Katherine M; Carskadon, Mary A; Figueiro, Mariana G; Zhu, Yong; Rea, Mark S

    2011-08-01

    We examined the effects of an advanced sleep/wake schedule and morning short wavelength (blue) light in 25 adults (mean age±SD=21.8±3 years; 13 women) with late sleep schedules and subclinical features of delayed sleep phase disorder (DSPD). After a baseline week, participants kept individualized, fixed, advanced 7.5-h sleep schedules for 6days. Participants were randomly assigned to groups to receive "blue" (470nm, ∼225lux, n=12) or "dim" (<1lux, n=13) light for 1h after waking each day. Head-worn "Daysimeters" measured light exposure; actigraphs and sleep diaries confirmed schedule compliance. Salivary dim light melatonin onset (DLMO), self-reported sleep, and mood were examined with 2×2 ANOVA. After 6days, both groups showed significant circadian phase advances, but morning blue light was not associated with larger phase shifts than dim-light exposure. The average DLMO advances (mean±SD) were 1.5±1.1h in the dim light group and 1.4±0.7h in the blue light group. Adherence to a fixed advanced sleep/wake schedule resulted in significant circadian phase shifts in young adults with subclinical DSPD with or without morning blue light exposure. Light/dark exposures associated with fixed early sleep schedules are sufficient to advance circadian phase in young adults. Copyright © 2011 Elsevier B.V. All rights reserved.

  8. Briefly delayed reinforcement effects on variable-ratio and yoked-interval schedule performance.

    Science.gov (United States)

    Holtyn, August F; Lattal, Kennon A

    2013-09-01

    Most investigations of briefly delayed reinforcement have involved schedules that arrange a time-plus-response requirement. The present experiment examined whether briefly delaying reinforcement on schedules that have a ratio requirement differs from results with schedules that have a time-plus-response requirement. Four pigeons responded on a two-component multiple schedule. One component arranged a variable-ratio (VR) 50 and the other a variable-interval (VI) schedule in which the distribution of reinforcers was yoked to the preceding VR schedule. Across a series of conditions, delays were imposed in both schedules. These delays were brief (0.25- or 0.5-s) unsignaled delays and, as control conditions, a 5-s unsignaled delay and a 0.5-s delay signaled by a blackout of the chamber. In the yoked-VI component, the brief unsignaled delay increased response rates in six of nine opportunities and increased the proportion of short interresponse times (IRTs) (reinforcement condition. The results replicate effects reported with time-based schedules and extend these observations by showing that changes commonly observed in VI performance with briefly delayed reinforcement are not characteristic of VR responding. © Society for the Experimental Analysis of Behavior.

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

    OpenAIRE

    Kroon, Leo; Fischetti, Matteo

    2000-01-01

    textabstract: In this paper we describe the use of a set covering model with additional constraints for scheduling train drivers and conductors for the Dutch railway operator NS Reizigers. The schedules were generated according to new rules originating from the project "Destination: Customer" ("Bestemming: Klant" in Dutch). This project is carried out by NS Reizigers in order to increase the quality and the punctuality of its train services. With respect to the scheduling of drivers and condu...

  10. Levelled bed occupancy and controlled waiting lists using Master surgical schedules

    NARCIS (Netherlands)

    L. Evers (Lanah); J.M. van Oostrum (Jeroen); A.P.M. Wagelmans (Albert)

    2010-01-01

    textabstractScheduling surgical patients is one of the complex organizational tasks hospitals face daily. Master surgical scheduling is one way to optimize utilization of scarce resources and to create a more predictable outflow from the operating room towards subsequent hospital departments. The

  11. A Framework for Simplifying the Development of Kernel Schedulers: Design and Performance Evaluation

    DEFF Research Database (Denmark)

    Muller, Gilles; Lawall, Julia Laetitia; Duschene, Hervé

    2005-01-01

    Writing a new scheduler and integrating it into an existing OS is a daunting task, requiring the understanding of multiple low-level kernel mechanisms. Indeed, implementing a new scheduler is outside the expertise of application programmers, even though they are the ones who understand best the s...

  12. Equilibrium at a bottleneck when long-run and short-run scheduling preferences diverge

    NARCIS (Netherlands)

    Peer, S.; Verhoef, E.T.

    2013-01-01

    We consider the use of a Vickrey road bottleneck in the context of repetitive scheduling choices, distinguishing between long-run and short-run scheduling preferences. The preference structure reflects that there is a distinction between the (exogenous) 'long-run preferred arrival time', which would

  13. 76 FR 64074 - Schedules for Atlantic Shark Identification Workshops and Protected Species Safe Handling...

    Science.gov (United States)

    2011-10-17

    ... National Oceanic and Atmospheric Administration RIN 0648-XA670 Schedules for Atlantic Shark Identification... Shark Identification workshop scheduled for November 17, 2011, in Charleston, SC, has been changed. This.... Atlantic Shark Identification workshops are mandatory for Atlantic Shark Dealer permit holders or their...

  14. Relationships between Classroom Schedule Types and Performance on the Algebra I Criterion-Referenced Test

    Science.gov (United States)

    Murray, Gregory V.; Moyer-Packenham, Patricia S.

    2014-01-01

    One option for length of individual mathematics class periods is the schedule type selected for Algebra I classes. This study examined the relationship between student achievement, as indicated by Algebra I Criterion-Referenced Test scores, and the schedule type for Algebra I classes. Data obtained from the Utah State Office of Education included…

  15. Active scheduling of organ detection and segmentation in whole-body medical images.

    Science.gov (United States)

    Zhan, Yiqiang; Zhou, Xiang Sean; Peng, Zhigang; Krishnan, Arun

    2008-01-01

    With the advance of whole-body medical imaging technologies, computer aided detection/diagnosis (CAD) is being scaled up to deal with multiple organs or anatomical structures simultaneously. Multiple tasks (organ detection/segmentation) in a CAD system are often highly dependent due to the anatomical context within a human body. In this paper, we propose a method to schedule multi-organ detection/segmentation based on information theory. The central idea is to schedule tasks in an order that each operation achieves maximum expected information gain. The scheduling rule is formulated to embed two intuitive principles: (1) a task with higher confidence tends to be scheduled earlier; (2) a task with higher predictive power for other tasks tends to be scheduled earlier. More specifically, task dependency is modeled by conditional probability; the outcome of each task is assumed to be probabilistic as well; and the scheduling criterion is based on the reduction of the summed conditional entropy over all tasks. The validation is carried out on two challenging CAD problems, multi-organ detection in whole-body CT and liver segmentation in PET-CT. Compared to unscheduled and ad hoc scheduled organ detection/segmentation, our scheduled execution achieves higher accuracy with faster speed.

  16. Scheduling algorithm with controllable train speeds and departure times to decrease the total train tardiness

    Directory of Open Access Journals (Sweden)

    Omid Gholami

    2014-04-01

    Full Text Available The problem of generating a train schedule for a single-track railway system is addressed in this paper. A three stage scheduling is proposed to reduce the total train tardiness. We derived an appropriate job-shop scheduling algorithm called DR-algorithm. In the first stage, by determining appropriate weights of the dispatching rules, a pre-schedule is constructed. In the second stage, on the basis of the pre-schedule, the departure times of the trains are modified to reduce the number of conflicts in using railway sections by different trains. In the third stage, a train speed control helps the scheduler to change the trains’ speeds in order to reduce the train tardiness and to reach other objectives. The factual train schedule is based on the modified train speeds and on the modified departure times of the trains. The experimental running of the DR-algorithm on the benchmark instances showed this algorithm can solve train scheduling problems in a close to optimal way. In particular, the total train tardiness was reduced about 20% due to controlling train speeds and the departure times of the trains.

  17. Coordination between Generation and Transmission Maintenance Scheduling by Means of Multi-agent Technique

    Science.gov (United States)

    Nagata, Takeshi; Tao, Yasuhiro; Utatani, Masahiro; Sasaki, Hiroshi; Fujita, Hideki

    This paper proposes a multi-agent approach to maintenance scheduling in restructured power systems. The restructuring of electric power industry has resulted in market-based approaches for unbundling a multitude of service provided by self-interested entities such as power generating companies (GENCOs), transmission providers (TRANSCOs) and distribution companies (DISCOs). The Independent System Operator (ISO) is responsible for the security of the system operation. The schedule submitted to ISO by GENCOs and TRANSCOs should satisfy security and reliability constraints. The proposed method consists of several GENCO Agents (GAGs), TARNSCO Agents (TAGs) and a ISO Agent(IAG). The IAG’s role in maintenance scheduling is limited to ensuring that the submitted schedules do not cause transmission congestion or endanger the system reliability. From the simulation results, it can be seen the proposed multi-agent approach could coordinate between generation and transmission maintenance schedules.

  18. Religion as Schedule-Induced Behavior

    OpenAIRE

    Strand, Paul S

    2009-01-01

    In this article, I argue that a class of religious behaviors exists that is induced, for prepared organisms, by specific stimuli that are experienced according to a response-independent schedule. Like other schedule-induced behaviors, the members of this class serve as minimal units out of which functional behavior may arise. In this way, there exist two classes of religious behavior: nonoperant schedule-induced behaviors and operant behaviors. This dichotomy is consistent with the distinctio...

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

    Directory of Open Access Journals (Sweden)

    Ikbel Belaid

    2011-01-01

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

  20. Petri Net Modeling and Decomposition Method for Solving Production Scheduling Problems

    National Research Council Canada - National Science Library

    NISHI, Tatsushi; MAENO, Ryota

    2007-01-01

    Considering the need to develop general scheduling problem solver, the recent integration of Petri Nets as modeling tools into effective optimization methods for scheduling problems is very promising...

  1. Multiple schedules in practical application: Research trends and implications for future investigation

    National Research Council Canada - National Science Library

    Saini, Valdeep; Miller, Scott A; Fisher, Wayne W

    2016-01-01

    Researchers began studying multiple schedules in basic laboratories, but recent advances have extended research on multiple schedules to a wide variety of socially significant applications, especially...

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

  3. Flexible job-shop scheduling based on genetic algorithm and simulation validation

    Directory of Open Access Journals (Sweden)

    Zhou Erming

    2017-01-01

    Full Text Available This paper selects flexible job-shop scheduling problem as the research object, and Constructs mathematical model aimed at minimizing the maximum makespan. Taking the transmission reverse gear production line of a transmission corporation as an example, genetic algorithm is applied for flexible jobshop scheduling problem to get the specific optimal scheduling results with MATLAB. DELMIA/QUEST based on 3D discrete event simulation is applied to construct the physical model of the production workshop. On the basis of the optimal scheduling results, the logical link of the physical model for the production workshop is established, besides, importing the appropriate process parameters to make virtual simulation on the production workshop. Finally, through analyzing the simulated results, it shows that the scheduling results are effective and reasonable.

  4. Distributed Link Scheduling with Constant Overhead

    OpenAIRE

    Sanghavi, Sujay; Bui, Loc; Srikant, R.

    2006-01-01

    This paper proposes a new class of simple, distributed algorithms for scheduling in wireless networks. The algorithms generate new schedules in a distributed manner via simple local changes to existing schedules. The class is parameterized by integers $k\\geq 1$. We show that algorithm $k$ of our class achieves $k/(k+2)$ of the capacity region, for every $k\\geq 1$. The algorithms have small and constant worst-case overheads: in particular, algorithm $k$ generates a new schedule using {\\em (a)}...

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

  6. Biological and psychological responses to two rapid shiftwork schedules.

    Science.gov (United States)

    Lac, G; Chamoux, A

    2004-10-10

    This study presents the biological responses to shiftwork in two groups of workers with different shiftwork rotas. Biological responses were studied by recording the heart rate and the changes in the circadian profile of salivary cortisol over 24 h (RIA assays). Various items were recorded through questionnaires aimed at determining self appreciation of sleep quantity, stress, health, satisfaction at work and in private lives. Thirty two male subjects aged from 23 to 56, working for the same company, having given their informed consent, took part in the study. The study was carried out under realistic conditions (at the work place) under the control of an occupational physician. Sixteen day-workers (8 am-6 pm) served as a reference group. Eight shiftworkers included in alternate schedules (morning M 4 am-12 am, evening E 12 am-8 pm, night N 8 pm-4 am) according to a system M, S, N 3/2, (3 work, 2 rest) and eight according to a system 7/5 (3M/2S/2N/5R, 2/3/2/5, 2/2/3/5) constituted the groups of shiftworkers respectively named 3/2 and 7/5. All subjects had comparable ages and BMIs. Shiftworkers expressed a higher stress level and frequency of health problems and a lower satisfaction at work than the control. Among the three groups, the 7/5 group had the best health and fitness score and was in need of less sleep. Heart rate was not affected by shift work. Conversely, consistent changes appeared in cortisol circadian profiles, the greatest changes appearing for the night shift and among the two groups of shiftworkers, more particularly for the 7/5 group. These changes correlated with self-perceived constraints of work and showed the difficulties of adaptation to shiftwork.

  7. Practice and nap schedules modulate children's motor learning.

    Science.gov (United States)

    Ren, Jie; Guo, Wei; Yan, Jin H; Liu, Guanmin; Jia, Fujun

    2016-01-01

    Night- or day-time sleep enhances motor skill acquisition. However, prominent issues remained about the circadian (time-of-day) and homeostatic (time since last sleep) effects of sleep on developmental motor learning. Therefore, we examined the effects of nap schedules and nap-test-intervals (NTIs) on the learning of finger tapping sequences on computer keyboards. Children aged 6-7, 8-9, and 10-11 years explicitly acquired the short and long tapping orders that share the same movement strings (4-2-3-1-4, 4-2-3-1-4-2-3-1-4). Following a constant 8- or 10-hr post-learning period in one of the four NTIs (2, 4, 5, 7 hr), children in the morning napping groups, the afternoon napping groups, or the waking group performed the original long sequence in retention test (4-2-3-1-4-2-3-1-4) and the mirrored-order sequence in transfer test (1-3-2-4-1-3-2-4-1). Age and treatment differences in the movement time (MT, ms) and sequence accuracy (SA, %) were compared during skill learning and in retrieval tests. Results suggest that practice or nap affects MT and SA in a greater extent for the younger learners than for the older learners. The circadian effects might not change nap-based skill learning. Importantly, the longer NTIs resulted in superior retention performance than the shorter ones, suggesting that children require a relatively longer post-nap period to form motor memory. Finally, nap-based motor learning was more marked in skill retention than in skill transfer. Brain development may play an important role in motor learning. Our discussion centers on memory consolidation and its relevance for skill acquisition from early to late childhood. © 2015 Wiley Periodicals, Inc.

  8. Nurse Scheduling Using Genetic Algorithm

    OpenAIRE

    Leksakul, Komgrit; Phetsawat, Sukrit

    2014-01-01

    This study applied engineering techniques to develop a nurse scheduling model that, while maintaining the highest level of service, simultaneously minimized hospital-staffing costs and equitably distributed overtime pay. In the mathematical model, the objective function was the sum of the overtime payment to all nurses and the standard deviation of the total overtime payment that each nurse received. Input data distributions were analyzed in order to formulate a simulation model to determine ...

  9. Guidelines of Decommissioning Schedule Establishment

    Energy Technology Data Exchange (ETDEWEB)

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

    2016-10-15

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

  10. The CHI 2013 interactive schedule

    DEFF Research Database (Denmark)

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

    2013-01-01

    CHI 2013 offers over 500 separate events including paper presentations, panels, courses, case studies and special interest groups. Given the size of the conference, it is no longer practical to host live summaries of these events. Instead, a 30-second Video Preview summary of each event is availa...... with these displays using their mobile devices by either constructing custom video playlists or adding on-screen content to their personal schedule....

  11. [Calculation of underwater decompression schedule for the simulated 100 m Trimix conventional diving and verification of the schedule with animal experiment].

    Science.gov (United States)

    Li, Yang-yang; Shi, Lu; Zhang, Yan-meng; Xiao, Chan-juan; Liu, Hong-tao

    2015-05-01

    To explore the underwater decompression schedule for 100 m Trimix conventional diving operations and evaluate its safety through a simulated rabbits Trimix conventional diving. According to the Haldane theory, the assumed time units, the classification of tissue compartments, the nitrogen super-saturation safety coefficient and the selection of methods used for the calculation of the simulated 100 m Trimix conventional diving schedule were properly selected, and the calculating method for the dive decompression schedule was thus firmly established. In our experiments, five tissue compartments were selected during the calculation of decompression schedule: 5 min, 10 min, 20 min, 40 min and 75 min, and the nitrogen super-saturation safety coefficient was calculated by 1.6. Eight New Zealand rabbits were performed a simulated 100 m Trimix dive program which was established according to the Haldane theory, and eight rabbits for intact group. The tissues wet/dry ratio and ethology were detected and observed before and after the simulated diving to evaluate the safety of decompression schedule. By using the developed underwater decompression schedule, abnormal ethology changes in rabbits could not be observed after compression and decompression to the surface; and the tissues wet/dry ratio of simulated diving rabbits had no significant changes compared with the intact group (P > 0.05). The decompression schedule calculated by Haldane theory seemed to be safe and reliable, the diving breathing gas concentration did not cause oxygen toxicity and nitrogen narcosis among the dive rabbits, and dive efficiency was greatly improved by using enriched oxygen gas in UPTD safety range during decompression.

  12. IMPROVING PROJECT SCHEDULE ESTIMATES USING HISTORICAL DATA AND SIMULATION

    Directory of Open Access Journals (Sweden)

    P.H. Meyer

    2012-01-01

    Full Text Available

    ENGLISH ABSTRACT: Many projects are not completed on time or within the original budget. This is caused by uncertainty in project variables as well as the occurrence of risk events. A study was done to determine ways of measuring the risk in development projects executed by a mining company in South Africa. The main objective of the study was to determine whether historical project data would provide a more accurate means of estimating the total project duration. Original estimates and actual completion times for tasks of a number of projects were analysed and compared. The results of the study indicated that a more accurate total duration for a project could be obtained by making use of historical project data. The accuracy of estimates could be improved further by building a comprehensive project schedule database within a specific industry.

    AFRIKAANSE OPSOMMING: Verskeie projekte word nie binne die oorspronklike skedule of begroting voltooi nie. Dit word dikwels veroorsaak deur onsekerheid oor projekveranderlikes en die voorkoms van risiko’s. 'n Studie is gedoen om 'n metode te ontwikkel om risiko te meet vir ontwikkelingsprojekte van 'n mynmaatskappy in Suid Afrika. Die hoofdoel van die studie was om te bepaal of historiese projekdata gebruik kon word om 'n akkurater tydsduur vir 'n projek te beraam. Die geraamde tydsduur van take vir 'n aantal projekte is ontleed en vergelyk met die werklike tydsduur. Die resultate van die studie het getoon dat 'n akkurater totale tydsduur vir die projek verkry kon word deur gebruik te maak van historiese projekdata. Die akkuraatheid kan verder verbeter word deur 'n databasis van projekskedules vir 'n bepaalde industrie te ontwikkel en by datum te hou.

  13. Dynamic scheduling and planning parallel observations on large Radio Telescope Arrays with the Square Kilometre Array in mind

    Science.gov (United States)

    Buchner, Johannes

    2011-12-01

    Scheduling, the task of producing a time table for resources and tasks, is well-known to be a difficult problem the more resources are involved (a NP-hard problem). This is about to become an issue in Radio astronomy as observatories consisting of hundreds to thousands of telescopes are planned and operated. The Square Kilometre Array (SKA), which Australia and New Zealand bid to host, is aiming for scales where current approaches -- in construction, operation but also scheduling -- are insufficent. Although manual scheduling is common today, the problem is becoming complicated by the demand for (1) independent sub-arrays doing simultaneous observations, which requires the scheduler to plan parallel observations and (2) dynamic re-scheduling on changed conditions. Both of these requirements apply to the SKA, especially in the construction phase. We review the scheduling approaches taken in the astronomy literature, as well as investigate techniques from human schedulers and today's observatories. The scheduling problem is specified in general for scientific observations and in particular on radio telescope arrays. Also taken into account is the fact that the observatory may be oversubscribed, requiring the scheduling problem to be integrated with a planning process. We solve this long-term scheduling problem using a time-based encoding that works in the very general case of observation scheduling. This research then compares algorithms from various approaches, including fast heuristics from CPU scheduling, Linear Integer Programming and Genetic algorithms, Branch-and-Bound enumeration schemes. Measures include not only goodness of the solution, but also scalability and re-scheduling capabilities. In conclusion, we have identified a fast and good scheduling approach that allows (re-)scheduling difficult and changing problems by combining heuristics with a Genetic algorithm using block-wise mutation operations. We are able to explain and eradicate two problems in the

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

    Science.gov (United States)

    2010-07-22

    ...-3 (Net Income (Loss) Reconciliation for Certain Partnerships)). DATES: Written comments should be... (Loss) per Return (Schedule M-1), Analysis of Partners' Capital Accounts (Schedule M-2), and Net Income... Revenue Code section 6031 requires partnerships to file returns that show gross income items, allowable...

  15. PERFORMANCE ANALYSIS BETWEEN EXPLICIT SCHEDULING AND IMPLICIT SCHEDULING OF PARALLEL ARRAY-BASED DOMAIN DECOMPOSITION USING OPENMP

    Directory of Open Access Journals (Sweden)

    MOHAMMED FAIZ ABOALMAALY

    2014-10-01

    Full Text Available With the continuous revolution of multicore architecture, several parallel programming platforms have been introduced in order to pave the way for fast and efficient development of parallel algorithms. Back into its categories, parallel computing can be done through two forms: Data-Level Parallelism (DLP or Task-Level Parallelism (TLP. The former can be done by the distribution of data among the available processing elements while the latter is based on executing independent tasks concurrently. Most of the parallel programming platforms have built-in techniques to distribute the data among processors, these techniques are technically known as automatic distribution (scheduling. However, due to their wide range of purposes, variation of data types, amount of distributed data, possibility of extra computational overhead and other hardware-dependent factors, manual distribution could achieve better outcomes in terms of performance when compared to the automatic distribution. In this paper, this assumption is investigated by conducting a comparison between automatic and our newly proposed manual distribution of data among threads in parallel. Empirical results of matrix addition and matrix multiplication show a considerable performance gain when manual distribution is applied against automatic distribution.

  16. Routing and Scheduling Algorithms for WirelessHART Networks: A Survey

    Science.gov (United States)

    Nobre, Marcelo; Silva, Ivanovitch; Guedes, Luiz Affonso

    2015-01-01

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

  17. 78 FR 23981 - Proposed Collection; Comment Request for Form 1041 and Related Schedules D, J, and K-1

    Science.gov (United States)

    2013-04-23

    ... K-1 AGENCY: Internal Revenue Service (IRS), Treasury. ACTION: Notice and request for comments... Form 1041 and related Schedules D, J, and K-1, U.S. Income Tax Return for Estates and Trusts. DATES... Complex Trusts (Schedule J), and Beneficiary's Share of Income, Deductions, Credits, etc. (Schedule K-1...

  18. 75 FR 10018 - Proposed Collection; Comment Request for Form 1041 and Related Schedules D, J, and K-1

    Science.gov (United States)

    2010-03-04

    ... K-1 AGENCY: Internal Revenue Service (IRS), Treasury. ACTION: Notice and request for comments... Form 1041 and related Schedules D, J, and K-1, U.S. Income Tax Return for Estates and Trusts. DATES... Trusts (Schedule J), and Beneficiary's Share of Income, Deductions, Credits, etc. (Schedule K-1). OMB...

  19. Solving Flexible Job-Shop Scheduling Problem Using Gravitational Search Algorithm and Colored Petri Net

    Directory of Open Access Journals (Sweden)

    Behnam Barzegar

    2012-01-01

    Full Text Available Scheduled production system leads to avoiding stock accumulations, losses reduction, decreasing or even eliminating idol machines, and effort to better benefitting from machines for on time responding customer orders and supplying requested materials in suitable time. In flexible job-shop scheduling production systems, we could reduce time and costs by transferring and delivering operations on existing machines, that is, among NP-hard problems. The scheduling objective minimizes the maximal completion time of all the operations, which is denoted by Makespan. Different methods and algorithms have been presented for solving this problem. Having a reasonable scheduled production system has significant influence on improving effectiveness and attaining to organization goals. In this paper, new algorithm were proposed for flexible job-shop scheduling problem systems (FJSSP-GSPN that is based on gravitational search algorithm (GSA. In the proposed method, the flexible job-shop scheduling problem systems was modeled by color Petri net and CPN tool and then a scheduled job was programmed by GSA algorithm. The experimental results showed that the proposed method has reasonable performance in comparison with other algorithms.

  20. 21 CFR 1308.13 - Schedule III.

    Science.gov (United States)

    2010-04-01

    ... 21 Food and Drugs 9 2010-04-01 2010-04-01 false Schedule III. 1308.13 Section 1308.13 Food and Drugs DRUG ENFORCEMENT ADMINISTRATION, DEPARTMENT OF JUSTICE SCHEDULES OF CONTROLLED SUBSTANCES... 2316 (iii) Pentobarbital 2271 or any salt of any of these drugs and approved by the Food and Drug...

  1. Predicting Cost and Schedule Growth for Military and Civil Space Systems

    National Research Council Canada - National Science Library

    Rusnock, Christina F

    2008-01-01

    ... for predicting cost and schedule growth. The analysis consists of logistic and multiple regression to assess 21 Department of Defense and 71 National Aeronautics and Space Administration (NASA) space programs...

  2. Contracting, equal, and expanding learning schedules: the optimal distribution of learning sessions depends on retention interval.

    Science.gov (United States)

    Küpper-Tetzel, Carolina E; Kapler, Irina V; Wiseheart, Melody

    2014-07-01

    In laboratory and applied learning experiments, researchers have extensively investigated the optimal distribution of two learning sessions (i.e., initial learning and one relearning session) for the learning of verbatim materials. However, research has not yet provided a satisfying and conclusive answer to the optimal scheduling of three learning sessions (i.e., initial learning and two relearning sessions) across educationally relevant time intervals. Should the to-be-learned material be repeated at decreasing intervals (contracting schedule), constant intervals (equal schedule), or increasing intervals (expanding schedule) between learning sessions? Different theories and memory models (e.g., study-phase retrieval theory, contextual variability theory, ACT-R, and the Multiscale Context Model) make distinct predictions about the optimal learning schedule. We discuss the extant theories and derive clear predictions from each of them. To test these predictions empirically, we conducted an experiment in which participants studied and restudied paired associates with a contracting, equal, or expanding learning schedule. Memory performance was assessed immediately, 1 day, 7 days, or 35 days later with free- and cued-recall tests. Our results revealed that the optimal learning schedule is conditional on the length of the retention interval: A contracting learning schedule was beneficial for retention intervals up to 7 days, but both equal and expanding learning schedules were better for a long retention interval of 35 days. Our findings can be accommodated best by the contextual variability theory and indicate that revisions are needed to existing memory models. Our results are practically relevant, and their implications for real-world learning are discussed.

  3. 15 CFR 700.14 - Preferential scheduling.

    Science.gov (United States)

    2010-01-01

    ... 15 Commerce and Foreign Trade 2 2010-01-01 2010-01-01 false Preferential scheduling. 700.14...) BUREAU OF INDUSTRY AND SECURITY, DEPARTMENT OF COMMERCE NATIONAL SECURITY INDUSTRIAL BASE REGULATIONS DEFENSE PRIORITIES AND ALLOCATIONS SYSTEM Industrial Priorities § 700.14 Preferential scheduling. (a) A...

  4. A Heuristic Approach to Scheduling University Timetables.

    Science.gov (United States)

    Loo, E. H.; And Others

    1986-01-01

    Categories of facilities utilization and scheduling requirements to be considered when using a heuristic approach to timetabling are described together with a nine-step algorithm and the computerized timetabling system, Timetable Schedules System (TTS); TTS utilizes heuristic approach. An example demonstrating use of TTS and a program flowchart…

  5. Design tool for multiprocessor scheduling and evaluation of iterative dataflow algorithms

    Science.gov (United States)

    Jones, Robert L., III

    1995-01-01

    A graph-theoretic design process and software tool is defined for selecting a multiprocessing scheduling solution for a class of computational problems. The problems of interest are those that can be described with a dataflow graph and are intended to be executed repetitively on a set of identical processors. Typical applications include signal processing and control law problems. Graph-search algorithms and analysis techniques are introduced and shown to effectively determine performance bounds, scheduling constraints, and resource requirements. The software tool applies the design process to a given problem and includes performance optimization through the inclusion of additional precedence constraints among the schedulable tasks.

  6. Lightweight EDF Scheduling with Deadline Inheritance

    NARCIS (Netherlands)

    Jansen, P.G.; Mullender, Sape J.; Scholten, Johan; Havinga, Paul J.M.

    EDFI is a lightweight real-time scheduling protocol that combines EDF with deadline inheritance over shared resources. We will show that EDFI is flexible during a tasks admission control, efficient with scheduling and dispatching, and straightforward in feasibility analysis. The application

  7. HEURISTIC SCHEDULING IN A NIGERIA FURNITURE SHOP

    African Journals Online (AJOL)

    NIJOTECH

    shortest processing time rule (SPT), longest processing time rule (LPT), and monetary value of completed order rule (MO); and possibly ascertain whether any of these rules offers a better schedule than the FIFO schedule currently used by the shop. This comparison is carried out on the basis of the combined objective.

  8. Unrelated Machine Scheduling with Stochastic Processing Times

    NARCIS (Netherlands)

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

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

  9. A Program Master Schedule Can Improve Results

    Science.gov (United States)

    2014-02-01

    A Program Master Schedule Can Improve Results Patrick K. Barker “There cannot be a crisis today; my schedule is already full.” — Henry Kissinger...briefings, so PMOs often rely on static pictures and Gantt charts available on presentation software such as Microsoft PowerPoint. That’s fine—and

  10. Improved MLWDF scheduler for LTE downlink transmission

    Science.gov (United States)

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

    2016-11-01

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

  11. Integrated approach in solving parallel machine scheduling and location (ScheLoc problem

    Directory of Open Access Journals (Sweden)

    Mohsen Rajabzadeh

    2016-09-01

    Full Text Available Scheduling and layout planning are two important areas of operations research, which are used in the areas of production planning, logistics and supply chain management. In many industries locations of machines are not specified, previously, therefore, it is necessary to consider both location and scheduling, simultaneously. This paper presents a mathematical model to consider both scheduling and layout planning for parallel machines in discrete and continuous spaces, concurrently. The preliminary results have indicated that the integrated model is capable of handling problems more efficiently.

  12. Automated Scheduling of Science Activities for Titan Encounters by Cassini

    Science.gov (United States)

    Ray, Trina L.; Knight, Russel L.; Mohr, Dave

    2014-01-01

    In an effort to demonstrate the efficacy of automated planning and scheduling techniques for large missions, we have adapted ASPEN (Activity Scheduling and Planning Environment) [1] and CLASP (Compressed Large-scale Activity Scheduling and Planning) [2] to the domain of scheduling high-level science goals into conflict-free operations plans for Titan encounters by the Cassini spacecraft.

  13. Aircraft Routing and Scheduling: a Case Study in an Airline Company

    Directory of Open Access Journals (Sweden)

    Aslan Deniz Karaoglan

    2011-07-01

    Full Text Available A major problem faced by every airline company is to construct a dailyschedule for a heterogeneous aircraft fleet. In the present paper implementation of aircraftrouting and scheduling for cargo transportation, known as one of the scheduling problemin transportation, in an airline company is presented. First, problems faced by thecompany are defined and then implementation steps and expected improvements that willresult from carrying out the solution of mathematical model of the problem are given indetail. The purpose of this paper is to describe, analyze and evaluate a case study of howaircraft scheduling was managed in an airline company.

  14. Burst segmentation for void-filling scheduling and its performance evaluation in optical burst switching.

    Science.gov (United States)

    Tan, Wei; Wang, Sheng; Li, Lemin

    2004-12-27

    As a promising solution for the next generation optical Internet, optical burst switching still has much to be improved, especially the design of core routers. This paper mainly focuses on channel scheduling algorithms of core routers and proposes a new practical scheduling algorithm. In the new algorithm, burst segmentation, one of the contention resolution schemes that are another major concern in core router design, is introduced. The proposed algorithm is analyzed theoretically and evaluated by computer simulations. The results show that the new algorithm, compared with existing traditional scheduling algorithms, can lower the packet loss probability and enhance the link utilization and network performance.

  15. Logical Link Control and Channel Scheduling for Multichannel Underwater Sensor Networks

    Directory of Open Access Journals (Sweden)

    Jun Li

    2012-08-01

    Full Text Available With recent developments in terrestrial wireless networks and advances in acoustic communications, multichannel technologies have been proposed to be used in underwater networks to increase data transmission rate over bandwidth-limited underwater channels. Due to high bit error rates in underwater networks, an efficient error control technique is critical in the logical link control (LLC sublayer to establish reliable data communications over intrinsically unreliable underwater channels. In this paper, we propose a novel protocol stack architecture featuring cross-layer design of LLC sublayer and more efficient packetto- channel scheduling for multichannel underwater sensor networks. In the proposed stack architecture, a selective-repeat automatic repeat request (SR-ARQ based error control protocol is combined with a dynamic channel scheduling policy at the LLC sublayer. The dynamic channel scheduling policy uses the channel state information provided via cross-layer design. It is demonstrated that the proposed protocol stack architecture leads to more efficient transmission of multiple packets over parallel channels. Simulation studies are conducted to evaluate the packet delay performance of the proposed cross-layer protocol stack architecture with two different scheduling policies: the proposed dynamic channel scheduling and a static channel scheduling. Simulation results show that the dynamic channel scheduling used in the cross-layer protocol stack outperforms the static channel scheduling. It is observed that, when the dynamic channel scheduling is used, the number of parallel channels has only an insignificant impact on the average packet delay. This confirms that underwater sensor networks will benefit from the use of multichannel communications.

  16. System/360 Computer Assisted Network Scheduling (CANS) System

    Science.gov (United States)

    Brewer, A. C.

    1972-01-01

    Computer assisted scheduling techniques that produce conflict-free and efficient schedules have been developed and implemented to meet needs of the Manned Space Flight Network. CANS system provides effective management of resources in complex scheduling environment. System is automated resource scheduling, controlling, planning, information storage and retrieval tool.

  17. 29 CFR 1952.173 - Developmental schedule.

    Science.gov (United States)

    2010-07-01

    ... 29 Labor 9 2010-07-01 2010-07-01 false Developmental schedule. 1952.173 Section 1952.173 Labor Regulations Relating to Labor (Continued) OCCUPATIONAL SAFETY AND HEALTH ADMINISTRATION, DEPARTMENT OF LABOR... schedule. (a) Within 1 year following plan approval, legislation will be enacted authorizing complete...

  18. 5 CFR 950.801 - Campaign schedule.

    Science.gov (United States)

    2010-01-01

    ... 5 Administrative Personnel 2 2010-01-01 2010-01-01 false Campaign schedule. 950.801 Section 950... VOLUNTARY ORGANIZATIONS CFC Timetable § 950.801 Campaign schedule. (a) The Combined Federal Campaign will be.../International and International parts of the Charity List to all local campaigns by a date to be determined by...

  19. Robust scheduling in an uncertain environment

    NARCIS (Netherlands)

    Wilson, M.

    2016-01-01

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

  20. Scheduling identical jobs on uniform parallel machines

    NARCIS (Netherlands)

    M.I. Dessouky; B.J. Lageweg; J.K. Lenstra (Jan Karel); S.L. van de Velde

    1990-01-01

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

  1. A computational approach to optimized appointment scheduling

    NARCIS (Netherlands)

    Kuiper, A.; Kemper, B.; Mandjes, M.

    2015-01-01

    Appointment scheduling is prevalent in various healthcare settings. Generally, the objective is to determine a schedule (i.e., the sequence of epochs at which the individual patients are asked to appear) that appropriately balances the interests of the patients (low waiting times) and the medical

  2. Optimal online-list batch scheduling

    NARCIS (Netherlands)

    Paulus, J.J.; Ye, Deshi; Zhang, Guochuan

    We consider the online-list batch scheduling problem. Jobs arrive one by one and have to be assigned upon arrival to a scheduled batch such that the makespan is minimized. Each batch can accommodate up to B jobs. We give a complete classification of the tractability of this online problem.

  3. 76 FR 18262 - January 2011 Pay Schedules

    Science.gov (United States)

    2011-04-01

    ... members covered by a certified SES performance appraisal system and $165,300 (level III of the Executive Schedule) for SES members covered by an SES performance appraisal system that has not been certified. The... (level II of the Executive Schedule) for SL or ST employees covered by a certified SL/ST performance...

  4. Development of an Irrigation Scheduling Model

    Directory of Open Access Journals (Sweden)

    BAKHSHAL KHAN LASHARI

    2010-10-01

    Full Text Available This paper presents an irrigation scheduling software named ?Mehran Model? which computes reference evapotranspiration (ETo using FAO-56 Penman Monteith method and crop evapotranspiration (ETc by dual crop coefficients. The model can develop irrigation schedules for sixty-six crop types using soil and water balance approach. The model distinguishes soil texture classes, irrigation methods, and designs real time irrigation schedule for a crop using daily weather data of a reference site. The Mehran Model also includes planning on demand basis as well as rotational (warabandi irrigation schedules, and synchronizes both systems as well. The model has been field tested and validated on planning and management of irrigation schedules for cotton and wheat crops in Lower Indus Basin of Pakistan. Statistical analysis showed that the model at an average overestimated seasonal ETc of cotton and wheat crop by 2.41% and 4.31% respectively.

  5. Day-to-Day Scheduling Travel Time Adjustment Behavior and Simulation

    Directory of Open Access Journals (Sweden)

    Hua-Min Li

    2014-01-01

    Full Text Available This paper proposes a modeling framework to study the day-to-day scheduling travel time adjustment behavior on the base of past experiences. Scheduling travel time is defined as the difference between the requested arrival time and the departure time. Mathematical equations are established to formulate every traveler’s dynamic adjustment on his/her departure time. In the adjustment process, the last day’s scheduling time is an essential component, while the numbers of late arrivals, punctual arrivals, and early arrivals in a previous day are used to reflect the past experiences. Simulation results are presented to illustrate the effectiveness of the proposed modeling framework.

  6. Schedule Control and Nursing Home Quality: Exploratory Evidence of a Psychosocial Predictor of Resident Care.

    Science.gov (United States)

    Hurtado, David A; Berkman, Lisa F; Buxton, Orfeu M; Okechukwu, Cassandra A

    2016-02-01

    To examine whether nursing homes' quality of care was predicted by schedule control (workers' ability to decide work hours), independently of other staffing characteristics. Prospective ecological study of 30 nursing homes in New England. Schedule control was self-reported via survey in 2011-2012 (N = 1,045). Quality measures included the prevalence of decline in activities of daily living, residents' weight loss, and pressure ulcers, indicators systematically linked with staffing characteristics. Outcomes data for 2012 were retrieved from Medicare.gov. Robust Linear Regressions showed that higher schedule control predicted lower prevalence of pressure ulcers (β = -0.51, p quality of care. © The Author(s) 2014.

  7. 40 CFR 147.2921 - Schedule of compliance.

    Science.gov (United States)

    2010-07-01

    ...-Class II Wells § 147.2921 Schedule of compliance. The permit may, when appropriate, specify a schedule... 40 Protection of Environment 22 2010-07-01 2010-07-01 false Schedule of compliance. 147.2921.... (a) Any schedule of compliance shall require compliance as soon as possible, and in no case later...

  8. Topology-based hierarchical scheduling using deficit round robin

    DEFF Research Database (Denmark)

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

    2009-01-01

    This paper proposes a topology-based hierarchical scheduling scheme using Deficit Round Robin (DRR). The main idea of the topology-based hierarchical scheduling is to map the topology of the connected network into the logical structure of the scheduler, and combine several token schedulers...

  9. 47 CFR 1.1109 - Schedule of charges for applications and other filings for the Homeland services.

    Science.gov (United States)

    2010-10-01

    ... 47 Telecommunication 1 2010-10-01 2010-10-01 false Schedule of charges for applications and other... COMMISSION GENERAL PRACTICE AND PROCEDURE Schedule of Statutory Charges and Procedures for Payment § 1.1109 Schedule of charges for applications and other filings for the Homeland services. Remit manual filings and...

  10. Response-rate differences in variable-interval and variable-ratio schedules: An old problem revisited

    OpenAIRE

    Cole, Mark R.

    1994-01-01

    In Experiment 1, a variable-ratio 10 schedule became, successively, a variable-interval schedule with only the minimum interreinforcement intervals yoked to the variable ratio, or a variable-interval schedule with both interreinforcement intervals and reinforced interresponse times yoked to the variable ratio. Response rates in the variable-interval schedule with both interreinforcement interval and reinforced interresponse time yoking fell between the higher rates maintained by the variable-...

  11. 47 CFR 1.1105 - Schedule of charges for applications and other filings for the wireline competition services.

    Science.gov (United States)

    2010-10-01

    ... 47 Telecommunication 1 2010-10-01 2010-10-01 false Schedule of charges for applications and other... COMMUNICATIONS COMMISSION GENERAL PRACTICE AND PROCEDURE Schedule of Statutory Charges and Procedures for Payment § 1.1105 Schedule of charges for applications and other filings for the wireline competition services...

  12. 47 CFR 1.1106 - Schedule of charges for applications and other filings for the enforcement services.

    Science.gov (United States)

    2010-10-01

    ... 47 Telecommunication 1 2010-10-01 2010-10-01 false Schedule of charges for applications and other... COMMISSION GENERAL PRACTICE AND PROCEDURE Schedule of Statutory Charges and Procedures for Payment § 1.1106 Schedule of charges for applications and other filings for the enforcement services. Remit manual filings...

  13. 47 CFR 1.1153 - Schedule of annual regulatory fees and filing locations for mass media services.

    Science.gov (United States)

    2010-10-01

    ... 47 Telecommunication 1 2010-10-01 2010-10-01 false Schedule of annual regulatory fees and filing... GENERAL PRACTICE AND PROCEDURE Schedule of Statutory Charges and Procedures for Payment § 1.1153 Schedule... amount Address 1. AM Class A: 3,000,000 population 8,100 2. AM Class B: 3,000,000 population 6,475 3. AM...

  14. Production scheduling with ant colony optimization

    Science.gov (United States)

    Chernigovskiy, A. S.; Kapulin, D. V.; Noskova, E. E.; Yamskikh, T. N.; Tsarev, R. Yu

    2017-10-01

    The optimum solution of the production scheduling problem for manufacturing processes at an enterprise is crucial as it allows one to obtain the required amount of production within a specified time frame. Optimum production schedule can be found using a variety of optimization algorithms or scheduling algorithms. Ant colony optimization is one of well-known techniques to solve the global multi-objective optimization problem. In the article, the authors present a solution of the production scheduling problem by means of an ant colony optimization algorithm. A case study of the algorithm efficiency estimated against some others production scheduling algorithms is presented. Advantages of the ant colony optimization algorithm and its beneficial effect on the manufacturing process are provided.

  15. 47 CFR 1.1107 - Schedule of charges for applications and other filings for the international services.

    Science.gov (United States)

    2010-10-01

    ... 47 Telecommunication 1 2010-10-01 2010-10-01 false Schedule of charges for applications and other... Schedule of charges for applications and other filings for the international services. Remit manual filings... Stations: a. Initial Application (per station) 312 Main & Schedule B & 159 2,530.00 BAX b. Modification of...

  16. A Group Theoretic Tabu Search Methodology for Solving the Theater Distribution Vehicle Routing and Scheduling Problem

    National Research Council Canada - National Science Library

    Crino, John

    2002-01-01

    .... This dissertation applies and extends some of Colletti's (1999) seminal work in group theory and metaheuristics in order to solve the theater distribution vehicle routing and scheduling problem (TDVRSP...

  17. Tube Map Interface for a Coupled Scheduling and Diagnostics System Project

    Data.gov (United States)

    National Aeronautics and Space Administration — We propose the concept of a tube map display as a means to effectively integrate schedule timeline information and fault diagnosis data into a single high value...

  18. The Design and Optimization of an Integrated Arrival/Departure Scheduler Project

    Data.gov (United States)

    National Aeronautics and Space Administration — Intelligent Automation, Inc. (IAI) proposes the design and validation of a dynamic integrated arrival/departure scheduler. In contrast to current approaches, we...

  19. Energy Efficient Cooperative Network Coding with Joint Relay Scheduling and Power Allocation

    OpenAIRE

    Qi, Nan; Xiao, Ming; Tsiftsis, Theodoros A.; Skoglund, Mikael; Cao, Phuong L.; Li, Lixin

    2016-01-01

    The energy efficiency (EE) of a multi-user multi-relay system with the maximum diversity network coding (MDNC) is studied. We explicitly find the connection among the outage probability, energy consumption and EE and formulate the maximizing EE problem under the outage probability constraints. Relay scheduling (RS) and power allocation (PA) are applied to schedule the relay states (transmitting, sleeping, \\emph{etc}) and optimize the transmitting power under the practical channel and power co...

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

    Directory of Open Access Journals (Sweden)

    Yongyi Shou

    2014-01-01

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

  1. A Recovery Model for Production Scheduling: Combination of Disruption Management and Internet of Things

    Directory of Open Access Journals (Sweden)

    Yang Jiang

    2016-01-01

    Full Text Available It is difficult to generate the new schedule effectively for minimizing the negative impact when an unanticipated disruption occurs after a subset of tasks has been finished in production scheduling. In such cases, continuing with the original schedule may not be optimal or feasible. Based on disruption management and Internet of things (IoT, this study designs a real-time status analyzer to identify the disruption and propose a recovery model to deal with the disruption. The computational result proves that our algorithm is competitive with the existing heuristics. Furthermore, due to the tradeoff between all participators (mainly including customers, managers of production enterprise, and workers involved in production scheduling, our model is more effective than the total rescheduling and right-shift rescheduling.

  2. A Collaborative Scheduling Model for the Supply-Hub with Multiple Suppliers and Multiple Manufacturers

    Directory of Open Access Journals (Sweden)

    Guo Li

    2014-01-01

    Full Text Available This paper investigates a collaborative scheduling model in the assembly system, wherein multiple suppliers have to deliver their components to the multiple manufacturers under the operation of Supply-Hub. We first develop two different scenarios to examine the impact of Supply-Hub. One is that suppliers and manufacturers make their decisions separately, and the other is that the Supply-Hub makes joint decisions with collaborative scheduling. The results show that our scheduling model with the Supply-Hub is a NP-complete problem, therefore, we propose an auto-adapted differential evolution algorithm to solve this problem. Moreover, we illustrate that the performance of collaborative scheduling by the Supply-Hub is superior to separate decision made by each manufacturer and supplier. Furthermore, we also show that the algorithm proposed has good convergence and reliability, which can be applicable to more complicated supply chain environment.

  3. Operating room scheduling using hybrid clustering priority rule and genetic algorithm

    Science.gov (United States)

    Santoso, Linda Wahyuni; Sinawan, Aisyah Ashrinawati; Wijaya, Andi Rahadiyan; Sudiarso, Andi; Masruroh, Nur Aini; Herliansyah, Muhammad Kusumawan

    2017-11-01

    Operating room is a bottleneck resource in most hospitals so that operating room scheduling system will influence the whole performance of the hospitals. This research develops a mathematical model of operating room scheduling for elective patients which considers patient priority with limit number of surgeons, operating rooms, and nurse team. Clustering analysis was conducted to the data of surgery durations using hierarchical and non-hierarchical methods. The priority rule of each resulting cluster was determined using Shortest Processing Time method. Genetic Algorithm was used to generate daily operating room schedule which resulted in the lowest values of patient waiting time and nurse overtime. The computational results show that this proposed model reduced patient waiting time by approximately 32.22% and nurse overtime by approximately 32.74% when compared to actual schedule.

  4. Life expectancy evaluation and development of a replacement schedule for LED traffic signals.

    Science.gov (United States)

    2011-03-01

    This research details a field study of LED traffic signals in Missouri and develops a replacement schedule : based on key findings. Rates of degradation were statistically analyzed using Analysis of Variance : (ANOVA). Results of this research will p...

  5. 78 FR 64533 - Silica Bricks and Shapes From China; Revised Schedule for the Subject Investigation

    Science.gov (United States)

    2013-10-29

    ... From the Federal Register Online via the Government Publishing Office INTERNATIONAL TRADE COMMISSION Silica Bricks and Shapes From China; Revised Schedule for the Subject Investigation AGENCY: United States International Trade Commission. ACTION: Notice. DATES: Effective Date: October 23, 2013. FOR...

  6. 77 FR 26279 - Scheduled Change and Deletion of Agenda Item From April 27, 2012, Open Meeting

    Science.gov (United States)

    2012-05-03

    ... From the Federal Register Online via the Government Publishing Office FEDERAL COMMUNICATIONS COMMISSION Scheduled Change and Deletion of Agenda Item From April 27, 2012, Open Meeting Date: April 25... of Managing Director. BILLING CODE 6712-01-P ...

  7. Complexity and Approximation for Scheduling Problem for Coupled-Tasks in Presence of Compatibility Tasks

    OpenAIRE

    Simonin, Gilles; Giroudeau, Rodolphe; König, Jean-Claude

    2010-01-01

    International audience; In this paper, we study a scheduling problem with compled-tasks in presence of incompatible constraint. We give complexity results and a polynomial-time approximation for a specific problem when the compatibility graph has different topologies.

  8. Financial Audit: Bureau of the Public Debt's Fiscal Years 2001 and 2000 Schedules of Federal Debt

    National Research Council Canada - National Science Library

    2002-01-01

    The accompanying auditor's report presents the results of our audits of the Schedules of Federal Debt Managed by the Bureau of the Public Debt for the fiscal years ended September 30, 2001 and 2000...

  9. Group Elevator Peak Scheduling Based on Robust Optimization Model

    OpenAIRE

    Zhang, J.; Q. Zong

    2013-01-01

    Scheduling of Elevator Group Control System (EGCS) is a typical combinatorial optimization problem. Uncertain group scheduling under peak traffic flows has become a research focus and difficulty recently. RO (Robust Optimization) method is a novel and effective way to deal with uncertain scheduling problem. In this paper, a peak scheduling method based on RO model for multi-elevator system is proposed. The method is immune to the uncertainty of peak traffic flows, optimal scheduling is re...

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

    Science.gov (United States)

    Carter, Christine E; Grahn, Jessica A

    2016-01-01

    Repetition is the most commonly used practice strategy by musicians. Although blocks of repetition continue to be suggested in the pedagogical literature, work in the field of cognitive psychology suggests that repeated events receive less processing, thereby reducing the potential for long-term learning. Motor skill learning and sport psychology research offer an alternative. Instead of using a blocked practice schedule, with practice completed on one task before moving on to the next task, an interleaved schedule can be used, in which practice is frequently alternated between tasks. This frequent alternation involves more effortful processing, resulting in increased long-term learning. The finding that practicing in an interleaved schedule leads to better retention than practicing in a blocked schedule has been labeled the "contextual interference effect." While the effect has been observed across a wide variety of fields, few studies have researched this phenomenon in a music-learning context, despite the broad potential for application to music practice. This study compared the effects of blocked and interleaved practice schedules on advanced clarinet performance in an ecologically valid context. Ten clarinetists were given one concerto exposition and one technical excerpt to practice in a blocked schedule (12 min per piece) and a second concerto exposition and technical excerpt to practice in an interleaved schedule (3 min per piece, alternating until a total of 12 min of practice were completed on each piece). Participants sight-read the four pieces prior to practice and performed them at the end of practice and again one day later. The sight-reading and two performance run-throughs of each piece were recorded and given to three professional clarinetists to rate using a percentage scale. Overall, whenever there was a ratings difference between the conditions, pieces practiced in the interleaved schedule were rated better than those in the blocked schedule

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

    Directory of Open Access Journals (Sweden)

    Christine E Carter

    2016-08-01

    Full Text Available Repetition is the most commonly used practice strategy by musicians. Although blocks of repetition continue to be suggested in the pedagogical literature, work in the field of cognitive psychology suggests that repeated events receive less processing, thereby reducing the potential for long-term learning. Motor skill learning and sport psychology research offer an alternative. Instead of using a blocked practice schedule, with practice completed on one task before moving on to the next task, an interleaved schedule can be used, in which practice is frequently alternated between tasks. This frequent alternation involves more effortful processing, resulting in increased long-term learning. The finding that practicing in an interleaved schedule leads to better retention than practicing in a blocked schedule has been labeled the contextual interference effect. While the effect has been observed across a wide variety of fields, few studies have researched this phenomenon in a music-learning context, despite the broad potential for application to music practice. This study compared the effects of blocked and interleaved practice schedules on advanced clarinet performance in an ecologically valid context. Ten clarinetists were given one concerto exposition and one technical excerpt to practice in a blocked schedule (twelve minutes per piece and a second concerto exposition and technical excerpt to practice in an interleaved schedule (three minutes per piece, alternating until a total of twelve minutes of practice were completed on each piece. Participants sight-read the four pieces prior to practice and performed them at the end of practice and again one day later. The sight-reading and two performance run-throughs of each piece were recorded and given to three professional clarinetists to rate using a percentage scale. Overall, whenever there was a ratings difference between the conditions, pieces practiced in the interleaved schedule were rated

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

    Science.gov (United States)

    Carter, Christine E.; Grahn, Jessica A.

    2016-01-01

    Repetition is the most commonly used practice strategy by musicians. Although blocks of repetition continue to be suggested in the pedagogical literature, work in the field of cognitive psychology suggests that repeated events receive less processing, thereby reducing the potential for long-term learning. Motor skill learning and sport psychology research offer an alternative. Instead of using a blocked practice schedule, with practice completed on one task before moving on to the next task, an interleaved schedule can be used, in which practice is frequently alternated between tasks. This frequent alternation involves more effortful processing, resulting in increased long-term learning. The finding that practicing in an interleaved schedule leads to better retention than practicing in a blocked schedule has been labeled the “contextual interference effect.” While the effect has been observed across a wide variety of fields, few studies have researched this phenomenon in a music-learning context, despite the broad potential for application to music practice. This study compared the effects of blocked and interleaved practice schedules on advanced clarinet performance in an ecologically valid context. Ten clarinetists were given one concerto exposition and one technical excerpt to practice in a blocked schedule (12 min per piece) and a second concerto exposition and technical excerpt to practice in an interleaved schedule (3 min per piece, alternating until a total of 12 min of practice were completed on each piece). Participants sight-read the four pieces prior to practice and performed them at the end of practice and again one day later. The sight-reading and two performance run-throughs of each piece were recorded and given to three professional clarinetists to rate using a percentage scale. Overall, whenever there was a ratings difference between the conditions, pieces practiced in the interleaved schedule were rated better than those in the blocked schedule

  13. Combined Admission Control and Scheduling for QoS Differentiation in LTE Uplink

    DEFF Research Database (Denmark)

    Anas, Mohmmad; Rosa, Claudio; Calabrese, Francesco Davide

    2008-01-01

    Long term evolution (LTE) architecture shall support end-to-end quality of service (QoS). For the QoS support and service differentiation it is important that the admission control and packet scheduling functionalities are QoS-aware. In this paper a combined admission control and a decoupled time......-frequency domain scheduling framework for LTE uplink is presented. The proposed framework is shown to effectively differentiate QoS user classes in a mixed traffic scenario....

  14. The Business Change Initiative: A Novel Approach to Improved Cost and Schedule Management

    Science.gov (United States)

    Shinn, Stephen A.; Bryson, Jonathan; Klein, Gerald; Lunz-Ruark, Val; Majerowicz, Walt; McKeever, J.; Nair, Param

    2016-01-01

    Goddard Space Flight Center's Flight Projects Directorate employed a Business Change Initiative (BCI) to infuse a series of activities coordinated to drive improved cost and schedule performance across Goddard's missions. This sustaining change framework provides a platform to manage and implement cost and schedule control techniques throughout the project portfolio. The BCI concluded in December 2014, deploying over 100 cost and schedule management changes including best practices, tools, methods, training, and knowledge sharing. The new business approach has driven the portfolio to improved programmatic performance. The last eight launched GSFC missions have optimized cost, schedule, and technical performance on a sustained basis to deliver on time and within budget, returning funds in many cases. While not every future mission will boast such strong performance, improved cost and schedule tools, management practices, and ongoing comprehensive evaluations of program planning and control methods to refine and implement best practices will continue to provide a framework for sustained performance. This paper will describe the tools, techniques, and processes developed during the BCI and the utilization of collaborative content management tools to disseminate project planning and control techniques to ensure continuous collaboration and optimization of cost and schedule management in the future.

  15. NEW BURST ASSEMBLY AND SCHEDULING TECHNIQUE FOR OPTICAL BURST SWITCHING NETWORKS

    OpenAIRE

    Kavitha, V.; V.Palanisamy

    2013-01-01

    The Optical Burst Switching is a new switching technology that efficiently utilizes the bandwidth in the optical layer. The key areas to be concentrated in Optical Burst Switching (OBS) networks are the burst assembly and burst scheduling i.e., assignment of wavelengths to the incoming bursts. This study presents a New Burst Assembly and Scheduling (NBAS) technique in a simultaneous multipath transmission for burst loss recovery in OBS networks. A Redundant Burst Segmentation (RBS) is used fo...

  16. Explanation of Change Cost and Schedule Growth Study Interim Status Briefing

    Science.gov (United States)

    Croonce, Thomas; Bitten, Bob; Emmons, Debra

    2010-01-01

    This slide presentation reviews the study to understand the changes in cost and schedule growth for NASA projects. A second goal was to determine the percentage of growth that was outside the control of the project. The study examined project documentation, conducted interviews with key project personnel, and allocated growth events to an Explanation of Change (EoC) tree to quantify the reasons for growth in the scheduled time. This briefing reviews the results of the study of the first 20 missions.

  17. Effectiveness of cytopenia prophylaxis for different filgrastim and pegfilgrastim schedules in a chemotherapy mouse model

    Directory of Open Access Journals (Sweden)

    Markus Scholz

    2008-12-01

    Full Text Available Markus Scholz1, Manuela Ackermann2, Frank Emmrich2, Markus Loeffler1, Manja Kamprad21Institute for Medical Informatics, Statistics and Epidemiology, University of Leipzig, Haertelstrasse 16–18, 04107 Leipzig, Germany; 2Institute for Clinical Immunology and Transfusion Medicine, University of Leipzig, Johannisallee 30, 04103 Leipzig, GermanyObjectives: Recombinant human granulocyte colony-stimulating factor (rhG-CSF is widely used to treat neutropenia during cytotoxic chemotherapy. The optimal scheduling of rhG-CSF is unknown and can hardly be tested in clinical studies due to numerous therapy parameters affecting outcome (chemotherapeutic regimen, rhG-CSF schedules, individual covariables. Motivated by biomathematical model simulations, we aim to investigate different rhG-CSF schedules in a preclinical chemotherapy mouse model.Methods: The time course of hematotoxicity was studied in CD-1 mice after cyclophosphamide (CP administration. Filgrastim was applied concomitantly in a 2 × 3-factorial design of two dosing options (2 × 20 μg and 4 × 10 μg and three timing options (directly, one, and two days after CP. Alternatively, a single dose of 40 μg pegfilgrastim was applied at the three timing options. The resulting cytopenia was compared among the schedules.Results: Dosing and timing had a significant influence on the effectiveness of filgrastim schedules whereas for pegfilgrastim the timing effect was irrelevant. The best filgrastim and pegfilgrastim schedules exhibited equivalent toxicity. Monocytes dynamics performed analogously to granulocytes. All schedules showed roughly the same lymphotoxicity.Conclusion: We conclude that effectiveness of filgrastim application depends heavily on its scheduling during chemotherapy. There is an optimum of timing. Dose splitting is better than concentrated applications. Effectiveness of pegfilgrastim is less dependent on timing.Keywords: rhG-CSF, chemotherapy toxicity, mice, cyclophosphamide

  18. Safety Training: scheduled sessions in September and October 2011

    CERN Multimedia

    2011-01-01

    The following training courses are scheduled in September – October. You can find the full Safety Training programme on the Safety Training online catalogue. If you are interested in attending any of the below courses, please talk to your supervisor, then apply electronically via EDH from the course description pages, by clicking on SIGN-UP. Registration for all courses is always open – sessions for the less-requested courses are organized on a demand-basis only. Depending on the demand, a session will be organised later in the year. Alphabetical order (original course titles are maintained) Conduite de chariots élévateurs 17-OCT-11 to 18-OCT-11, 8.00 – 17.30, in French * Ergonomics - Applying ergonomic principles in the workplace 15-SEP-11, 9.00 – 12.30, in French 15-SEP-11, 14.00 – 17.30, in English Habilitation électrique : Personnel électricien effectuant des opérations du domaine de tension BTA...

  19. Safety Training: scheduled sessions in September and October 2011

    CERN Multimedia

    DGS Unit

    2011-01-01

    The following training courses are scheduled in September – October. You can find the full Safety Training programme on the Safety Training online catalogue. If you are interested in attending any of the below courses, please talk to your supervisor, then apply electronically via EDH from the course description pages, by clicking on SIGN-UP. Registration for all courses is always open – sessions for the less-requested courses are organized on a demand-basis only. Depending on the demand, a session will be organised later in the year. Alphabetical order (original course titles are maintained) Chemical Safety – Introduction 11-OCT-11, 9.00 – 11.30, in English Conduite de chariots élévateurs 17-OCT-11 to 18-OCT-11, 8.00 – 17.30, in French * Ergonomics - Applying ergonomic principles in the workplace 15-SEP-11, 9.00 – 12.30, in French 15-SEP-11, 14.00 – 17.30, in English Habilitation électrique : Personne...

  20. Intelligent scheduling of execution for customized physical fitness and healthcare system.

    Science.gov (United States)

    Huang, Chung-Chi; Liu, Hsiao-Man; Huang, Chung-Lin

    2015-01-01

    Physical fitness and health of white collar business person is getting worse and worse in recent years. Therefore, it is necessary to develop a system which can enhance physical fitness and health for people. Although the exercise prescription can be generated after diagnosing for customized physical fitness and healthcare. It is hard to meet individual execution needs for general scheduling of physical fitness and healthcare system. So the main purpose of this research is to develop an intelligent scheduling of execution for customized physical fitness and healthcare system. The results of diagnosis and prescription for customized physical fitness and healthcare system will be generated by fuzzy logic Inference. Then the results of diagnosis and prescription for customized physical fitness and healthcare system will be scheduled and executed by intelligent computing. The scheduling of execution is generated by using genetic algorithm method. It will improve traditional scheduling of exercise prescription for physical fitness and healthcare. Finally, we will demonstrate the advantages of the intelligent scheduling of execution for customized physical fitness and healthcare system.