WorldWideScience

Sample records for schedules and scheduling

  1. Outage scheduling and implementation

    International Nuclear Information System (INIS)

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

    1986-01-01

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

  2. SPANR planning and scheduling

    Science.gov (United States)

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

    2001-07-01

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

  3. Planning and scheduling - A schedule's performance

    International Nuclear Information System (INIS)

    Whitman, N.M.

    1993-01-01

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

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

  5. 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...... as possible to the available staff, while respecting various requirements and rules and while including possible transportation time between tasks. This thesis presents a number of industrial applications in rostering and task scheduling. The applications exist within various contexts in health care....... 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...

  6. Operating Theatre Planning and Scheduling.

    NARCIS (Netherlands)

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

    2012-01-01

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

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

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

  9. Immunization Schedules for Infants and Children

    Science.gov (United States)

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

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

  11. Endogenous scheduling preferences and congestion

    DEFF Research Database (Denmark)

    Fosgerau, Mogens; Small, Kenneth

    2010-01-01

    and leisure, but agglomeration economies at home and at work lead to scheduling preferences forming endogenously. Using bottleneck congestion technology, we obtain an equilibrium queuing pattern consistent with a general version of the Vickrey bottleneck model. However, the policy implications are different....... Compared to the predictions of an analyst observing untolled equilibrium and taking scheduling preferences as exogenous, we find that both the optimal capacity and the marginal external cost of congestion have changed. The benefits of tolling are greater, and the optimal time varying toll is different....

  12. Routing and scheduling problems

    DEFF Research Database (Denmark)

    Reinhardt, Line Blander

    couple of decades. To deliver competitive service and price, transportation today needs to be cost effective. A company requiring for things to be shipped will aim at having the freight shipped as cheaply as possible while often satisfying certain time constraints. For the transportation company......, the effectiveness of the network is of importance aiming at satisfying as many costumer demands as possible at a low cost. Routing represent a path between locations such as an origin and destination for the object routed. Sometimes routing has a time dimension as well as the physical paths. This may...... 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...

  13. Schedule Analytics

    Science.gov (United States)

    2016-04-30

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

  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. Robust and Flexible Scheduling with Evolutionary Computation

    DEFF Research Database (Denmark)

    Jensen, Mikkel T.

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

  18. It Is Not Just about the Schedule: Key Factors in Effective Reference Desk Scheduling and Management

    Science.gov (United States)

    Sciammarella, Susan; Fernandes, Maria Isabel; McKay, Devin

    2008-01-01

    Reference desk scheduling is one of the most challenging tasks in the organizational structure of an academic library. The ability to turn this challenge into a workable and effective function lies with the scheduler and indirectly the cooperation of all librarians scheduled for reference desk service. It is the scheduler's sensitivity to such…

  19. Scheduling the scheduling task : a time management perspective on scheduling

    NARCIS (Netherlands)

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

    2013-01-01

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

  20. Flexible Schedules and Shift Work.

    Science.gov (United States)

    Beers, Thomas M.

    2000-01-01

    Flexible work hours have gained prominence, as more than 25 million workers (27.6% of all full-time workers) can now vary their schedules. However, there has been little change since the mid-1980s in the proportion who work a shift other than a regular daytime shift. (JOW)

  1. Planning and Scheduling of Airline Operations

    Directory of Open Access Journals (Sweden)

    İlkay ORHAN

    2010-02-01

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

  2. Cloud Service Scheduling Algorithm Research and Optimization

    Directory of Open Access Journals (Sweden)

    Hongyan Cui

    2017-01-01

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

  3. A customizable, scalable scheduling and reporting system.

    Science.gov (United States)

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

    2014-06-01

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

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

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

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

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

    NARCIS (Netherlands)

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

    2014-01-01

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

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

  9. PROMSYS, Plant Equipment Maintenance and Inspection Scheduling

    International Nuclear Information System (INIS)

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

    1986-01-01

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

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

  11. Bridging the Gap Between Planning and Scheduling

    Science.gov (United States)

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

    2000-01-01

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

  12. Quantify Risk to Manage Cost and Schedule

    National Research Council Canada - National Science Library

    Raymond, Fred

    1999-01-01

    Too many projects suffer from unachievable budget and schedule goals, caused by unrealistic estimates and the failure to quantify and communicate the uncertainty of these estimates to managers and sponsoring executives...

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

    African Journals Online (AJOL)

    Background: Cancellation of scheduled surgery creates a financial burden for hospitals, caregivers and ..... costs and disregard some of the aspects mentioned in the ..... cancellation of elective surgical procedures in a Spanish general.

  14. Algorithms for classical and modern scheduling problems

    OpenAIRE

    Ott, Sebastian

    2016-01-01

    Subject of this thesis is the design and the analysis of algorithms for scheduling problems. In the first part, we focus on energy-efficient scheduling, where one seeks to minimize the energy needed for processing certain jobs via dynamic adjustments of the processing speed (speed scaling). We consider variations and extensions of the standard model introduced by Yao, Demers, and Shenker in 1995 [79], including the addition of a sleep state, the avoidance of preemption, and variable speed lim...

  15. Integrated Job Scheduling and Network Routing

    DEFF Research Database (Denmark)

    Gamst, Mette; Pisinger, David

    2013-01-01

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

  16. Staffing, overtime, and shift scheduling project

    International Nuclear Information System (INIS)

    Lewis, P.M.

    1989-01-01

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

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

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

  19. Planning and Scheduling for Environmental Sensor Networks

    Science.gov (United States)

    Frank, J. D.

    2005-12-01

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

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

  1. Vehicle and driver scheduling for public transit.

    Science.gov (United States)

    2009-08-01

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

  2. Maternal Nonstandard Work Schedules and Breastfeeding Behaviors.

    Science.gov (United States)

    Zilanawala, Afshin

    2017-06-01

    Objectives Although maternal employment rates have increased in the last decade in the UK, there is very little research investigating the linkages between maternal nonstandard work schedules (i.e., work schedules outside of the Monday through Friday, 9-5 schedule) and breastfeeding initiation and duration, especially given the wide literature citing the health advantages of breastfeeding for mothers and children. Methods This paper uses a population-based, UK cohort study, the Millennium Cohort Study (n = 17,397), to investigate the association between types of maternal nonstandard work (evening, night, away from home overnight, and weekends) and breastfeeding behaviors. Results In unadjusted models, exposure to evening shifts was associated with greater odds of breastfeeding initiation (OR 1.71, CI 1.50-1.94) and greater odds of short (OR 1.55, CI 1.32-1.81), intermediate (OR 2.01, CI 1.64-2.47), prolonged partial duration (OR 2.20, CI 1.78-2.72), and prolonged exclusive duration (OR 1.53, CI 1.29-1.82), compared with mothers who were unemployed and those who work other types of nonstandard shifts. Socioeconomic advantage of mothers working evening schedules largely explained the higher odds of breastfeeding initiation and duration. Conclusions Socioeconomic characteristics explain more breastfeeding behaviors among mothers working evening shifts. Policy interventions to increase breastfeeding initiation and duration should consider the timing of maternal work schedules.

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

  4. Schedule and staffing of a nuclear power project

    International Nuclear Information System (INIS)

    Polliart, A.J.; Csik, B.

    1977-01-01

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

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

  6. Schedule and status of irradiation experiments

    International Nuclear Information System (INIS)

    Rowcliffe, A.F.; Grossbeck, M.L.; Robertson, J.P.

    1998-01-01

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

  7. Immunization Schedules for Adults

    Science.gov (United States)

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

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

  9. Quarterly report on program cost and schedule

    International Nuclear Information System (INIS)

    1989-07-01

    This report is intended to provide a summary of the cost and schedule performance for the Civilian Radioactive Waste Management Program. Performance data are presented for each of the major program elements. Also included in this report is the status of the Nuclear Waste Fund revenues and disbursements. This report includes project performance data reported through March 1989

  10. Algorithms for Scheduling and Network Problems

    Science.gov (United States)

    1991-09-01

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

  11. Project schedule and cost estimate report

    International Nuclear Information System (INIS)

    1988-03-01

    All cost tables represent obligation dollars, at both a constant FY 1987 level and an estimated escalation level, and are based on the FY 1989 DOE Congressional Budget submittal of December 1987. The cost tables display the total UMTRA Project estimated costs, which include both Federal and state funding. The Total Estimated Cost (TEC) for the UMTRA Project is approximately $992.5 million (in 1987 escalated dollars). Project schedules have been developed that provide for Project completion by September 1994, subject to Congressional approval extending DOE's authorization under Public Law 95-604. The report contains site-specific demographic data, conceptual design assumptions, preliminary cost estimates, and site schedules. A general project overview is also presented, which includes a discussion of the basis for the schedule and cost estimates, contingency assumptions, work breakdown structure, and potential project risks. The schedules and cost estimates will be revised as necessary to reflect appropriate decisions relating to relocation of certain tailings piles, or other special design considerations or circumstances (such as revised EPA groundwater standards), and changes in the Project mission. 27 figs', 97 tabs

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

  13. ATD-2 Surface Scheduling and Metering Concept

    Science.gov (United States)

    Coppenbarger, Richard A.; Jung, Yoon Chul; Capps, Richard Alan; Engelland, Shawn A.

    2017-01-01

    This presentation describes the concept of ATD-2 tactical surface scheduling and metering. The concept is composed of several elements, including data exchange and integration; surface modeling; surface scheduling; and surface metering. The presentation explains each of the elements. Surface metering is implemented to balance demand and capacity• When surface metering is on, target times from surface scheduler areconverted to advisories for throttling demand• Through the scheduling process, flights with CTOTs will not get addedmetering delay (avoids potential for ‘double delay’)• Carriers can designate certain flights as exempt from metering holds• Demand throttle in Phase 1 at CLT is through advisories sent to rampcontrollers for pushback instructions to the flight deck– Push now– Hold for an advised period of time (in minutes)• Principles of surface metering can be more generally applied to otherairports in the NAS to throttle demand via spot-release times (TMATs Strong focus on optimal use of airport resources• Flexibility enables stakeholders to vary the amount of delay theywould like transferred to gate• Addresses practical aspects of executing surface metering in aturbulent real world environment• Algorithms designed for both short term demand/capacityimbalances (banks) or sustained metering situations• Leverage automation to enable surface metering capability withoutrequiring additional positions• Represents first step in Tactical/Strategic fusion• Provides longer look-ahead calculations to enable analysis ofstrategic surface metering potential usage

  14. Simultaneous scheduling of machines and mobile robots

    DEFF Research Database (Denmark)

    Dang, Vinh Quang; Nielsen, Izabela Ewa

    2013-01-01

    This paper deals with the problem of simultaneously scheduling machines and a number of autonomous mobile robots in a flexible manufacturing system (FMS). Besides capability of transporting materials between machines, the considered mobile robots are different from other material handling devices...

  15. Production planning and scheduling in refinery industry

    International Nuclear Information System (INIS)

    Persson, Jan.

    1999-01-01

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

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

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

  18. Second-order schedules of token reinforcement with pigeons: effects of fixed- and variable-ratio exchange schedules.

    Science.gov (United States)

    Foster, T A; Hackenberg, T D; Vaidya, M

    2001-09-01

    Pigeons' key pecks produced food under second-order schedules of token reinforcement, with light-emitting diodes serving as token reinforcers. In Experiment 1, tokens were earned according to a fixed-ratio 50 schedule and were exchanged for food according to either fixed-ratio or variable-ratio exchange schedules, with schedule type varied across conditions. In Experiment 2, schedule type was varied within sessions using a multiple schedule. In one component, tokens were earned according to a fixed-ratio 50 schedule and exchanged according to a variable-ratio schedule. In the other component, tokens were earned according to a variable-ratio 50 schedule and exchanged according to a fixed-ratio schedule. In both experiments, the number of responses per exchange was varied parametrically across conditions, ranging from 50 to 400 responses. Response rates decreased systematically with increases in the fixed-ratio exchange schedules, but were much less affected by changes in the variable-ratio exchange schedules. Response rates were consistently higher under variable-ratio exchange schedules than tinder comparable fixed-ratio exchange schedules, especially at higher exchange ratios. These response-rate differences were due both to greater pre-ratio pausing and to lower local rates tinder the fixed-ratio exchange schedules. Local response rates increased with proximity to food under the higher fixed-ratio exchange schedules, indicative of discriminative control by the tokens.

  19. Preemptive scheduling with rejection

    NARCIS (Netherlands)

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

    2003-01-01

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

  20. Preemptive scheduling with rejection

    NARCIS (Netherlands)

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

    2000-01-01

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

  1. Scheduling with Time Lags

    NARCIS (Netherlands)

    X. Zhang (Xiandong)

    2010-01-01

    textabstractScheduling is essential when activities need to be allocated to scarce resources over time. Motivated by the problem of scheduling barges along container terminals in the Port of Rotterdam, this thesis designs and analyzes algorithms for various on-line and off-line scheduling problems

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

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

  4. Analysis and Optimisation of Hierarchically Scheduled Multiprocessor Embedded Systems

    DEFF Research Database (Denmark)

    Pop, Traian; Pop, Paul; Eles, Petru

    2008-01-01

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

  5. OMS event evaluator and scheduler

    Science.gov (United States)

    Eckelkamp, Richard E.

    1990-01-01

    An Operations Management System (OMS) is being designed for Space Station Freedom to improve productivity, reliability, and safety while reducing operations and maintenance costs. Central to the concept is a short term plan containing mixes of man-readable and machine-executable procedures used in an environment of distributed processing and execution. An OMS event evaluator to check upcoming short-term plan events for validity of execution is under development. The first version checks time and resource constraints against operational conditions for current or expected stations. In work are the handling of environmental and other operational constraints, as well as detailed modeling of resources and station operational states. The Ada Program also has the ability to reschedule all or part of the events.

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

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

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

  9. NASA scheduling technologies

    Science.gov (United States)

    Adair, Jerry R.

    1994-01-01

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

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

  11. Preliminary ITER cost and schedule estimates

    International Nuclear Information System (INIS)

    1990-01-01

    The cost, manpower requirements, and schedule estimates for the realization of the ITER tokamak have been studied during the Conceptual Design Activities, as a result of work by the ITER Management Committee. This work was completed during the January-March, 1990 joint work session, and is presented in this report. A possible schedule shows completion of the engineering design phase in 1995, with 180 professionals, at a cost of about $250M. The construction would be completed in 2004 with a rise in professional staff to 300, and a total cost of $4900M. The machine would be operable over an 18-year period, at an annual operating cost averaging $290M. 2 figs

  12. Message Scheduling and Forwarding in Congested DTNs

    KAUST Repository

    Elwhishi, Ahmed; Ho, Pin-Han; Shihada, Basem

    2012-01-01

    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.

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

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

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

    Science.gov (United States)

    Richards, Stephen F.

    1991-01-01

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

  16. Development of preventive maintenance procedures and schedules

    International Nuclear Information System (INIS)

    Schlenker, H.V.; Hammel, J.

    1977-01-01

    An outline of the procedures and schedules developed for preventive maintenance in power stations within the Rheinisch-Westfaelisches Elektrizitaetswerk (RWE) is presented. After an introduction of maintenance in general the different kinds of preventive maintenance activities are described. This includes also the prerequisite identification systems. The aims of preventive maintenance and the measures are explained that have to be taken, if these aims are to be achieved. A number of examples from actual practice are cited. (orig.) [de

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

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

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

    Science.gov (United States)

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

    1986-09-01

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

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

  1. 5 CFR 532.513 - Flexible and compressed work schedules.

    Science.gov (United States)

    2010-01-01

    ... 5 Administrative Personnel 1 2010-01-01 2010-01-01 false Flexible and compressed work schedules... REGULATIONS PREVAILING RATE SYSTEMS Premium Pay and Differentials § 532.513 Flexible and compressed work schedules. Federal Wage System employees who are authorized to work flexible and compressed work schedules...

  2. Parametric Cost and Schedule Modeling for Early Technology Development

    Science.gov (United States)

    2018-04-02

    Research NoteNational Security Rep rt PARAMETRIC MODELING FOR EARLY TECHNOLOGY DEVELOPMENT COST AND SCHEDULE Chuck...Alexander NSR_11x17_Cover_CostModeling_v8.indd 1 11/20/17 3:15 PM PARAMETRIC COST AND SCHEDULE MODELING FOR EARLY  TECHNOLOGY DEVELOPMENT Chuck...COST AND SCHEDULE MODELING FOR EARLY  TECHNOLOGY DEVELOPMENT iii Contents Figures

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

  4. Alternative Work Schedules in Office and Nonoffice Work Settings.

    Science.gov (United States)

    Kirk, Raymond J.; Barton, H. David

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

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

  6. Optimal Algorithms and a PTAS for Cost-Aware Scheduling

    NARCIS (Netherlands)

    L. Chen; N. Megow; R. Rischke; L. Stougie (Leen); J. Verschae

    2015-01-01

    htmlabstractWe consider a natural generalization of classical scheduling problems in which using a time unit for processing a job causes some time-dependent cost which must be paid in addition to the standard scheduling cost. We study the scheduling objectives of minimizing the makespan and the

  7. Scheduling for decommissioning projects

    International Nuclear Information System (INIS)

    Podmajersky, O.E.

    1987-01-01

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

  8. Program reference schedule baseline

    International Nuclear Information System (INIS)

    1986-07-01

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

  9. Scheduling of Irrigation and Leaching Requirements

    Directory of Open Access Journals (Sweden)

    Amer Hassan Al-haddad

    2015-03-01

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

  10. Production Planning and Planting Pattern Scheduling Information System for Horticulture

    Science.gov (United States)

    Vitadiar, Tanhella Zein; Farikhin; Surarso, Bayu

    2018-02-01

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

  11. Freight railway operator timetabling and engine scheduling

    DEFF Research Database (Denmark)

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

    2015-01-01

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

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

    International Nuclear Information System (INIS)

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

    2014-01-01

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

  13. Multiple-Machine Scheduling with Learning Effects and Cooperative Games

    Directory of Open Access Journals (Sweden)

    Yiyuan Zhou

    2015-01-01

    Full Text Available Multiple-machine scheduling problems with position-based learning effects are studied in this paper. There is an initial schedule in this scheduling problem. The optimal schedule minimizes the sum of the weighted completion times; the difference between the initial total weighted completion time and the minimal total weighted completion time is the cost savings. A multiple-machine sequencing game is introduced to allocate the cost savings. The game is balanced if the normal processing times of jobs that are on the same machine are equal and an equal number of jobs are scheduled on each machine initially.

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

    International Nuclear Information System (INIS)

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

    1993-07-01

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

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

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

  17. Constraint-based job shop scheduling with ILOG SCHEDULER

    NARCIS (Netherlands)

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

    1998-01-01

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

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

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

  20. Alternative Work Schedules: Definitions

    Science.gov (United States)

    Journal of the College and University Personnel Association, 1977

    1977-01-01

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

  1. Excellence through outage planning and scheduling

    International Nuclear Information System (INIS)

    Ferriole, G.

    1987-01-01

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

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

  3. MOV reliability evaluation and periodic verification scheduling

    International Nuclear Information System (INIS)

    Bunte, B.D.

    1996-01-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

  4. New plant construction cost and schedule

    International Nuclear Information System (INIS)

    Akins, M. J.

    2009-01-01

    The presentation covers the following topics: cost structure; capital costs; variation of capital costs; trends in power plant construction; studies of costs completion; periods and risks. Nuclear plant costs have recently risen so rapidly that vendors are not willing to publicly commit to cost estimates: ∼ $2000/Kw overnight costs in 2006 in the US market > $4000/Kw and in 2008 in the US market > $6000/Kw in 2008 in emerging markets. There is vendors pricing uncertainty. Current contract models may not apply. Current construction projects have problems: Olkiluoto-3 is reported to be 50% over budget and two years behind schedule, increasing perceptions that nuclear costs will continue to increase rapidly; Price of materials is a big volatile unknown, which may decrease Labor could become more available due to limited number of new projects; Lack of debt/credit to finance new project may decrease demand of new construction

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

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

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

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

  9. Scheduled feeding results in adipogenesis and increased acylated ghrelin

    OpenAIRE

    Verbaeys, I.; Tolle, V.; SWENNEN, Quirine; Zizzari, P.; Buyse, J.; Epelbaum, J.; Cokelaere, M.

    2011-01-01

    Ghrelin, known to stimulate adipogenesis, displays an endogenous secretory rhythmicity closely related to meal patterns. Therefore, a chronic imposed feeding schedule might induce modified ghrelin levels and consequently adiposity. Growing Wistar rats were schedule-fed by imposing a particular fixed feeding schedule of 3 meals/day without caloric restriction compared with total daily control intake. After 14 days, their body composition was measured by DEXA and compared with ad libitum-fed co...

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

  11. NASA Schedule Management Handbook

    Science.gov (United States)

    2011-01-01

    The purpose of schedule management is to provide the framework for time-phasing, resource planning, coordination, and communicating the necessary tasks within a work effort. The intent is to improve schedule management by providing recommended concepts, processes, and techniques used within the Agency and private industry. The intended function of this handbook is two-fold: first, to provide guidance for meeting the scheduling requirements contained in NPR 7120.5, NASA Space Flight Program and Project Management Requirements, NPR 7120.7, NASA Information Technology and Institutional Infrastructure Program and Project Requirements, NPR 7120.8, NASA Research and Technology Program and Project Management Requirements, and NPD 1000.5, Policy for NASA Acquisition. The second function is to describe the schedule management approach and the recommended best practices for carrying out this project control function. With regards to the above project management requirements documents, it should be noted that those space flight projects previously established and approved under the guidance of prior versions of NPR 7120.5 will continue to comply with those requirements until project completion has been achieved. This handbook will be updated as needed, to enhance efficient and effective schedule management across the Agency. It is acknowledged that most, if not all, external organizations participating in NASA programs/projects will have their own internal schedule management documents. Issues that arise from conflicting schedule guidance will be resolved on a case by case basis as contracts and partnering relationships are established. It is also acknowledged and understood that all projects are not the same and may require different levels of schedule visibility, scrutiny and control. Project type, value, and complexity are factors that typically dictate which schedule management practices should be employed.

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

    Science.gov (United States)

    Mills, Melinda; Taht, Kadri

    2010-01-01

    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 that, for women, schedules with varying hours…

  13. Scheduled meals and scheduled palatable snacks synchronize circadian rhythms: consequences for ingestive behavior.

    Science.gov (United States)

    Escobar, Carolina; Salgado, Roberto; Rodriguez, Katia; Blancas Vázquez, Aurea Susana; Angeles-Castellanos, Manuel; Buijs, Ruud M

    2011-09-26

    Food is a potent time signal for the circadian system and has shown to entrain and override temporal signals transmitted by the biological clock, the suprachiasmatic nucleus, which adjusts mainly to the daily light/dark (LD) alternation. Organisms mostly ingest food in their active period and this permits a correct coordination between the LD and the food elicited time signals with the circadian system. Under conditions when feeding opportunities are shifted to the usual resting/sleep phase, the potent entraining force of food, shifts circadian fluctuations in several tissues, organs, and brain structures toward meal time, resulting a desynchrony within the body and between the organism and the external LD cycle. The daily scheduled access to a palatable snack exerts similar changes specifically to brain areas involved in motivation and reward responses. This review describes the phenomenology of food entrainment and entrainment by a palatable snack. It suggests how scheduled feeding can lead to food addiction and how shifted feeding schedules toward the sleep phase can result in altered ingestive behavior, obesity and disturbed metabolic responses. Copyright © 2011 Elsevier Inc. All rights reserved.

  14. Maternal methadone dosing schedule and fetal neurobehavior

    Science.gov (United States)

    Jansson, Lauren M.; DiPietro, Janet A.; Velez, Martha; Elko, Andrea; Knauer, Heather; Kivlighan, Katie T.

    2008-01-01

    Objective Daily methadone maintenance is the standard of care for opiate dependency during pregnancy. Previous research has indicated that single-dose maternal methadone administration significantly suppresses fetal neurobehaviors. The purpose of this study was to determine if split-dosing would have less impact on fetal neurobehavior than single-dose administration. Methods Forty methadone-maintained women were evaluated at peak and trough maternal methadone levels on single- and split-dosing schedules. Monitoring sessions occurred at 36 and 37 weeks gestation in a counterbalanced study design. Fetal measures included heart rate, variability, accelerations, motor activity and fetal movement-heart rate coupling (FM-FHR). Maternal measures included heart period, variability, skin conductance, respiration and vagal tone. Repeated measure analysis of variance was used to evaluate within-subject changes between split- and single-dosing regimens. Results All fetal neurobehavioral parameters were suppressed by maternal methadone administration, regardless of dosing regimen. Fetal parameters at peak were significantly lower during single vs. split methadone administration. FM-FHR coupling was less suppressed from trough to peak during split-dosing vs. single-dosing. Maternal physiologic parameters were generally unaffected by dosing condition. Conclusion Split- dosed fetuses displayed less neurobehavioral suppression from trough to peak maternal methadone levels as compared to single-dosed fetuses. Split-dosing may be beneficial for methadone-maintained pregnant women. PMID:19085624

  15. Exact and Heuristic Algorithms for Runway Scheduling

    Science.gov (United States)

    Malik, Waqar A.; Jung, Yoon C.

    2016-01-01

    This paper explores the Single Runway Scheduling (SRS) problem with arrivals, departures, and crossing aircraft on the airport surface. Constraints for wake vortex separations, departure area navigation separations and departure time window restrictions are explicitly considered. The main objective of this research is to develop exact and heuristic based algorithms that can be used in real-time decision support tools for Air Traffic Control Tower (ATCT) controllers. The paper provides a multi-objective dynamic programming (DP) based algorithm that finds the exact solution to the SRS problem, but may prove unusable for application in real-time environment due to large computation times for moderate sized problems. We next propose a second algorithm that uses heuristics to restrict the search space for the DP based algorithm. A third algorithm based on a combination of insertion and local search (ILS) heuristics is then presented. Simulation conducted for the east side of Dallas/Fort Worth International Airport allows comparison of the three proposed algorithms and indicates that the ILS algorithm performs favorably in its ability to find efficient solutions and its computation times.

  16. DMEPOS Fee Schedule

    Data.gov (United States)

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

  17. Reactor outage schedule (tentative)

    Energy Technology Data Exchange (ETDEWEB)

    Walton, R.P.

    1969-11-01

    This single page document is the November 1, 1969 reactor refueling outage schedule for the Hanford Production Reactor. It also contains data on the amounts and types of fuels to be loaded and relocated in the production reactor.

  18. Reactor outage schedule (tentative)

    Energy Technology Data Exchange (ETDEWEB)

    Walton, R.P.

    1969-10-01

    This single page document is the October 1, 1969 reactor refueling outage schedule for the Hanford Production Reactor. It also contains data on the amounts and types of fuels to be loaded and relocated in the Production Reactor.

  19. Reactor outage schedule (tentative)

    Energy Technology Data Exchange (ETDEWEB)

    Walton, R.P.

    1969-10-15

    This single page document is the October 15, 1969 reactor refueling outage schedule for the Hanford Production Reactor. It also contains data on the amounts and types of fuels to be loaded and relocated in the Production Reactor.

  20. Reactor outage schedule (tentative)

    Energy Technology Data Exchange (ETDEWEB)

    Walton, R.P.

    1969-09-15

    This single page document is the September 15, 1969 reactor refueling outage schedule for the Hanford Production Reactor. It also contains data on the amounts and types of fuels to be loaded and relocated in the Production Reactor.

  1. Reactor outage schedule (tentative)

    Energy Technology Data Exchange (ETDEWEB)

    Walton, R.P.

    1969-12-15

    This single page document is the December 16, 1969 reactor refueling outage schedule for the Hanford Production Reactor. It also contains data on the amounts and types of fuels to be loaded and relocated in the Production reactor.

  2. Reactor outage schedule (tentative)

    Energy Technology Data Exchange (ETDEWEB)

    Walton, R.P.

    1969-12-01

    This single page document is the December 1, 1969 reactor refueling outage schedule for the Hanford Production Reactor. It also contains data on the amounts and types of fuels to be loaded and relocated in the Production reactor.

  3. Maternal Nonstandard Work Schedules and Child Cognitive Outcomes

    Science.gov (United States)

    Han, Wen-Jui

    2005-01-01

    This paper examined associations between mothers' work schedules and children's cognitive outcomes in the first 3 years of life for approximately 900 children from the National Institute of Child Health and Human Development Study of Early Child Care. Both the timing and duration of maternal nonstandard work schedules were examined. Although…

  4. 77 FR 53921 - Records Schedules; Availability and Request for Comments

    Science.gov (United States)

    2012-09-04

    ... after the agency no longer needs them to conduct its business. Some schedules are comprehensive and... records or indicates agency- wide applicability in the case of schedules that cover records that may be..., sustainability reports and plans, and historically significant incident response files. 7. Department of the...

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

    DEFF Research Database (Denmark)

    Pop, Paul

    2000-01-01

    on aspects of scheduling and communication for embedded real-time systems. Special emphasis has been placed on the impact of the communication infrastructure and protocol on the overall system performance. The scheduling and communication strategies proposed are based on an abstract graph representation...

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

  7. Decentralized Ground Staff Scheduling

    DEFF Research Database (Denmark)

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

    2002-01-01

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

  8. Scheduling and Topology Design in Networks with Directional Antennas

    Science.gov (United States)

    2017-05-19

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

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

  10. Simultaneous optimization of planning and scheduling in an oil refinery

    NARCIS (Netherlands)

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

    2011-01-01

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

  11. CERN confirms LHC schedule

    CERN Document Server

    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.

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

  13. Project Schedule Simulation

    DEFF Research Database (Denmark)

    Mizouni, Rabeb; Lazarova-Molnar, Sanja

    2015-01-01

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

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

    Science.gov (United States)

    2010-01-01

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

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

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

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

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

  19. Scheduling techniques in the Request Oriented Scheduling Engine (ROSE)

    Science.gov (United States)

    Zoch, David R.

    1991-01-01

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

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

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

  2. Scheduling and recording of reactor maintenance and testing by computer

    International Nuclear Information System (INIS)

    Gray, P.L.

    1975-01-01

    The use of a computer program, Maintenance Information and Control (MIAC), at the Savannah River Laboratory (SRL) assists a small operating staff in maintaining three research reactors and a subcritical facility. The program schedules and defines preventive maintenance, schedules required periodic tests, logs repair and cost information, specifies custodial and service responsibilities, and provides equipment maintenance history, all with a minimum of record-keeping

  3. Engineering schedule control of nuclear power project planning and management

    International Nuclear Information System (INIS)

    Meng Hao

    2014-01-01

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

  4. Understanding the costs and schedule of hydroelectric projects

    International Nuclear Information System (INIS)

    Merrow, E.W.; Schroeder, B.R.

    1991-01-01

    This paper is based on a study conducted for the World Bank which evaluated the feasibility of developing an empirically based ex ante project analysis system for hydroelectric projects. The system would be used to assess: the reasonableness of engineering-based cost and schedule estimates used for project appraisal and preliminary estimates used to select projects for appraisal; and the potential for cost growth and schedule slip. The system would help identify projects early in the project appraisal process that harbor significantly higher than normal risks of overrunning cost and schedule estimates

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

  6. Schedulability analysis for systems with data and control dependencies

    DEFF Research Database (Denmark)

    Pop, Paul; Eles, Petru; Peng, Zebo

    2000-01-01

    Is this paper we present an approach to schedulability analysis for hard real-time systems with control and data dependencies. We consider distributed architectures consisting of multiple programmable processors, and the scheduling policy is based on a static priority preemptive strategy! Our model...... of the system captures bath data and control dependencies, and the schedulability approach is able to reduce the pessimism of the analysis by using the knowledge about control ann data dependencies. Extensive experiments as well as a real life example demonstrate the efficiency of our approach....

  7. Automated Planning and Scheduling for Planetary Rover Distributed Operations

    Science.gov (United States)

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

    1999-01-01

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

  8. The Simultaneous Vehicle Scheduling and Passenger Service Problem

    DEFF Research Database (Denmark)

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

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

  9. Constraint-based scheduling

    Science.gov (United States)

    Zweben, Monte

    1993-01-01

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

  10. Condition-based maintenance at both scheduled and unscheduled opportunities

    NARCIS (Netherlands)

    Kalosi, S.; Kapodistria, S.; Resing, J.A.C.

    2016-01-01

    Motivated by original equipment manufacturer (OEM) service and maintenance practices we consider a single component subject to replacements at failure instances and two types of preventive maintenance opportunities: scheduled, which occur due to periodic system reviews of the equipment, and

  11. Computer-aided resource planning and scheduling for radiological services

    Science.gov (United States)

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

    1996-05-01

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

  12. Planning and Scheduling for Fleets of Earth Observing Satellites

    Science.gov (United States)

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

    2001-01-01

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

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

  14. Automated Planning and Scheduling for Space Mission Operations

    Science.gov (United States)

    Chien, Steve; Jonsson, Ari; Knight, Russell

    2005-01-01

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

  15. SIMULTANEOUS SCHEDULING AND OPERATIONAL OPTIMIZATION OF MULTIPRODUCT, CYCLIC CONTINUOUS PLANTS

    Directory of Open Access Journals (Sweden)

    A. Alle

    2002-03-01

    Full Text Available The problems of scheduling and optimization of operational conditions in multistage, multiproduct continuous plants with intermediate storage are simultaneously addressed. An MINLP model, called TSPFLOW, which is based on the TSP formulation for product sequencing, is proposed to schedule the operation of such plants. TSPFLOW yields a one-order-of-magnitude CPU time reduction as well as the solution of instances larger than those formerly reported (Pinto and Grossmann, 1994. Secondly, processing rates and yields are introduced as additional optimization variables in order to state the simultaneous problem of scheduling with operational optimization. Results show that trade-offs are very complex and that the development of a straightforward (rule of thumb method to optimally schedule the operation is less effective than the proposed approach.

  16. SIMULTANEOUS SCHEDULING AND OPERATIONAL OPTIMIZATION OF MULTIPRODUCT, CYCLIC CONTINUOUS PLANTS

    Directory of Open Access Journals (Sweden)

    Alle A.

    2002-01-01

    Full Text Available The problems of scheduling and optimization of operational conditions in multistage, multiproduct continuous plants with intermediate storage are simultaneously addressed. An MINLP model, called TSPFLOW, which is based on the TSP formulation for product sequencing, is proposed to schedule the operation of such plants. TSPFLOW yields a one-order-of-magnitude CPU time reduction as well as the solution of instances larger than those formerly reported (Pinto and Grossmann, 1994. Secondly, processing rates and yields are introduced as additional optimization variables in order to state the simultaneous problem of scheduling with operational optimization. Results show that trade-offs are very complex and that the development of a straightforward (rule of thumb method to optimally schedule the operation is less effective than the proposed approach.

  17. NRC comprehensive records disposition schedule

    International Nuclear Information System (INIS)

    1982-07-01

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

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

  19. Flexible Working and Couples' Coordination of Time Schedules

    OpenAIRE

    Bryan, Mark L.; Sevilla Sanz, Almudena

    2014-01-01

    Using previously unexploited data on time scheduling in the employment and household contexts, we investigate the effect of flexible working on couples' coordination of their daily work time schedules in the UK. We consider three distinct dimensions of flexible working: flexibility of daily start and finish times (flexitime), flexibility of work times over the year (annualised hours), and generalised control of working hours. We find that in couples with flexitime there is greater spouse sync...

  20. Distributed Scheduling in Time Dependent Environments: Algorithms and Analysis

    OpenAIRE

    Shmuel, Ori; Cohen, Asaf; Gurewitz, Omer

    2017-01-01

    Consider the problem of a multiple access channel in a time dependent environment with a large number of users. In such a system, mostly due to practical constraints (e.g., decoding complexity), not all users can be scheduled together, and usually only one user may transmit at any given time. Assuming a distributed, opportunistic scheduling algorithm, we analyse the system's properties, such as delay, QoS and capacity scaling laws. Specifically, we start with analyzing the performance while \\...

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

  2. Estimating exponential scheduling preferences

    DEFF Research Database (Denmark)

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

    2015-01-01

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

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

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

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

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

  7. Review of job shop scheduling research and its new perspectives under Industry 4.0

    OpenAIRE

    Zhang, Jian; Ding, Guofu; Zou, Yisheng; Qin, Sheng-feng; Fu, Jianlin

    2017-01-01

    Traditional job shop scheduling is concentrated on centralized scheduling or semi-distributed scheduling. Under the Industry 4.0, the scheduling should deal with a smart and distributed manufacturing system supported by novel and emerging manufacturing technologies such as mass customization, Cyber-Physics Systems, Digital Twin, and SMAC (Social, Mobile, Analytics, Cloud). The scheduling research needs to shift its focus to smart distributed scheduling modeling and optimization. In order to t...

  8. Hybrid job shop scheduling

    NARCIS (Netherlands)

    Schutten, Johannes M.J.

    1995-01-01

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

  9. Practical job shop scheduling

    NARCIS (Netherlands)

    Schutten, Johannes M.J.

    1998-01-01

    The Shifting Bottleneck procedure is an intuitive and reasonably good approximation algorithm for the notoriously difficult classical job shop scheduling problem. The principle of decomposing a classical job shop problem into a series of single-machine problems can also easily be applied to job shop

  10. "Creative" Work Schedules.

    Science.gov (United States)

    Blai, Boris

    Many creative or flexible work scheduling options are becoming available to the many working parents, students, handicapped persons, elderly individuals, and others who are either unable or unwilling to work a customary 40-hour work week. These options may be broadly categorized as either restructured or reduced work time options. The three main…

  11. CMS multicore scheduling strategy

    International Nuclear Information System (INIS)

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

    2014-01-01

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

  12. Approximating Preemptive Stochastic Scheduling

    OpenAIRE

    Megow Nicole; Vredeveld Tjark

    2009-01-01

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

  13. Revisiting Symbiotic Job Scheduling

    OpenAIRE

    Eyerman , Stijn; Michaud , Pierre; Rogiest , Wouter

    2015-01-01

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

  14. Genetic algorithm to solve the problems of lectures and practicums scheduling

    Science.gov (United States)

    Syahputra, M. F.; Apriani, R.; Sawaluddin; Abdullah, D.; Albra, W.; Heikal, M.; Abdurrahman, A.; Khaddafi, M.

    2018-02-01

    Generally, the scheduling process is done manually. However, this method has a low accuracy level, along with possibilities that a scheduled process collides with another scheduled process. When doing theory class and practicum timetable scheduling process, there are numerous problems, such as lecturer teaching schedule collision, schedule collision with another schedule, practicum lesson schedules that collides with theory class, and the number of classrooms available. In this research, genetic algorithm is implemented to perform theory class and practicum timetable scheduling process. The algorithm will be used to process the data containing lists of lecturers, courses, and class rooms, obtained from information technology department at University of Sumatera Utara. The result of scheduling process using genetic algorithm is the most optimal timetable that conforms to available time slots, class rooms, courses, and lecturer schedules.

  15. Perceptions of randomized security schedules.

    Science.gov (United States)

    Scurich, Nicholas; John, Richard S

    2014-04-01

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

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

    NARCIS (Netherlands)

    Leeftink, Gréanne; Hans, Erwin W.

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

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

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

    DEFF Research Database (Denmark)

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

    of their demand in advance. However, the detailed requirements of these contract cargoes can be subject to ongoing changes, e.g. the destination port can be altered. For tramp operators, a main concern is therefore the efficient and continuous planning of routes and schedules for the individual ships. Due...... 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...

  19. Algorithm of composing the schedule of construction and installation works

    Science.gov (United States)

    Nehaj, Rustam; Molotkov, Georgij; Rudchenko, Ivan; Grinev, Anatolij; Sekisov, Aleksandr

    2017-10-01

    An algorithm for scheduling works is developed, in which the priority of the work corresponds to the total weight of the subordinate works, the vertices of the graph, and it is proved that for graphs of the tree type the algorithm is optimal. An algorithm is synthesized to reduce the search for solutions when drawing up schedules of construction and installation works, allocating a subset with the optimal solution of the problem of the minimum power, which is determined by the structure of its initial data and numerical values. An algorithm for scheduling construction and installation work is developed, taking into account the schedule for the movement of brigades, which is characterized by the possibility to efficiently calculate the values of minimizing the time of work performance by the parameters of organizational and technological reliability through the use of the branch and boundary method. The program of the computational algorithm was compiled in the MatLAB-2008 program. For the initial data of the matrix, random numbers were taken, uniformly distributed in the range from 1 to 100. It takes 0.5; 2.5; 7.5; 27 minutes to solve the problem. Thus, the proposed method for estimating the lower boundary of the solution is sufficiently accurate and allows efficient solution of the minimax task of scheduling construction and installation works.

  20. The Single And Multi Project Approach To Planning And Scheduling

    DEFF Research Database (Denmark)

    Andersson, Niclas

    2008-01-01

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

  1. Optimal Time-Abstract Schedulers for CTMDPs and Markov Games

    Directory of Open Access Journals (Sweden)

    Markus Rabe

    2010-06-01

    Full Text Available We study time-bounded reachability in continuous-time Markov decision processes for time-abstract scheduler classes. Such reachability problems play a paramount role in dependability analysis and the modelling of manufacturing and queueing systems. Consequently, their analysis has been studied intensively, and techniques for the approximation of optimal control are well understood. From a mathematical point of view, however, the question of approximation is secondary compared to the fundamental question whether or not optimal control exists. We demonstrate the existence of optimal schedulers for the time-abstract scheduler classes for all CTMDPs. Our proof is constructive: We show how to compute optimal time-abstract strategies with finite memory. It turns out that these optimal schedulers have an amazingly simple structure---they converge to an easy-to-compute memoryless scheduling policy after a finite number of steps. Finally, we show that our argument can easily be lifted to Markov games: We show that both players have a likewise simple optimal strategy in these more general structures.

  2. 2007 Wholesale Power Rate Schedules : 2007 General Rate Schedule Provisions.

    Energy Technology Data Exchange (ETDEWEB)

    United States. Bonneville Power Administration.

    2006-11-01

    This schedule is available for the contract purchase of Firm Power to be used within the Pacific Northwest (PNW). Priority Firm (PF) Power may be purchased by public bodies, cooperatives, and Federal agencies for resale to ultimate consumers, for direct consumption, and for Construction, Test and Start-Up, and Station Service. Rates in this schedule are in effect beginning October 1, 2006, and apply to purchases under requirements Firm Power sales contracts for a three-year period. The Slice Product is only available for public bodies and cooperatives who have signed Slice contracts for the FY 2002-2011 period. Utilities participating in the Residential Exchange Program (REP) under Section 5(c) of the Northwest Power Act may purchase Priority Firm Power pursuant to the Residential Exchange Program. Rates under contracts that contain charges that escalate based on BPA's Priority Firm Power rates shall be based on the three-year rates listed in this rate schedule in addition to applicable transmission charges. This rate schedule supersedes the PF-02 rate schedule, which went into effect October 1, 2001. Sales under the PF-07 rate schedule are subject to BPA's 2007 General Rate Schedule Provisions (2007 GRSPs). Products available under this rate schedule are defined in the 2007 GRSPs. For sales under this rate schedule, bills shall be rendered and payments due pursuant to BPA's 2007 GRSPs and billing process.

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

  4. The triangle scheduling problem

    NARCIS (Netherlands)

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

    2017-01-01

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

  5. Sport Tournament Automated Scheduling System

    OpenAIRE

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

    2018-01-01

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

  6. Parental nonstandard work schedules during infancy and children's BMI trajectories

    Directory of Open Access Journals (Sweden)

    Afshin Zilanawala

    2017-09-01

    Full Text Available Background: Empirical evidence has demonstrated adverse associations between parental nonstandard work schedules (i.e., evenings, nights, or weekends and child developmental outcomes. However, there are mixed findings concerning the relationship between parental nonstandard employment and children's body mass index (BMI, and few studies have incorporated information on paternal work schedules. Objective: This paper investigated BMI trajectories from early to middle childhood (ages 3-11 by parental work schedules at 9 months of age, using nationally representative cohort data from the United Kingdom. This study is the first to examine the link between nonstandard work schedules and children's BMI in the United Kingdom. Methods: We used data from the Millennium Cohort Study (2001‒2013, n = 13,021 to estimate trajectories in BMI, using data from ages 3, 5, 7, and 11 years. Joint parental work schedules and a range of biological, socioeconomic, and psychosocial covariates were assessed in the initial interviews at 9 months. Results: Compared to children in two-parent families where parents worked standard shifts, we found steeper BMI growth trajectories for children in two-parent families where both parents worked nonstandard shifts and children in single-parent families whose mothers worked a standard shift. Fathers' shift work, compared to standard shifts, was independently associated with significant increases in BMI. Conclusions: Future public health initiatives focused on reducing the risk of rapid BMI gain in childhood can potentially consider the disruptions to family processes resulting from working nonstandard hours. Contribution: Children in families in which both parents work nonstandard schedules had steeper BMI growth trajectories across the first decade of life. Fathers' nonstandard shifts were independently associated with increases in BMI.

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

  8. Tramp ship routing and scheduling with integrated bunker optimization

    DEFF Research Database (Denmark)

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

    2014-01-01

    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...... and scheduling phase and present a mixed integer programming formulation for the integrated problem of optimally routing, scheduling and bunkering a tramp fleet. Aside from the integration of bunker, this model also extends standard tramp formulations by using load dependent costs, speed and bunker consumption...

  9. FMEF Electrical single line diagram and panel schedule verification process

    International Nuclear Information System (INIS)

    Fong, S.K.

    1998-01-01

    Since the FMEF did not have a mission, a formal drawing verification program was not developed, however, a verification process on essential electrical single line drawings and panel schedules was established to benefit the operations lock and tag program and to enhance the electrical safety culture of the facility. The purpose of this document is to provide a basis by which future landlords and cognizant personnel can understand the degree of verification performed on the electrical single lines and panel schedules. It is the intent that this document be revised or replaced by a more formal requirements document if a mission is identified for the FMEF

  10. NRC comprehensive records disposition schedule

    International Nuclear Information System (INIS)

    1992-03-01

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

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

  12. 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......Passengers using public transport systems often experience waiting times when transferring between two scheduled services. In this paper we propose a planning approach that seeks to obtain a favourable trade-off between the two contrasting objectives, passenger service and operating cost...

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

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

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

    International Nuclear Information System (INIS)

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

    1994-01-01

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

  16. Brokdorf nuclear power station: Construction scheduling and deadline control

    International Nuclear Information System (INIS)

    Lembcke, U.D.F.

    1986-01-01

    Scheduling, especially deadline control, for all installations of the Brokdorf nuclear power station was carried out centrally by the Project Management of Kraftwerk Union AG. 130 timetables encompassing some 13,000 activities were handled, which were interconnected and linked to 189 timetables (approx. 18,000 activities) from various specialized sections by means of data processing systems. Much space in time scheduling was taken by controls of software processing, especially of the preliminary inspection documents in the piping sector and of working documents for construction management in the control systems area. (orig.) [de

  17. Location-based Scheduling

    DEFF Research Database (Denmark)

    Andersson, Niclas; Christensen, Knud

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

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

    Science.gov (United States)

    Richards, Stephen F.

    1992-01-01

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

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

  20. Estimating exponential scheduling preferences

    DEFF Research Database (Denmark)

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

    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 cong......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...... from the underlying scheduling preferences (Noland and Small, 1995, Bates et al., 2001, Fosgerau and Karlström, 2010). The scheduling preferences can be formally represented as time-dependent rates of utility derived at different locations. Assuming that the travellers are rational and choose departure......’ departure time choice. The assumption underlying the scheduling approach is that the traveller rationally maximises her total utility obtained during a period of time. The total utility depends on time of departure from the origin and time of arrival to the destination. The total utility is usually assumed...

  1. Modelling altered fractionation schedules

    International Nuclear Information System (INIS)

    Fowler, J.F.

    1993-01-01

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

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

    OpenAIRE

    Bożek Andrzej; Wysocki Marian

    2016-01-01

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

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

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

    NARCIS (Netherlands)

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

    2010-01-01

    textabstractAbstract: 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

  5. Research and Applications of Shop Scheduling Based on Genetic Algorithms

    Directory of Open Access Journals (Sweden)

    Hang ZHAO

    Full Text Available ABSTRACT Shop Scheduling is an important factor affecting the efficiency of production, efficient scheduling method and a research and application for optimization technology play an important role for manufacturing enterprises to improve production efficiency, reduce production costs and many other aspects. Existing studies have shown that improved genetic algorithm has solved the limitations that existed in the genetic algorithm, the objective function is able to meet customers' needs for shop scheduling, and the future research should focus on the combination of genetic algorithm with other optimized algorithms. In this paper, in order to overcome the shortcomings of early convergence of genetic algorithm and resolve local minimization problem in search process,aiming at mixed flow shop scheduling problem, an improved cyclic search genetic algorithm is put forward, and chromosome coding method and corresponding operation are given.The operation has the nature of inheriting the optimal individual ofthe previous generation and is able to avoid the emergence of local minimum, and cyclic and crossover operation and mutation operation can enhance the diversity of the population and then quickly get the optimal individual, and the effectiveness of the algorithm is validated. Experimental results show that the improved algorithm can well avoid the emergency of local minimum and is rapid in convergence.

  6. 78 FR 18630 - Records Schedules; Availability and Request for Comments

    Science.gov (United States)

    2013-03-27

    ... what happens to records when no longer needed for current Government business. They authorize the... them to conduct its business. Some schedules are comprehensive and cover all the records of an agency..., and the American Recovery and Reinvestment Act. 2. Department of Defense, Defense Intelligence Agency...

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

    African Journals Online (AJOL)

    International Journal of Engineering, Science and Technology ... management decisions related to production scheduling and investment planning. ... and indicate the value of promoting an information culture in the entire work forces. ... to support decision making in a BPR (Business Processes Re-engineering) scenario.

  8. Working Less and Enjoying It More: Alternative Work Schedules.

    Science.gov (United States)

    Shanks, Katherine

    1984-01-01

    Explores three forms of alternative work schedules that research has shown improve job performance and decrease absenteeism: flextime (starting and stopping times vary within limits); permanent part-time employment (regular employment carried out during shorter working hours); and job sharing (two or more part-time employees share one full-time…

  9. 76 FR 59446 - Records Schedules; Availability and Request for Comments

    Science.gov (United States)

    2011-09-26

    ... management, banking and investment, event planning, library management, and financial planning files. 5... what happens to records when no longer needed for current Government business. They authorize the... needs them to conduct its business. Some schedules are comprehensive and cover all the records of an...

  10. Baseline development, economic risk, and schedule risk: An integrated approach

    International Nuclear Information System (INIS)

    Tonkinson, J.A.

    1994-01-01

    The economic and schedule risks of Environmental Restoration (ER) projects are commonly analyzed toward the end of the baseline development process. Risk analysis is usually performed as the final element of the scheduling or estimating processes for the purpose of establishing cost and schedule contingency. However, there is an opportunity for earlier assessment of risks, during development of the technical scope and Work Breakdown Structure (WBS). Integrating the processes of risk management and baselining provides for early incorporation of feedback regarding schedule and cost risk into the proposed scope of work. Much of the information necessary to perform risk analysis becomes available during development of the technical baseline, as the scope of work and WBS are being defined. The analysis of risk can actually be initiated early on during development of the technical baseline and continue throughout development of the complete project baseline. Indeed, best business practices suggest that information crucial to the success of a project be analyzed and incorporated into project planning as soon as it is available and usable

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

  12. 76 FR 71079 - Records Schedules; Availability and Request for Comments

    Science.gov (United States)

    2011-11-16

    ... including documentation on ethics training and guidance received by staff. 25. Social Security... year Federal agencies create billions of records on paper, film, magnetic tape, and other media. To... include records proposed as permanent. The schedules listed in this notice are media neutral unless...

  13. 76 FR 20718 - Records Schedules; Availability and Request for Comments

    Science.gov (United States)

    2011-04-13

    ...: You may request a copy of any records schedule identified in this notice by contacting the Life Cycle... request. FOR FURTHER INFORMATION CONTACT: Laurence Brewer, Director, Life Cycle Management Division (NWML..., rosters, test scores, student awards, and disciplinary documents. 11. Department of Housing and Urban...

  14. Ship routing and scheduling: the cart before the horse conjecture

    DEFF Research Database (Denmark)

    Psaraftis, Harilaos N.

    2017-01-01

    The literature on ship routing and scheduling has grown substantially over the last few decades, with many papers authored by top experts in this area and examining various versions of the problem. Many publication outlets have hosted these papers, with a broad variety of problem formulations, so...

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

  16. Scheduling admissions and reducing variation in bed demand

    NARCIS (Netherlands)

    Bekker, R.; Out, P.

    2011-01-01

    Variability in admissions and lengths of stay inherently leads to variability in bed occupancy. The aim of this paper is to analyse the impact of these sources of variability on the required amount of capacity and to determine admission quota for scheduled admissions to regulate the occupancy

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

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

    African Journals Online (AJOL)

    This paper was originally presented at the Water Research. Commission 40-Year .... direct link with dry matter production (Tanner and Sinclair,. 1983). Scheduling ..... type infrared thermometer for measuring canopy temperature received much ..... subscribers and advice was made available through web down- loads for ...

  19. 77 FR 70835 - Records Schedules; Availability and Request for Comments

    Science.gov (United States)

    2012-11-27

    ... what happens to records when no longer needed for current Government business. They authorize the... them to conduct its business. Some schedules are comprehensive and cover all the records of an agency...-0478-2012-0002, 2 items, 2 temporary items). Training manuals, syllabi, textbooks, and other materials...

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

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

    Science.gov (United States)

    2012-06-21

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

  2. 78 FR 48722 - Records Schedules; Availability and Request for Comments

    Science.gov (United States)

    2013-08-09

    ... instructions on what happens to records when no longer needed for current Government business. They authorize... after the agency no longer needs them to conduct its business. Some schedules are comprehensive and... temporary items). Records related to agency-wide succession management planning programs, including...

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

  4. The Lot Sizing and Scheduling of Sand Casting Operations

    NARCIS (Netherlands)

    Hans, Elias W.; van de Velde, S.L.; van de Velde, Steef

    2011-01-01

    We describe a real world case study that involves the monthly planning and scheduling of the sand-casting department in a metal foundry. The problem can be characterised as a single-level multi-item capacitated lot-sizing model with a variety of additional process-specific constraints. The main

  5. Flexible ship loading problem with transfer vehicle assignment and scheduling

    DEFF Research Database (Denmark)

    Iris, Çağatay; Christensen, Jonas; Pacino, Dario

    2018-01-01

    This paper presents the flexible containership loading problem for seaport container terminals. The integrated management of loading operations, planning of the transport vehicles to use and their scheduling is what we define as the Flexible Ship Loading Problem (FSLP). The flexibility comes from...

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

    NARCIS (Netherlands)

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

    2007-01-01

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

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

  8. Decentralization and mechanism design for online machine scheduling

    NARCIS (Netherlands)

    Arge, Lars; Heydenreich, Birgit; Müller, Rudolf; Freivalds, Rusins; Uetz, Marc Jochen

    We study the online version of the classical parallel machine scheduling problem to minimize the total weighted completion time from a new perspective: We assume that the data of each job, namely its release date $r_j$, its processing time $p_j$ and its weight $w_j$ is only known to the job itself,

  9. Verification and Optimization of a PLC Control Schedule

    NARCIS (Netherlands)

    Brinksma, Hendrik; Mader, Angelika H.; Havelund, K.; Penix, J.; Visser, W.

    We report on the use of the SPIN model checker for both the verification of a process control program and the derivation of optimal control schedules. This work was carried out as part of a case study for the EC VHS project (Verification of Hybrid Systems), in which the program for a Programmable

  10. Human Schedule Performance, Protocol Analysis, and the "Silent Dog" Methodology

    Science.gov (United States)

    Cabello, Francisco; Luciano, Carmen; Gomez, Inmaculada; Barnes-Holmes, Dermot

    2004-01-01

    The purpose of the current experiment was to investigate the role of private verbal behavior on the operant performances of human adults, using a protocol analysis procedure with additional methodological controls (the "silent dog" method). Twelve subjects were exposed to fixed ratio 8 and differential reinforcement of low rate 3-s schedules. For…

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

    OpenAIRE

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

    2017-01-01

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

  12. Optimal Residential Load Scheduling Under Utility and Rooftop Photovoltaic Units

    Directory of Open Access Journals (Sweden)

    Ghulam Hafeez

    2018-03-01

    Full Text Available With the rapid advancement in technology, electrical energy consumption is increasing rapidly. Especially, in the residential sector, more than 80% of electrical energy is being consumed because of consumer negligence. This brings the challenging task of maintaining the balance between the demand and supply of electric power. In this paper, we focus on the problem of load balancing via load scheduling under utility and rooftop photovoltaic (PV units to reduce electricity cost and peak to average ratio (PAR in demand-side management. For this purpose, we adopted genetic algorithm (GA, binary particle swarm optimization (BPSO, wind-driven optimization (WDO, and our proposed genetic WDO (GWDO algorithm, which is a hybrid of GA and WDO, to schedule the household load. For energy cost estimation, combined real-time pricing (RTP and inclined block rate (IBR were used. The proposed algorithm shifts load from peak consumption hours to off-peak hours based on combined pricing scheme and generation from rooftop PV units. Simulation results validate our proposed GWDO algorithm in terms of electricity cost and PAR reduction while considering all three scenarios which we have considered in this work: (1 load scheduling without renewable energy sources (RESs and energy storage system (ESS, (2 load scheduling with RESs, and (3 load scheduling with RESs and ESS. Furthermore, our proposed scheme reduced electricity cost and PAR by 22.5% and 29.1% in scenario 1, 47.7% and 30% in scenario 2, and 49.2% and 35.4% in scenario 3, respectively, as compared to unscheduled electricity consumption.

  13. Flexible Work Schedules. ERIC Digest.

    Science.gov (United States)

    Kerka, Sandra

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

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

    Science.gov (United States)

    Kullberg, Anna; Bergenmar, Mia; Sharp, Lena

    2016-05-01

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

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

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

  17. Joint optimization of production scheduling and machine group preventive maintenance

    International Nuclear Information System (INIS)

    Xiao, Lei; Song, Sanling; Chen, Xiaohui; Coit, David W.

    2016-01-01

    Joint optimization models were developed combining group preventive maintenance of a series system and production scheduling. In this paper, we propose a joint optimization model to minimize the total cost including production cost, preventive maintenance cost, minimal repair cost for unexpected failures and tardiness cost. The total cost depends on both the production process and the machine maintenance plan associated with reliability. For the problems addressed in this research, any machine unavailability leads to system downtime. Therefore, it is important to optimize the preventive maintenance of machines because their performance impacts the collective production processing associated with all machines. Too lengthy preventive maintenance intervals may be associated with low scheduled machine maintenance cost, but may incur expensive costs for unplanned failure due to low machine reliability. Alternatively, too frequent preventive maintenance activities may achieve the desired high reliability machines, but unacceptably high scheduled maintenance cost. Additionally, product scheduling plans affect tardiness and maintenance cost. Two results are obtained when solving the problem; the optimal group preventive maintenance interval for machines, and the assignment of each job, including the corresponding start time and completion time. To solve this non-deterministic polynomial-time problem, random keys genetic algorithms are used, and a numerical example is solved to illustrate the proposed model. - Highlights: • Group preventive maintenance (PM) planning and production scheduling are jointed. • Maintenance interval and assignment of jobs are decided by minimizing total cost. • Relationships among system age, PM, job processing time are quantified. • Random keys genetic algorithms (GA) are used to solve the NP-hard problem. • Random keys GA and Particle Swarm Optimization (PSO) are compared.

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

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

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

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

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

  3. Practical principles in appointment scheduling

    NARCIS (Netherlands)

    Kuiper, A.; Mandjes, M.

    2015-01-01

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

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

  5. Economic Benefit from Progressive Integration of Scheduling and Control for Continuous Chemical Processes

    Directory of Open Access Journals (Sweden)

    Logan D. R. Beal

    2017-12-01

    Full Text Available Performance of integrated production scheduling and advanced process control with disturbances is summarized and reviewed with four progressive stages of scheduling and control integration and responsiveness to disturbances: open-loop segregated scheduling and control, closed-loop segregated scheduling and control, open-loop scheduling with consideration of process dynamics, and closed-loop integrated scheduling and control responsive to process disturbances and market fluctuations. Progressive economic benefit from dynamic rescheduling and integrating scheduling and control is shown on a continuously stirred tank reactor (CSTR benchmark application in closed-loop simulations over 24 h. A fixed horizon integrated scheduling and control formulation for multi-product, continuous chemical processes is utilized, in which nonlinear model predictive control (NMPC and continuous-time scheduling are combined.

  6. Time and Identity: Socializing Schedules and the Implications for Community

    OpenAIRE

    Kattan, Shlomy

    2008-01-01

    This article analyzes data collected as part of an ethnography of three families of Israeli emissaries (shlichim) in order to explore the relationship between the individual, the schedules to which s/he adheres, and her/his affiliation with a particular collective. The paper examines the relationship between time, community, and self through a discourse analytic lens that draws on approaches to the study of cultural identity which look to tension as definitive of groups and their members. It ...

  7. Resource Efficient Scheduling, Optimization and Control.

    NARCIS (Netherlands)

    van den Akker, Marjan; 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

  8. Crop evapotranspiration and irrigation scheduling in blueberry

    Science.gov (United States)

    There are currently 139,000 ha of blueberry worldwide, including 66,000 ha of highbush [comprises northern highbush (Vaccinium corymbosum), southern highbush (Vaccinium sp.), and rabbiteye (V. virgatum formerly V. asheii) cultivars] and 73,000 ha of lowbush blueberry (V. angustifolium). The majority...

  9. Reachability problems in scheduling and planning

    NARCIS (Netherlands)

    Eggermont, C.E.J.

    2012-01-01

    Reachability problems are fundamental in the context of many mathematical models and abstractions which describe various computational processes. Intuitively, when many objects move within a shared environment, objects may have to wait for others before moving and so slow down, or objects may even

  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. Decompression Mechanisms and Decompression Schedule Calculations.

    Science.gov (United States)

    1984-01-20

    phisiology - The effects of altitude. Handbook of Physiology, Section 3: Respiration, Vol. II. W.O. Fenn and H. Rahn eds. Wash, D.C.; Am. Physiol. Soc. 1 4...decompression studies from other laboratories. METHODS Ten experienced and physically qualified divers ( ages 22-42) were compressed at a rate of 60...STATISTICS* --- ---------------------------------------------------------- EXPERIMENT N AGE (yr) HEIGHT (cm) WEIGHT (Kg) BODY FAT

  12. Wisdom and Bus Schedules: Developing School Leadership

    Science.gov (United States)

    Glatter, Ron

    2009-01-01

    This article is based on a synthesis study of school leadership development conducted for the National College of School Leadership (NCSL) in England. It first outlines a perspective on leadership focusing on the concepts of wisdom, deliberation and higher order capacities. Then it describes and assesses two distinct models of leadership learning,…

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

  14. First LHC Shutdown: Coordination and Schedule Issues

    CERN Document Server

    Coupard, J; 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 the work performed, the organization of the coordination, emphasizing the new safety risks (electrical and cryogenic), and how the interventions were implemented in order to ensure both the safety of personnel and a minimized time window.

  15. Radiation exposure modeling and project schedule visualization

    International Nuclear Information System (INIS)

    Jaquish, W.R.; Enderlin, V.R.

    1995-10-01

    This paper discusses two applications using IGRIP (Interactive Graphical Robot Instruction Program) to assist environmental remediation efforts at the Department of Energy (DOE) Hanford Site. In the first application, IGRIP is used to calculate the estimated radiation exposure to workers conducting tasks in radiation environments. In the second, IGRIP is used as a configuration management tool to detect interferences between equipment and personnel work areas for multiple projects occurring simultaneously in one area. Both of these applications have the capability to reduce environmental remediation costs by reducing personnel radiation exposure and by providing a method to effectively manage multiple projects in a single facility

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

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

  18. Immunization Schedules for Preteens and Teens

    Science.gov (United States)

    ... on his or her health history. Once printed, review with your child’s doctor. Español: Cuestionario sobre las vacunas infantiles Top ... Information for parents about vaccines Screening checklist for child and adolescent ... class="tp-sr-only">Submit Button Nonlinear Price Schedules and Tied Products.

    OpenAIRE

    Ormiston, Michael B; Phillips, Owen R

    1988-01-01

    Illegal tying often occurs when a monopolist jointly sells a product with a complementary requirement, also sold competitively. Along with selling the complement at its competi tive price, this paper shows that profit can increase when a monopoli st lets consumers bundle any amount of the requirement with the basic product at a fixed price. Examples illustrate demand conditions that enhance the profitability of this nonlinear price strategy and show that profits can approximate those earned f...

  19. Verifiable Task Assignment and Scheduling Controller

    Science.gov (United States)

    2017-07-01

    variables are defined , 5) submit the pattern, 6) repeat steps 1-5 until all patterns are created, 7) submit the completed patterns 28) Satisfaction ...further complexity through decentralized control elements and flexible autonomy, such as autonomy that can be operator- customized for the mission at... custom software method within the model builder converts the flight plans into the format needed by the model checker (i.e., a finite state transition

  1. Personnel preferences in personnel planning and scheduling

    OpenAIRE

    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 Research, a subfield of applied mathematics, we show that operational efficiency can be achieved while taking personnel preferences into account. In the design of optimization methods, we explicitly con...

  2. TECHNICAL COORDINATION,SCHEDULE AND INTEGRATION

    CERN Document Server

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

  3. Differences in Student Outcomes between Block, Semester, and Trimester Schedules.

    Science.gov (United States)

    McCreary, Jason; Hausman, Charles

    Despite the popularity of schedule modifications as a cost-effective reform to improve student outcomes, little empirical research on the consequences of alternative schedules has been conducted. The literature has been dominated by anecdotal reports. Even when empirical evidence is examined, causal comparisons of school outcomes between schedules…

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

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

  6. Practical quantum appointment scheduling

    Science.gov (United States)

    Touchette, Dave; Lovitz, Benjamin; Lütkenhaus, Norbert

    2018-04-01

    We propose a protocol based on coherent states and linear optics operations for solving the appointment-scheduling problem. Our main protocol leaks strictly less information about each party's input than the optimal classical protocol, even when considering experimental errors. Along with the ability to generate constant-amplitude coherent states over two modes, this protocol requires the ability to transfer these modes back-and-forth between the two parties multiple times with very low losses. The implementation requirements are thus still challenging. Along the way, we develop tools to study quantum information cost of interactive protocols in the finite regime.

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

    ... corporations with assets of $10 million or more, to reconcile financial accounting net income and taxable... the collection of information displays a valid OMB control number. Books or records relating to a... the proper performance of the functions of the agency, including whether the information shall have...

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

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

  10. Transmission Scheduling and Routing Algorithms for Delay Tolerant Networks

    Science.gov (United States)

    Dudukovich, Rachel; Raible, Daniel E.

    2016-01-01

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

  11. Backfilling with Fairness and Slack for Parallel Job Scheduling

    Energy Technology Data Exchange (ETDEWEB)

    Sodan, Angela C; Wei Jin, E-mail: acsodan@uwindsor.ca [University of Windsor, Computer Science, Windsor, Ontario (Canada)

    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.

  12. Routing and Scheduling Optimization Model of Sea Transportation

    Science.gov (United States)

    barus, Mika debora br; asyrafy, Habib; nababan, Esther; mawengkang, Herman

    2018-01-01

    This paper examines the routing and scheduling optimization model of sea transportation. One of the issues discussed is about the transportation of ships carrying crude oil (tankers) which is distributed to many islands. The consideration is the cost of transportation which consists of travel costs and the cost of layover at the port. Crude oil to be distributed consists of several types. This paper develops routing and scheduling model taking into consideration some objective functions and constraints. The formulation of the mathematical model analyzed is to minimize costs based on the total distance visited by the tanker and minimize the cost of the ports. In order for the model of the problem to be more realistic and the cost calculated to be more appropriate then added a parameter that states the multiplier factor of cost increases as the charge of crude oil is filled.

  13. Backfilling with Fairness and Slack for Parallel Job Scheduling

    International Nuclear Information System (INIS)

    Sodan, Angela C; Wei Jin

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

  14. Understanding Applications of Project Planning and Scheduling in Construction Projects

    OpenAIRE

    AlNasseri, Hammad Abdullah

    2015-01-01

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

  15. Organization of the construction and schedule of realization

    International Nuclear Information System (INIS)

    Szerovay, Antal; Vogel, Oszkar

    1988-01-01

    The four units of the Paks nuclear power plant with all the auxiliary and service facilities were constructed between 1974 and 1987. Major features of building activities, types of buildings classified according to the connection between the facility and the technology are listed. Processes and structures applied to the construction of the main reactor building are mentioned emphasizing the importance of up-to-date building methods. To move the large equipment into the reactor building Potain cranes of 400 Mp were used. As a result of adequate schedule the auxiliary buildings could be used as preparatory buildings during the construction of the plant. The energy and material supply, the schedule of the construction works are discussed. (V.N.) 6 refs.; 5 figs

  16. Integrating and scheduling an open set of static analyses

    DEFF Research Database (Denmark)

    Eichberg, Michael; Mezini, Mira; Kloppenburg, Sven

    2006-01-01

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

  17. Double-shell tank waste system assessment status and schedule

    International Nuclear Information System (INIS)

    Walter, E.J.

    1995-01-01

    The integrated program for completing the integrity assessments of the dangerous waste tank systems managed by the Tank Waste Remediation System (TWRS) Division of Westinghouse Hanford Company is presented in the Tank Waste Remediation System Tank System Integrity Assessments Program Plan, WHC-SD-AP017, Rev. 1. The program plan identified the assessment requirements and the general scope to which these requirements applied. Some of these assessment requirements have been met and others are either in process of completion or scheduled to be worked. To define the boundary of the double-shell tank (DST) system and the boundaries of the DST system components (or system parts) for the purpose of performing integrity assessment activities; To identify the planned activities to meet the assessment requirements for each component; Provide the status of the assessment activities; and Project a five year assessment activity schedule

  18. Historical Mass, Power, Schedule, and Cost Growth for NASA Spacecraft

    Science.gov (United States)

    Hayhurst, Marc R.; Bitten, Robert E.; Shinn, Stephen A.; Judnick, Daniel C.; Hallgrimson, Ingrid E.; Youngs, Megan A.

    2016-01-01

    Although spacecraft developers have been moving towards standardized product lines as the aerospace industry has matured, NASA's continual need to push the cutting edge of science to accomplish unique, challenging missions can still lead to spacecraft resource growth over time. This paper assesses historical mass, power, cost, and schedule growth for multiple NASA spacecraft from the last twenty years and compares to industry reserve guidelines to understand where the guidelines may fall short. Growth is assessed from project start to launch, from the time of the preliminary design review (PDR) to launch and from the time of the critical design review (CDR) to launch. Data is also assessed not just at the spacecraft bus level, but also at the subsystem level wherever possible, to help obtain further insight into possible drivers of growth. Potential recommendations to minimize spacecraft mass, power, cost, and schedule growth for future missions are also discussed.

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

  20. Prioritizing and scheduling Portsmouth Gaseous Diffusion Plant safeguards upgrades

    International Nuclear Information System (INIS)

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

    1992-02-01

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

  1. Sleep schedules and school performance in Indigenous Australian children.

    Science.gov (United States)

    Blunden, Sarah; Magee, Chris; Attard, Kelly; Clarkson, Larissa; Caputi, Peter; Skinner, Timothy

    2018-04-01

    Sleep duration and sleep schedule variability have been related to negative health and well-being outcomes in children, but little is known about Australian Indigenous children. Data for children aged 7-9 years came from the Australian Longitudinal Study of Indigenous Children and the National Assessment Program-Literacy and Numeracy (NAPLAN). Latent class analysis determined sleep classes taking into account sleep duration, bedtimes, waketimes, and variability in bedtimes from weekdays to weekends. Regression models tested whether the sleep classes were cross-sectionally associated with grade 3 NAPLAN scores. Latent change score modeling then examined whether the sleep classes predicted changes in NAPLAN performance from grades 3 to 5. Five sleep schedule classes were identified: normative sleep, early risers, long sleep, variable sleep, and short sleep. Overall, long sleepers performed best, with those with reduced sleep (short sleepers and early risers) performing the worse on grammar, numeracy, and writing performance. Latent change score results also showed that long sleepers performed best in spelling and writing and short sleepers and typical sleepers performed the worst over time. In this sample of Australian Indigenous children, short sleep was associated with poorer school performance compared with long sleep, with this performance worsening over time for some performance indicators. Other sleep schedules (eg, early wake times and variable sleep) also had some relationships with school performance. As sleep scheduling is modifiable, this offers opportunity for improvement in sleep and thus performance outcomes for these and potentially all children. Copyright © 2018 National Sleep Foundation. Published by Elsevier Inc. All rights reserved.

  2. Integrated project scheduling and staff assignment with controllable processing times.

    Science.gov (United States)

    Fernandez-Viagas, Victor; Framinan, Jose M

    2014-01-01

    This paper addresses a decision problem related to simultaneously scheduling the tasks in a project and assigning the staff to these tasks, taking into account that a task can be performed only by employees with certain skills, and that the length of each task depends on the number of employees assigned. This type of problems usually appears in service companies, where both tasks scheduling and staff assignment are closely related. An integer programming model for the problem is proposed, together with some extensions to cope with different situations. Additionally, the advantages of the controllable processing times approach are compared with the fixed processing times. Due to the complexity of the integrated model, a simple GRASP algorithm is implemented in order to obtain good, approximate solutions in short computation times.

  3. Integrated Project Scheduling and Staff Assignment with Controllable Processing Times

    Directory of Open Access Journals (Sweden)

    Victor Fernandez-Viagas

    2014-01-01

    Full Text Available This paper addresses a decision problem related to simultaneously scheduling the tasks in a project and assigning the staff to these tasks, taking into account that a task can be performed only by employees with certain skills, and that the length of each task depends on the number of employees assigned. This type of problems usually appears in service companies, where both tasks scheduling and staff assignment are closely related. An integer programming model for the problem is proposed, together with some extensions to cope with different situations. Additionally, the advantages of the controllable processing times approach are compared with the fixed processing times. Due to the complexity of the integrated model, a simple GRASP algorithm is implemented in order to obtain good, approximate solutions in short computation times.

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

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

  6. The DEEP-South: Scheduling and Data Reduction Software System

    Science.gov (United States)

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

    2015-08-01

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

  7. The Third Competition on Knowledge Engineering for Planning and Scheduling

    OpenAIRE

    Bartak, Roman; Fratini, Simone; McCluskey, Lee

    2010-01-01

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

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

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

  10. Who benefits from family support? Work schedule and family differences.

    Science.gov (United States)

    Jennings, Kristen S; Sinclair, Robert R; Mohr, Cynthia D

    2016-01-01

    Prior research has demonstrated the benefits of family-supportive organization perceptions (FSOP) for reducing stress, increasing satisfaction, and increasing worker commitment; however, less research has studied health outcomes or possible differences in the effects of FSOP based on worker characteristics. The present study examined relationships between FSOP and health outcomes, as well as how those relationships may depend on work schedule and family differences. Using a sample of 330 acute care nurses, the findings indicated that FSOP predicted several health and well-being outcomes obtained 9 months later. Further, the relationships between FSOP and the outcome variables depended on some work schedule and family differences. In terms of family differences, FSOP was most strongly related to life satisfaction for those who cared for dependent adults. The relationship between FSOP and health outcomes of depression, musculoskeletal pain, and physical health symptoms were generally significant for workers with dependent children, but not significant for workers with no children. Regarding schedule differences, the relationship between FSOP and life satisfaction was significant for those on nonstandard (evening/night) shifts but not significant for standard day shift workers; however, there were no differences in FSOP relationships by number of hours worked per week. The findings demonstrate that FSOP may benefit some employees more than others. Such differences need to be incorporated into both future work-family theory development and into efforts to document the effectiveness of family-supportive policies, programs, and practices. (c) 2016 APA, all rights reserved).

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

  12. Web-Based Requesting and Scheduling Use of Facilities

    Science.gov (United States)

    Yeager, Carolyn M.

    2010-01-01

    Automated User's Training Operations Facility Utilization Request (AutoFUR) is prototype software that administers a Web-based system for requesting and allocating facilities and equipment for astronaut-training classes in conjunction with scheduling the classes. AutoFUR also has potential for similar use in such applications as scheduling flight-simulation equipment and instructors in commercial airplane-pilot training, managing preventive- maintenance facilities, and scheduling operating rooms, doctors, nurses, and medical equipment for surgery. Whereas requesting and allocation of facilities was previously a manual process that entailed examination of documents (including paper drawings) from different sources, AutoFUR partly automates the process and makes all of the relevant information available via the requester s computer. By use of AutoFUR, an instructor can fill out a facility-utilization request (FUR) form on line, consult the applicable flight manifest(s) to determine what equipment is needed and where it should be placed in the training facility, reserve the corresponding hardware listed in a training-hardware inventory database, search for alternative hardware if necessary, submit the FUR for processing, and cause paper forms to be printed. Auto-FUR also maintains a searchable archive of prior FURs.

  13. The operational flight and multi-crew scheduling problem

    Directory of Open Access Journals (Sweden)

    Stojković Mirela

    2005-01-01

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

  14. Multi-core processing and scheduling performance in CMS

    International Nuclear Information System (INIS)

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

    2012-01-01

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

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

    OpenAIRE

    DM Seegmuller; SE Visagie; HC de Kock; WJ Pienaar

    2007-01-01

    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. Furthermore, some jobs (restricted to subsets of the total pool of jobs) can, to different extents, run in parallel. In addition, not all the jobs need necessarily be implemen...

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

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

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

  19. Cost and schedule reduction for next-generation Candu

    International Nuclear Information System (INIS)

    Hopwood, J.M.; Yu, S.; Pakan, M.; Soulard, M.

    2002-01-01

    AECL has developed a suite of technologies for Candu R reactors that enable the next step in the evolution of the Candu family of heavy-water-moderated fuel-channel reactors. These technologies have been combined in the design for the Advanced Candu Reactor TM1 (ACRTM), AECL's next generation Candu power plant. The ACR design builds extensively on the existing Candu experience base, but includes innovations, in design and in delivery technology, that provide very substantial reductions in capital cost and in project schedules. In this paper, main features of next generation design and delivery are summarized, to provide the background basis for the cost and schedule reductions that have been achieved. In particular the paper outlines the impact of the innovative design steps for ACR: - Selection of slightly enriched fuel bundle design; - Use of light water coolant in place of traditional Candu heavy water coolant; - Compact core design with unique reactor physics benefits; - Optimized coolant and turbine system conditions. In addition to the direct cost benefits arising from efficiency improvement, and from the reduction in heavy water, the next generation Candu configuration results in numerous additional indirect cost benefits, including: - Reduction in number and complexity of reactivity mechanisms; - Reduction in number of heavy water auxiliary systems; - Simplification in heat transport and its support systems; - Simplified human-machine interface. The paper also describes the ACR approach to design for constructability. The application of module assembly and open-top construction techniques, based on Candu and other worldwide experience, has been proven to generate savings in both schedule durations and overall project cost, by reducing premium on-site activities, and by improving efficiency of system and subsystem assembly. AECL's up-to-date experience in the use of 3-D CADDS and related engineering tools has also been proven to reduce both engineering and

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

    Science.gov (United States)

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

    2016-08-01

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

  1. Channel access delay and buffer distribution of two-user opportunistic scheduling schemes in wireless networks

    KAUST Repository

    Hossain, Md Jahangir; Alouini, Mohamed-Slim; Bhargava, Vijay K.

    2010-01-01

    In our earlier works, we proposed rate adaptive hierarchical modulation-assisted two-best user opportunistic scheduling (TBS) and hybrid two-user scheduling (HTS) schemes. The proposed schemes are innovative in the sense that they include a second

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

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

  4. Planning construction of integrative schedule management for nuclear power project

    International Nuclear Information System (INIS)

    Zeng Zhenglin; Wang Wenying; Peng Fei

    2012-01-01

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

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

    Science.gov (United States)

    2010-07-01

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

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

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

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

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

  10. Development of Watch Schedule Using Rules Approach

    Science.gov (United States)

    Jurkevicius, Darius; Vasilecas, Olegas

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

  11. Effect of melatonin and lighting schedule on energy metabolism in broiler chickens

    NARCIS (Netherlands)

    Apeldoorn, E.J.; Schrama, J.W.; Mashaly, M.M.; Parmentier, H.K.

    1999-01-01

    The effect of melatonin and lighting schedule on energy metabolism in broiler chickens was studied. Eight groups of six female broiler chickens each were assigned to a continuous lighting schedule [23 h light (L):1 h darkness (D)] or an intermittent lighting schedule (1L:3D), and were fed a diet

  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. A Formal Product-Line Engineering Approach for Schedulers

    NARCIS (Netherlands)

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

    2017-01-01

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

  14. Traditional/Block Scheduling, Gender, and Test Scores in College Biology Course

    Science.gov (United States)

    Huelskamp, Diana

    2014-01-01

    Block scheduling is the reallocation of a school day into longer class sessions to allow for more active teaching strategies and active engagement of students, in the effort to increase student performance. Various types of block scheduling exist. Traditional scheduling is when the school day is divided into six to eight sessions, with each…

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

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

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

    International Nuclear Information System (INIS)

    Finnegan, J.M.

    1986-01-01

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

  18. Schedules of Controlled Substances: Placement of UR-144, XLR11, and AKB48 into Schedule I. Final rule.

    Science.gov (United States)

    2016-05-11

    With the issuance of this final rule, the Drug Enforcement Administration places (1-pentyl-1H-indol-3-yl)(2,2,3,3-tetramethylcyclopropyl)methanone (UR-144), [1-(5-fluoro-pentyl)-1H-indol-3-yl](2,2,3,3-tetramethylcyclopropyl)methanone (5-fluoro-UR-144, XLR11), and N-(1-adamantyl)-1-pentyl-1H-indazole-3-carboxamide (APINACA, AKB48), including their salts, isomers, and salts of isomers whenever the existence of such salts, isomers, and salts of isomers is possible, into schedule I of the Controlled Substances Act. This scheduling action is pursuant to the Controlled Substances Act which requires that such actions be made on the record after opportunity for a hearing through formal rulemaking. This action imposes the regulatory controls and administrative, civil, and criminal sanctions applicable to schedule I controlled substances 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 UR-144, XLR11, or AKB48.

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

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

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

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

  3. Tramp Ship Routing and Scheduling - Incorporating Additional Complexities

    DEFF Research Database (Denmark)

    Vilhelmsen, Charlotte

    to mergers, pooling, and collaboration efforts between shipping companies, the fleet sizes have grown to a point where manual planning is no longer adequate in a market with tough competition and low freight rates. This thesis therefore aims at developing new mathematical models and solution methods...... 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...

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

  5. Options for Parallelizing a Planning and Scheduling Algorithm

    Science.gov (United States)

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

    2011-01-01

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

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

  7. Real-time control systems: feedback, scheduling and robustness

    Science.gov (United States)

    Simon, Daniel; Seuret, Alexandre; Sename, Olivier

    2017-08-01

    The efficient control of real-time distributed systems, where continuous components are governed through digital devices and communication networks, needs a careful examination of the constraints arising from the different involved domains inside co-design approaches. Thanks to the robustness of feedback control, both new control methodologies and slackened real-time scheduling schemes are proposed beyond the frontiers between these traditionally separated fields. A methodology to design robust aperiodic controllers is provided, where the sampling interval is considered as a control variable of the system. Promising experimental results are provided to show the feasibility and robustness of the approach.

  8. Tramp ship routing and scheduling with voyage separation requirements

    DEFF Research Database (Denmark)

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

    2017-01-01

    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......In this paper we explore tramp ship routing and scheduling. Tramp ships operate much like taxies following the available demand. Tramp operators can determine some of their demand in advance by entering into long-term contracts and then try to maximise profits from optional voyages found...

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

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

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

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

    Directory of Open Access Journals (Sweden)

    DM Seegmuller

    2007-06-01

    Full Text Available 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. Furthermore, some jobs (restricted to subsets of the total pool of jobs can, to different extents, run in parallel. In addition, not all the jobs need necessarily be implemented during the given time period.

  13. Integrated Fractional Load and Packet Scheduling for OFDMA Systems

    DEFF Research Database (Denmark)

    Monghal, Guillaume Damien; Kumar, S.; Pedersen, Klaus I.

    2009-01-01

    This paper study the performance of an orthogonal frequency division multiple access (OFDMA) system under fractional load based in long term evolution (LTE) downlink. Fractional load is defined by a situation where only a fraction of the bandwidth is used for transmission due to lack of traffic....... This type of situation should result in a global increase of signal to interference and noise ratio (SINR) conditions in the network. We propose different methods integrating the transmission pattern selection to the packet scheduling functionality of the enode-B depending only on the channel quality...

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

    Institute of Scientific and Technical Information of China (English)

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

    2003-01-01

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

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

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

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

  18. Shiftwork Scheduling for the 1990s.

    Science.gov (United States)

    Coleman, Richard M.

    1989-01-01

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

  19. Interactive Anticipatory Scheduling for Two Military Applications

    National Research Council Canada - National Science Library

    Howe, Adele

    2003-01-01

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

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

    Science.gov (United States)

    2010-07-22

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

  1. Optimization and Flight Schedules of Pioneer Routes in Papua Province

    Science.gov (United States)

    Ronting, Y.; Adisasmita, S. A.; Hamid, S.; Hustim, M.

    2018-04-01

    The province of Papua has a very varied topography, ranging from swampy lowlands, hills, and plateaus up steep hills. The total area of land is 410,660 km2, which consists of 28 counties and one city, 389 districts and 5.420 villages. The population of Papua Province in 2017 was 3.265.202 people with an average growth of 4.21% per year. The transportation services is still low, especially in the mountainous region, which is isolated and could only be reached by an air transportation mode, causing a considerable price disparity between coastal and mountainous areas. The purpose of this paper is to develop the route optimization and pioneer flight schedules models as an airbridge. This research is conducted by collecting primary data and secondary data. Data is based on field surveys; interviews; discussions with airport authority, official government, etc; and also from various agencies. The analytical tools used to optimization flight schedule and route are analyzed by add-in solver in Microsoft Excel. The results of the analysis we can get a more optimal route so that it can save transportation costs by 7.26%.

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

  3. Tramp ship routing and scheduling with voyage separation requirements

    DEFF Research Database (Denmark)

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

    2017-01-01

    In this paper we explore tramp ship routing and scheduling. Tramp ships operate much like taxies following the available demand. Tramp operators can determine some of their demand in advance by entering into long-term contracts and then try to maximise profits from optional voyages found in the s......In this paper we explore tramp ship routing and scheduling. Tramp ships operate much like taxies following the available demand. Tramp operators can determine some of their demand in advance by entering into long-term contracts and then try to maximise profits from optional voyages found...... that our algorithm in general finds optimal solutions very quickly and performs much faster compared to an earlier a priori path generation method. Finally, we compare our method to an earlier adaptive large neighbourhood search heuristic and find that on similar-sized instances our approach generally uses...... less time to find the optimal solution than the adaptive large neighbourhood search method uses to find a heuristic solution....

  4. Aging based maintenance and reinvestment scheduling of electric distribution

    Energy Technology Data Exchange (ETDEWEB)

    Korpijarvi, J.

    2012-07-01

    The maintenance of electric distribution network is a topical question for distribution system operators because of increasing significance of failure costs. In this dissertation the maintenance practices of the distribution system operators are analyzed and a theory for scheduling maintenance activities and reinvestment of distribution components is created. The scheduling is based on the deterioration of components and the increasing failure rates due to aging. The dynamic programming algorithm is used as a solving method to maintenance problem which is caused by the increasing failure rates of the network. The other impacts of network maintenance like environmental and regulation reasons are not included to the scope of this thesis. Further the tree trimming of the corridors and the major disturbance of the network are not included to the problem optimized in this thesis. For optimizing, four dynamic programming models are presented and the models are tested. Programming is made in VBA-language to the computer. For testing two different kinds of test networks are used. Because electric distribution system operators want to operate with bigger component groups, optimal timing for component groups is also analyzed. A maintenance software package is created to apply the presented theories in practice. An overview of the program is presented (orig.)

  5. The influence of "preparedness" on autoshaping, schedule performance, and choice.

    Science.gov (United States)

    Burns, J D; Malone, J C

    1992-11-01

    Two groups of experimentally naive pigeons were exposed to an autoshaping procedure in which the response key was mounted on the wall (the conventional location) or on the floor of the chamber. In two experiments, subjects readily responded to the wall key, but floor-key subjects required shaping. A subsequent experiment compared performance of wall- and floor-key groups on an ascending series of fixed-ratio schedule values, resistance to extinction, differential reinforcement of other behavior, and reversal of key assignment. Each experiment was followed by several sessions of fixed-ratio training; the performance of the wall- and floor-key groups was almost identical throughout. In the final experiment, a fixed-ratio requirement could be completed on either or both keys. Birds initially chose the key on which they had responded during the preceding (reversal of key assignment) experiment. However, within a few sessions both groups showed almost exclusive preference for the floor key. Preference for a key located on the floor may follow from the fact that pigeons are ground feeders and may thus be more "prepared" to peck the floor than to peck a wall. However, autoshaping, under the conditions prevailing here, occurred much more readily to the wall key, suggesting that pecking a vertical surface is more highly prepared. Difficulties in determining relative preparedness seem moot, however, given the lack of between-group differences in the intervening experiments. It is thus unlikely that schedule performances critically depend upon the specific operant response involved.

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

  7. Applying mathematical models to predict resident physician performance and alertness on traditional and novel work schedules.

    Science.gov (United States)

    Klerman, Elizabeth B; Beckett, Scott A; Landrigan, Christopher P

    2016-09-13

    In 2011 the U.S. Accreditation Council for Graduate Medical Education began limiting first year resident physicians (interns) to shifts of ≤16 consecutive hours. Controversy persists regarding the effectiveness of this policy for reducing errors and accidents while promoting education and patient care. Using a mathematical model of the effects of circadian rhythms and length of time awake on objective performance and subjective alertness, we quantitatively compared predictions for traditional intern schedules to those that limit work to ≤ 16 consecutive hours. We simulated two traditional schedules and three novel schedules using the mathematical model. The traditional schedules had extended duration work shifts (≥24 h) with overnight work shifts every second shift (including every third night, Q3) or every third shift (including every fourth night, Q4) night; the novel schedules had two different cross-cover (XC) night team schedules (XC-V1 and XC-V2) and a Rapid Cycle Rotation (RCR) schedule. Predicted objective performance and subjective alertness for each work shift were computed for each individual's schedule within a team and then combined for the team as a whole. Our primary outcome was the amount of time within a work shift during which a team's model-predicted objective performance and subjective alertness were lower than that expected after 16 or 24 h of continuous wake in an otherwise rested individual. The model predicted fewer hours with poor performance and alertness, especially during night-time work hours, for all three novel schedules than for either the traditional Q3 or Q4 schedules. Three proposed schedules that eliminate extended shifts may improve performance and alertness compared with traditional Q3 or Q4 schedules. Predicted times of worse performance and alertness were at night, which is also a time when supervision of trainees is lower. Mathematical modeling provides a quantitative comparison approach with potential to aid

  8. Sport Tournament Automated Scheduling System

    Directory of Open Access Journals (Sweden)

    Raof R. A. A

    2018-01-01

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

  9. Network scheduling at Belene NPP construction site

    International Nuclear Information System (INIS)

    Matveev, A.

    2010-01-01

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

  10. NRC comprehensive records disposition schedule

    International Nuclear Information System (INIS)

    1983-05-01

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

  11. 75 FR 7411 - Schedule of Water Charges

    Science.gov (United States)

    2010-02-19

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

  12. Environmental surveillance master sampling schedule

    International Nuclear Information System (INIS)

    Bisping, L.E.

    1991-01-01

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

  13. Environmental surveillance master sampling schedule

    Energy Technology Data Exchange (ETDEWEB)

    Bisping, L.E.

    1991-01-01

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

  14. Multiuser switched diversity scheduling schemes

    KAUST Repository

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

    2012-01-01

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

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

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

  17. AP1000 construction schedule

    International Nuclear Information System (INIS)

    Winters, J.W.

    2001-01-01

    Westinghouse performed this study as part of EPRI interest in advancing the use of computer aided processes to reduce the cost of nuclear power plants. EPRI believed that if one could relate appropriate portions of an advanced light water reactor plant model to activities in its construction sequence, and this relationship could be portrayed visually, then optimization of the construction sequence could be developed as never before. By seeing a 3-D representation of the plant at any point in its construction sequence, more informed decisions can be made on the feasibility or attractiveness of follow on or parallel steps in the sequence. The 3-D representation of construction as a function of time (4-D) could also increase the confidence of potential investors concerning the viability of the schedule and the plant ultimate cost. This study performed by Westinghouse confirmed that it is useful to be able to visualize a plant construction in 3-D as a function of time in order to optimize the sequence of construction activities. (author)

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

    ... 1041 and Related Schedules D, J, and K-1 AGENCY: Internal Revenue Service (IRS), Treasury. ACTION..., the IRS is soliciting comments concerning Form 1041 and related Schedules D, J, and K-1, U.S. Income... Losses (Schedule D), Accumulation Distribution for Certain Complex Trusts (Schedule J), and Beneficiary's...

  19. 75 FR 28071 - Records Schedules; Availability and Request for Comments

    Science.gov (United States)

    2010-05-19

    ... authorized for disposal or reduce the retention period of records already authorized for disposal. NARA... this accumulation, agency records managers prepare schedules proposing retention periods for records... information concerning evaluations of enlisted personnel. Included are job ratings as well as information...

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

  2. 76 FR 6635 - Records Schedules; Availability and Request for Comments

    Science.gov (United States)

    2011-02-07

    ...: You may request a copy of any records schedule identified in this notice by contacting the Life Cycle... request. FOR FURTHER INFORMATION CONTACT: Laurence Brewer, Director, Life Cycle Management Division (NWML... lists the organizational unit(s) accumulating the records or indicates agency- wide applicability in the...

  3. 75 FR 8751 - Records Schedules; Availability and Request for Comments

    Science.gov (United States)

    2010-02-25

    ...: You may request a copy of any records schedule identified in this notice by contacting the Life Cycle... request. FOR FURTHER INFORMATION CONTACT: Laurence Brewer, Director, Life Cycle Management Division (NWML... lists the organizational unit(s) accumulating the records or indicates agency- wide applicability in the...

  4. 75 FR 11200 - Records Schedules; Availability and Request for Comments

    Science.gov (United States)

    2010-03-10

    ...: You may request a copy of any records schedule identified in this notice by contacting the Life Cycle... request. FOR FURTHER INFORMATION CONTACT: Laurence Brewer, Director, Life Cycle Management Division (NWML..., this public notice lists the organizational unit(s) accumulating the records or indicates agency- wide...

  5. 76 FR 22924 - Records Schedules; Availability and Request for Comments

    Science.gov (United States)

    2011-04-25

    ...: You may request a copy of any records schedule identified in this notice by contacting the Life Cycle... request. FOR FURTHER INFORMATION CONTACT: Laurence Brewer, Director, Life Cycle Management Division (NWML... lists the organizational unit(s) accumulating the records or indicates agency- wide applicability in the...

  6. Environmental surveillance master sampling schedule

    International Nuclear Information System (INIS)

    Bisping, L.E.

    1997-01-01

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

  7. Multiresource allocation and scheduling for periodic soft real-time applications

    Science.gov (United States)

    Gopalan, Kartik; Chiueh, Tzi-cker

    2001-12-01

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

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

  9. Scheduling for energy and reliability management on multiprocessor real-time systems

    Science.gov (United States)

    Qi, Xuan

    Scheduling algorithms for multiprocessor real-time systems have been studied for years with many well-recognized algorithms proposed. However, it is still an evolving research area and many problems remain open due to their intrinsic complexities. With the emergence of multicore processors, it is necessary to re-investigate the scheduling problems and design/develop efficient algorithms for better system utilization, low scheduling overhead, high energy efficiency, and better system reliability. Focusing cluster schedulings with optimal global schedulers, we study the utilization bound and scheduling overhead for a class of cluster-optimal schedulers. Then, taking energy/power consumption into consideration, we developed energy-efficient scheduling algorithms for real-time systems, especially for the proliferating embedded systems with limited energy budget. As the commonly deployed energy-saving technique (e.g. dynamic voltage frequency scaling (DVFS)) will significantly affect system reliability, we study schedulers that have intelligent mechanisms to recuperate system reliability to satisfy the quality assurance requirements. Extensive simulation is conducted to evaluate the performance of the proposed algorithms on reduction of scheduling overhead, energy saving, and reliability improvement. The simulation results show that the proposed reliability-aware power management schemes could preserve the system reliability while still achieving substantial energy saving.

  10. Schedulability Analysis for Java Finalizers

    DEFF Research Database (Denmark)

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

    2010-01-01

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

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

  12. Fatigue, Work Schedules, and Perceived Performance in Bedside Care Nurses.

    Science.gov (United States)

    Sagherian, Knar; Clinton, Michael E; Abu-Saad Huijer, Huda; Geiger-Brown, Jeanne

    2017-07-01

    Hospital nurses are expected to maintain optimal work performance; yet, fatigue can threaten safe practice and result in unfavorable patient outcomes. This descriptive cross-sectional study explored the association between fatigue, work schedules, and perceived work performance among nurses. The study sample included 77 bedside nurses who were mostly female, single, and between 20 and 29 years of age. The majority worked 8-hour shifts and overtime. Nurses who worked during off days reported significantly higher chronic fatigue compared with those nurses who took time off. Nurses who reported feeling refreshed after sleep had significantly less chronic and acute fatigue and more intershift recovery. Nurses with acute and chronic fatigue perceived poorer physical performance. Also, nurses who reported chronic fatigue perceived they were less alert and less able to concentrate when providing patient care. Less effective communication was also associated with acute and chronic fatigue. In conclusion, fatigue has safety implications for nurses' practice that should be monitored by nursing management.

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

    CERN Document Server

    Kerzner, Harold

    2017-01-01

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

  14. Trusted Service Scheduling and Optimization Strategy Design of Service Recommendation

    Directory of Open Access Journals (Sweden)

    Xiaona Xia

    2017-01-01

    Full Text Available More and more Web services raise the demands of personalized service recommendation; there exist some recommendation technologies, which improve the qualities of service recommendation by using service ranking and collaborative filtering. However, privacy and security are also important issues in service scheduling process; social relationships have been the key factors of interpersonal communication; service selection based on user preferences has become an inevitable trend. Starting from user demand preferences, this paper analyzes social topology and service demand information and obtains trusted social relationships; then we construct the fusion model of service historical preferences and potential ones; according to social service recommendation demands, TSRSR algorithm has completed designing. Through experiments, TSRSR algorithm is much better than the others, which can effectively improve potential preferences’ learning. Furthermore, the research results of this paper have more significance to study the security and privacy of service recommendation.

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

  16. Using Planning, Scheduling and Execution for Autonomous Mars Rover Operations

    Science.gov (United States)

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

    2006-01-01

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

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

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

  19. Fractionation schedules for cancers of the head and neck

    International Nuclear Information System (INIS)

    Harari, Paul M.

    1995-01-01

    Purpose/Objective: This refresher course reviews current research activity and treatment results in the field of radiation therapy fractionation. The presentation emphasizes worldwide studies of altered fractionation, highlighting head and neck cancer as the primary teaching model. Basic radiobiological principles guiding the development of altered fractionation regimens, and advancing the understanding of fractionation effects on normal and tumor tissue are reviewed. A 'standard' prescription of 2 Gy x 35 fractions = 70 Gy may not provide the optimal balance between primary tumor control and late normal tissue effects for all patients with squamous cell carcinoma of the head and neck. The last decade has witnessed the treatment of thousands of head and neck cancer patients with curative radiotherapy using altered fractination schedules designed to improve overall treatment results. Although the number of different fractionation regimens currently being investigated continues to increase, the common guiding principles behind their design are relatively simple. Common fractionation terminology (i.e., accelerated hyperfractionation) will be reviewed, as well as a brief summary of radiobiological concepts pertaining to tumor potential doubling time, tumor proliferation kinetics, overall treatment time and fraction size-dependence of acute and late tissue effects. Several well known head and neck fractionation schedules from around the world (Manchester Christie Hospital-United Kingdom, Princess Margaret Hospital-Canada, Massachusetts General Hospital-USA, MD Anderson Hospital-USA, University of Florida-USA, Mount Vernon Hospital CHART-United Kingdom, RTOG and EORTC trials-USA and Europe) will be summarized with regard to design-rationale, treatment technique and results. The design of several current cooperative group trials investigating altered head and neck fractionation will be presented, as well as concepts prompting the pilot evaluation of several brand new

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

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

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

  3. Nursing teamwork, staff characteristics, work schedules, and staffing.

    Science.gov (United States)

    Kalisch, Beatrice J; Lee, Hyunhwa

    2009-01-01

    This study aimed to explore whether and how staff characteristics, staffing, and scheduling variables are associated with the level of teamwork in nursing staff on acute care hospital patient units. This was a cross-sectional study with a sample of 1,758 nursing staff members from two different hospitals on 38 patient care units who completed the Nursing Teamwork Survey in 2008. This study focused on nursing teams who are stationed on a particular patient care unit (as opposed to visitors to the units). The return rate was 56.9%. The sample was made up of 77.4% nurses (registered nurses and licensed practical nurses), 11.9% assistive personnel, and 7.9% unit secretaries. Teamwork varied by unit and service type, with the highest scores occurring in pediatrics and maternity and the lowest scores on the medical-surgical and emergency units. Staff with less than 6 months of experience, those working 8- or 10-hour shifts (as opposed to 12 hours or a combination of 8 and 12 hours), part-time staff (as opposed to full time), and those working on night shift had higher teamwork scores. The higher teamwork scores were also associated with no or little overtime. The higher perception of the adequacy of staffing and the fewer patients cared for on a previous shift, the higher the teamwork scores. There is a relationship between selected staff characteristics, aspects of work schedules, staffing, and teamwork. Nursing staff want to work where teamwork is high, and perceptions of good staffing lead to higher teamwork. Higher teamwork scores correlated with those who worked less overtime.

  4. Do scheduled caste and scheduled tribe women legislators mean lower gender-caste gaps in primary schooling in India?

    Science.gov (United States)

    Halim, Nafisa; Yount, Kathryn M; Cunningham, Solveig

    2016-07-01

    Despite India's substantial investments in primary schooling, gaps in schooling persist across gender and caste-with scheduled caste and scheduled tribe (SC/ST) girls being particularly disadvantaged. The representation of SC/ST women in state legislatures may help to mitigate this disadvantage. Specifically, because of her intersecting gender and caste/tribe identities, a SC/ST woman legislator might maintain a strong sense of solidarity especially with SC/ST girls and women, and support legislative policies benefitting SC/ST girls. Consequently, for this reason, we expect that living in a district where SC/ST women represent in state legislatures in a higher proportion may increase SC/ST girls' primary school completion, progression and performance. We tested this hypothesis using district-level data between 2000 and 2004 from the Indian Election Commission, the 2004/5 India Human Development Survey, and the Indian Census of 2001. As expected, the representation of SC/ST women in state legislatures was positively associated with SC/ST girls' grade completion and age-appropriate grade progression but was apparent not SC/ST girls' primary-school performance. SC/ST women's representation in state legislatures may reduce gender-caste gaps in primary-school attainment in India. Copyright © 2016. Published by Elsevier Inc.

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

  6. Routine environmental monitoring schedule, calendar year 1995

    International Nuclear Information System (INIS)

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

    1994-12-01

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

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

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

    International Nuclear Information System (INIS)

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

    1989-01-01

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

  9. [The effect of aluminum adjuvant and immunization schedule on immunogenicity of Sabin inactivated poliovirus vaccine].

    Science.gov (United States)

    Wang, Fang; Zhang, Ming; Xie, Bing-Feng; Cao, Han; Tong, Shao-Yong; Wang, Jun-Rong; Yu, Xiao-Ping; Tang, Yang; Yang, Jing-Ran; Sun, Ming-Bo

    2013-04-01

    To study the effect of aluminume adjuvant and immunization schedule on immunogenicity of Sabin inactivated poliovirus vaccine. Four batches of Sabin IPV were produced by different concentrations of type 1, 2, and 3 poliovirus and administrated on three-dose schedule at 0, 1, 2 months and 0, 2, 4 months on rats. Serum samples were collected one month after each dose and neutralizing antibody titers against three types poliovirus were determined by micro-neutralization assay. The GMTs of neutralizing antibodies against three types poliovirus increased significantly and the seropositivity rates were 100% in all groups after 3 doses. There was no significant difference between two immunization schedules, and the 0, 2, 4 month schedule could induce higher level neutralizing antibody compared to the 0, 1, 2 month schedule. The groups with aluminum adjuvant could induce higher level neutralizing antibody compared to the groups without adjuvant. Aluminum djuvant and immunization schedule could improve the immunogenicity of Sabin IPV.

  10. Coordinating space telescope operations in an integrated planning and scheduling architecture

    Science.gov (United States)

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

    1992-01-01

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

  11. Clinch River Breeder Reactor Plant Project: construction schedule

    International Nuclear Information System (INIS)

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

    1982-01-01

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

  12. Data Model Approach And Markov Chain Based Analysis Of Multi-Level Queue Scheduling

    Directory of Open Access Journals (Sweden)

    Diwakar Shukla

    2010-01-01

    Full Text Available There are many CPU scheduling algorithms inliterature like FIFO, Round Robin, Shortest-Job-First and so on.The Multilevel-Queue-Scheduling is superior to these due to itsbetter management of a variety of processes. In this paper, aMarkov chain model is used for a general setup of Multilevelqueue-scheduling and the scheduler is assumed to performrandom movement on queue over the quantum of time.Performance of scheduling is examined through a rowdependent data model. It is found that with increasing value of αand d, the chance of system going over the waiting state reduces.At some of the interesting combinations of α and d, it diminishesto zero, thereby, provides us some clue regarding better choice ofqueues over others for high priority jobs. It is found that ifqueue priorities are added in the scheduling intelligently thenbetter performance could be obtained. Data model helpschoosing appropriate preferences.

  13. Impact of flexible scheduling on employee performance regarding stress and work-family conflict

    OpenAIRE

    Raja Abdul Ghafoor Khan; Furqan Ahmad Khan; Dr. Muhammad Aslam Khan; Mohsin Shakeel

    2011-01-01

    Stress, work-family conflicts and flexible scheduling are three of the most important elements in organizational studies. The focus of current study is to understand the effect of Stress,work family conflicts and flexible scheduling on employee’s performance and also to understand whether flexible scheduling helps in reducing stress and work-family conflicts or not. The back bone of this study is the secondary data comprised of comprehensive literature review. A survey has also been conducted...

  14. CPM scheduling : the Contracting Officers' Guide for risk minimization and claims analysis

    OpenAIRE

    Prather, Craig S.

    1998-01-01

    CIVINS (Civilian Institutions) Thesis document There are several hundred contract management related positions in the Navy's Civil Engineer Corps. Many junior and senior Contracting Officers and their representatives who serve in these positions have little to no experience with approving, monitoring and analyzing contractors' construction schedules. Typically, the contractor submits an initial schedule for approval, however, due to the lack of experience and knowledge, scheduling software...

  15. An interpretation of schedule 1 of the Radioactive Substances Act 1993 and related issues

    International Nuclear Information System (INIS)

    Hill, M.; Wakerley, M.W.

    2000-09-01

    Schedule 1 of the UK's Radioactive Substances Act 1993 was originally Schedule 3 of the 1960 Act of the same name. It is possible that different methods are currently being employed to interpret how Schedule 1 should be used. This report provides an interpretation and guidance on this and related issues. It is primarily for technical specialists already familiar with the workings of the Act. This report covers the period 1999/2000

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

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

  18. Toward Realistic Acquisition Schedule Estimates

    Science.gov (United States)

    2016-04-30

    replace earlier versions of the F/A-18. Joint and International Nature At the time of JSF conception, there was a clear preference at the highest levels...ALPHABET SOUP ” (Aboulafia, 2015) OF STUDIES AND CONCEPTS • … MERGED INTO JAST • … WHICH EVOLVED TO JSF • WELL-KNOWN COST AND SCHEDULE

  19. Shift scheduling model considering workload and worker’s preference for security department

    Science.gov (United States)

    Herawati, A.; Yuniartha, D. R.; Purnama, I. L. I.; Dewi, LT

    2018-04-01

    Security department operates for 24 hours and applies shift scheduling to organize its workers as well as in hotel industry. This research has been conducted to develop shift scheduling model considering the workers physical workload using rating of perceived exertion (RPE) Borg’s Scale and workers’ preference to accommodate schedule flexibility. The mathematic model is developed in integer linear programming and results optimal solution for simple problem. Resulting shift schedule of the developed model has equally distribution shift allocation among workers to balance the physical workload and give flexibility for workers in working hours arrangement.

  20. Verification of reliability and validity of a Japanese version of the Rathus Assertiveness Schedule.

    Science.gov (United States)

    Suzuki, Eiko; Kanoya, Yuka; Katsuki, Takeshi; Sato, Chifumi

    2007-07-01

    To verify the reliability and validity of a Japanese version of the Rathus Assertiveness Schedule in novice nurses to contribute to nursing management. An adequate scale is needed to measure the assertiveness and the effect of assertion training for Japanese nurses and to compare them with those in other countries. Rathus Assertiveness Schedule was adapted to Japanese with back-translation and its validity was examined in 989 novice nurses. The Japanese version showed a high coefficient of reliability in a split-half reliability test (r=0.76; PAssertiveness Schedule. The Japanese version of Rathus Assertiveness Schedule was verified.

  1. Impact of Scheduling Flexibility on Demand Profile Flatness and User Inconvenience in Residential Smart Grid System

    Directory of Open Access Journals (Sweden)

    Naveed Ul Hassan

    2013-12-01

    Full Text Available The objective of this paper is to study the impact of scheduling flexibility on both demand profile flatness and user inconvenience in residential smart grid systems. Temporal variations in energy consumption by end users result in peaks and troughs in the aggregated demand profile. In a residential smart grid, some of these peaks and troughs can be eliminated through appropriate load balancing algorithms. However, load balancing requires user participation by allowing the grid to re-schedule some of their loads. In general, more scheduling flexibility can result in more demand profile flatness, however the resulting inconvenience to users would also increase. In this paper, our objective is to help the grid determine an appropriate amount of scheduling flexibility that it should demand from users, based on which, proper incentives can be designed. We consider three different types of scheduling flexibility (delay, advance scheduling and flexible re-scheduling in flexible loads and develop both optimal and sub-optimal scheduling algorithms. We discuss their implementation in centralized and distributed manners. We also identify the existence of a saturation point. Beyond this saturation point, any increase in scheduling flexibility does not significantly affect the flatness of the demand profile while user inconvenience continues to increase. Moreover, full participation of all the households is not required since increasing user participation only marginally increases demand profile flatness.

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

    International Nuclear Information System (INIS)

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

  4. Optimal and online preemptive scheduling on uniformly related machines

    Czech Academy of Sciences Publication Activity Database

    Ebenlendr, Tomáš; Sgall, J.

    2009-01-01

    Roč. 12, č. 5 (2009), s. 517-527 ISSN 1094-6136 R&D Projects: GA MŠk(CZ) 1M0545; GA AV ČR IAA100190902; GA AV ČR IAA1019401 Institutional research plan: CEZ:AV0Z10190503 Keywords : online scheduling * preemption * uniformly related machines Subject RIV: IN - Informatics, Computer Science Impact factor: 1.265, year: 2009

  5. Military Free Fall Scheduling And Manifest Optimization Model

    Science.gov (United States)

    2016-12-01

    zone. As interest in qualifying more personnel increased, the course expanded. By the mid-1990s, Reyes explains, a new location was required to better...Since 2005, the Chilean Professional Soccer Association has used operations research techniques to schedule professional leagues in Chile . These...a new parachute the students are using, the RA-1. The RA-1 parachute has a longer glide ratio, which means the rate of descent is slower than with

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

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

    Science.gov (United States)

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

    1995-03-01

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

  8. How useful are preemptive schedules?

    NARCIS (Netherlands)

    Brucker, P.; Heitmann, S.; Hurink, J.L.

    2001-01-01

    Machine scheduling admits two options to process jobs. In a preemptive mode processing may be interrupted and resumed later even on a different machine. In a nonpreemptive mode interruptions are not allowed. Usually, the possibility to preempt jobs leads to better performance values. However, also

  9. Interaction in activity location scheduling

    NARCIS (Netherlands)

    Tabak, V.; Vries, de B.; Dijkstra, J.; Jessurun, A.J.

    2006-01-01

    In this paper we discuss the interaction in activity location scheduling which is the main subject of an ongoing research project called "User Simulation of Space Utilization". The aim of this research project is to develop an overall model for the simulation of human movement and utilization of

  10. Scheduling with target start times

    NARCIS (Netherlands)

    Hoogeveen, J.A.; Velde, van de S.L.; Klein Haneveld, W.K.; Vrieze, O.J.; Kallenberg, L.C.M.

    1997-01-01

    We address the single-machine problem of scheduling n independent jobs subject to target start times. Target start times are essentially release times that may be violated at a certain cost. The goal is to minimize an objective function that is composed of total completion time and maximum

  11. Scheduling periodic tasks with slack

    NARCIS (Netherlands)

    Korst, J.H.M.; Aarts, E.H.L.; Lenstra, J.K.

    1997-01-01

    We consider the problem of nonpreemptively scheduling periodic tasks on a minimum number of identical processors, assuming that some slack is allowed in the time between successive executions of a periodic task. We prove that the problem is NP-hard in the strong sense. Necessary and sufficient

  12. 78 FR 55099 - Established Aggregate Production Quotas for Schedule I and II Controlled Substances and...

    Science.gov (United States)

    2013-09-09

    ... aggregate production quotas, an additional 25% of the estimated medical, scientific, and research needs as... Production Quotas for Schedule I and II Controlled Substances and Established Assessment of Annual Needs for... initial 2014 aggregate production quotas for controlled substances in Schedules I and II of the Controlled...

  13. Prevalence of the β(S) gene among scheduled castes, scheduled tribes and other backward class groups in Central India.

    Science.gov (United States)

    Shrikhande, Anuradha V; Arjunan, Aishwarya; Agarwal, Amit; Dani, Aarti; Tijare, Jayashri; Gettig, Elizabeth; Krishnamurti, Lakshmanan

    2014-01-01

    Sickle cell disease is an inherited disorder of the blood, and characterized by vasoocclusive crises (VOC), risks for pneumococcal infections and organ toxicities, is associated with morbidity and premature mortality. India, with a population of 1.2 billion individuals, is estimated to be home to over 50.0% of the world's patients with sickle cell disease. The β(S) gene [β6(A3)Glu→Val; HBB: c.20A>T] has the highest prevalence in three socio-economically disadvantaged ethnic categories: the Scheduled Castes (SC), the Scheduled Tribes (ST), and Other Backward Class (OBC) groups in India. The tradition of endogamy practiced by the ethnic groups in India provides the rationale for the screening of individual populations to better understand the distribution of the β(S) gene, guide counseling and awareness programs and aid development of public policy. We undertook a study to describe the prevalence of the β(S) gene in these ethnic groups in the district of Nagpur, Maharashtra in Central India. Through community screening and subsequent targeted screening of high risk individuals, 35,636 individuals were screened, of whom 5466 were found to have sickle cell trait and 1010 were identified with sickle cell disease. Community screening revealed a sickle cell trait prevalence of 13.0% in the SC, 12.0% in the ST and 3.4% in the OBC population. This study describes the prevalence of the β(S) gene within these groups in Central India determined by large scale community screening. This program has uncovered previously undiagnosed cases, provided detailed information to guide population-based disease counseling, prevention and comprehensive care programs.

  14. Scheduled maturation in low colorectal and coloanal anastomoses

    Directory of Open Access Journals (Sweden)

    Rubens Henrique Oleques Fernandes

    2016-10-01

    Full Text Available Introduction: Anastomotic dehiscence is the main complication after low colorectal and coloanal anastomoses. The techniques commonly used are the double-stapling and hand-sewn anastomoses, both are made with immediate maturation. These techniques do not prevent pelvic sepsis in many patients and are not feasible in all cases. Objective: The study aim is to report the technical details and results with the use of scheduled maturation anastomosis in ten patients. Surgical technique: The scheduled maturation anastomosis is done in two steps. The first step is the closure of colonic stump in a way that keeps the mucosa layer in everted position. The second step is the union of the colon and rectum ends by transanal access. All the sutures are made with 2/0 polyglactin. A diverting stoma must be done in all cases. After 30 days, begins spontaneous opening of the anastomosis. Results: Ten patients underwent this technique. There were two cases of stenosis that were treated with digital dilatation in office. All patients had their diverting ostomy closed. Conclusion: The scheduled maturation anastomosis is feasible in difficult cases and may prevent pelvic sepsis in low colorectal and coloanal anastomoses. Resumo: Introdução: A deiscência anastomótica é a principal complicação após anastomoses colorretais baixas e coloanais. As técnicas comumente usadas são o duplo grampeamento e a anastomose manual, ambas são feitas com maturação imediata. Estas técnicas não impedem a sepse pélvica em muitos pacientes e não são exequíveis em todos casos. Objetivo: O estudo mostra os detalhes da técnica e os resultados do uso da anastomose com maturação programada em dez pacientes. Técnica cirúrgica: A anastomose com maturação programada é feita em duas etapas. A primeira fase é o fechamento do coto cólico com pontos que mantém a mucosa evertida. A segunda fase é a união das extremidades do cólon e reto pela via transanal. Todas as

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

  16. 75 FR 10022 - Proposed Collection; Comment Request for Form 990 and Schedules A and B

    Science.gov (United States)

    2010-03-04

    ... Reduction Act of 1995, Public Law 104-13 (44 U.S.C. 3506(c)(2)(A)). Currently, the IRS is soliciting... 4947(a)(1) of the Internal Revenue Code (except black lung benefit trust or private foundation...), 501(f), 501(k), 501(n), or Section 4947(a)(1) Nonexempt Charitable Trust, and Schedule B, Schedule of...

  17. Efficient Academic Scheduling at the U.S. Naval Academy

    National Research Council Canada - National Science Library

    Zane, David

    2003-01-01

    This research project examined academic scheduling problems at the U.S. Naval Academy. The focus was on devising methods to construct good final exam schedules and improve existing course schedules by facilitation course changes...

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

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

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

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

  3. Expert System and Heuristics Algorithm for Cloud Resource Scheduling

    Directory of Open Access Journals (Sweden)

    Mamatha E

    2017-03-01

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

  4. 78 FR 37237 - Proposed Adjustments to the Aggregate Production Quotas for Schedule I and II Controlled...

    Science.gov (United States)

    2013-06-20

    ... class of controlled substance listed in schedules I and II and for ephedrine, pseudoephedrine, and... disposal by the registrants holding individual manufacturing quotas for the class; (2) whether any... the Aggregate Production Quotas for Schedule I and II Controlled Substances and Assessment of Annual...

  5. Evaluation of Absolute and Relative Reinforcer Value Using Progressive-Ratio Schedules

    Science.gov (United States)

    Francisco, Monica T.; Borrero, John C.; Sy, Jolene R.

    2008-01-01

    We evaluated behavior exhibited by individuals with developmental disabilities using progressive-ratio (PR) schedules. High- and low-preference stimuli were determined based on the results of a paired-stimulus preference assessment and were evaluated in subsequent reinforcer and PR assessments using concurrent and single schedules of presentation.…

  6. 78 FR 15046 - Certain Pasta From Italy and Turkey; Revised Schedule for the Subject Reviews

    Science.gov (United States)

    2013-03-08

    ... INTERNATIONAL TRADE COMMISSION [Investigation Nos. 701-TA-365-366 and 731-TA-734-735 (Third Review)] Certain Pasta From Italy and Turkey; Revised Schedule for the Subject Reviews AGENCY: United States... pasta from Italy and Turkey (78 FR 9937, February 12, 2013). The Commission is revising its schedule as...

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

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

  9. Scheduling the maintenance of gaseous diffusion and electric power distribution plants

    International Nuclear Information System (INIS)

    Chauvet, D.

    1990-01-01

    A computer aided scheduling applied to the maintenance of a uranium enrichment plant is presented. The plant exploits gaseous diffusion and electric power distribution plants, for which the operating conditions must be satisfied. The management and the execution of the maintenance actions are computer aided. Concerning the techniques, the cost, the safety and the scheduling actions were optimized [fr

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

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

  12. Development of an international schedule for the assessment and staging of care for dementia

    NARCIS (Netherlands)

    Semrau, M.; Burns, A.; Djukic-Dejanovic, S.; Eraslan, D.; Han, C.; Lecic-Tosevski, D.; Lobo, A.; Mihai, A.; Morris, J.; Palumbo, C.; Robert, P.; Stiens, G.; Stoppe, G.; Volpe, U.; Olde Rikkert, M.G.M.; Sartorius, N.

    2015-01-01

    BACKGROUND: A reliable and valid global staging scale has been lacking within dementia care. OBJECTIVE: To develop an easy-to-use multi-dimensional clinical staging schedule for dementia. METHODS: The schedule was developed through: i) Two series of focus groups (40 and 48 participants,

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

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

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

    NARCIS (Netherlands)

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

    2017-01-01

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

  16. Quality Improvement, Inventory Management, Lead Time Reduction and Production Scheduling in High-Mix Manufacturing Environments

    Science.gov (United States)

    2017-01-13

    Quality Improvement , Inventory Management, Lead Time Reduction and Production Scheduling in High-mix Manufacturing Environments by Sean Daigle B.S...Mechanical Engineering Chairman, Department Committee on Graduate Theses 2 Quality Improvement , Inventory Management, Lead Time Reduction and... Production Scheduling in High-mix Manufacturing Environments by Sean Daigle Submitted to the Department of Mechanical Engineering on January 13, 2017, in

  17. Cost effective shift schedules enhance utility operations

    International Nuclear Information System (INIS)

    Coleman, R.M.

    1995-01-01

    This article describes how new shift scheduling concepts can save utility operations millions of dollars every year and yet maintain safety and improve employee morale. The key to scheduling is to define and match the work load. This includes discretionary as well as daily, weekly, and yearly core work loads. In most power plants the overall work load (including maintenance, operations, materials handling, etc.) on day shift is greater than on other shifts, hence an unbalanced schedule would be appropriate

  18. Management of Temporal Constraints for Factory Scheduling.

    Science.gov (United States)

    1987-06-01

    consistency of scheduling decisions were implemented in both the ISIS [Fox 84] and SOJA [LePape 85a] scheduling systems. More recent work with the...kinds of time propagation systems: the symbolic and the numeric ones. Symbolic systems combine relationships with a temporal logic a la Allen [Allen 81...maintains consistency by narrowing time windows associated with activities as decisions are made, and SOJA [LePape 85b] guarantees a schedule’s

  19. Trustable Virtual Machine Scheduling in a Cloud

    OpenAIRE

    Hermenier , Fabien; Henrio , Ludovic

    2017-01-01

    International audience; In an Infrastructure As A Service (IaaS) cloud, the scheduler deploys VMs to servers according to service level objectives (SLOs). Clients and service providers must both trust the infrastructure. In particular they must be sure that the VM scheduler takes decisions that are consistent with its advertised behaviour. The difficulties to master every theoretical and practical aspects of a VM scheduler implementation leads however to faulty behaviours that break SLOs and ...

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

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

  2. Couples’ work schedules and child-care use in the Netherlands

    NARCIS (Netherlands)

    Verhoef, Melissa; Roeters, Anne; van der Lippe, Tanja

    2016-01-01

    Various aspects of parental work schedules affect the opportunities and constraints that parents encounter when arranging care for their children. This study examined the extent to which the combination of couples’ work schedules was associated with their use of different types of child care,

  3. Railway line capacity consumption of different railway signalling systems under scheduled and disturbed conditions

    NARCIS (Netherlands)

    Goverde, R.M.P.; Corman, F.; D'Ariano, A.

    2013-01-01

    This paper evaluates the capacity consumption on a Dutch railway line both under scheduled and disturbed traffic conditions. For the scheduled condition the standard UIC compression method is used, while the computation of capacity consumption under disturbed conditions requires multiple simulation

  4. Multi-flow scheduling for coordinated direct and relayed users in cellular systems

    DEFF Research Database (Denmark)

    Thai, Chan; Popovski, Petar; Kaneko, Megumi

    2013-01-01

    . Such are the Coordinated Direct/Relay (CDR) schemes, where each basic transmission involves two flows to a direct and a relayed user. Usage of MFT schemes as building blocks of more complex transmission schemes essentially changes the problem of scheduling, since some of the flows to be scheduled are coupled in a signal...

  5. Large Neighborhood Search and Adaptive Randomized Decompositions for Flexible Jobshop Scheduling

    DEFF Research Database (Denmark)

    Pacino, Dario; Van Hentenryck, Pascal

    2011-01-01

    This paper considers a constraint-based scheduling approach to the flexible jobshop, a generalization of the traditional jobshop scheduling where activities have a choice of machines. It studies both large neighborhood (LNS) and adaptive randomized de- composition (ARD) schemes, using random...

  6. Choice between Single and Multiple Reinforcers in Concurrent-Chains Schedules

    Science.gov (United States)

    Mazur, James E.

    2006-01-01

    Pigeons responded on concurrent-chains schedules with equal variable-interval schedules as initial links. One terminal link delivered a single reinforcer after a fixed delay, and the other terminal link delivered either three or five reinforcers, each preceded by a fixed delay. Some conditions included a postreinforcer delay after the single…

  7. Optimization of design and erection methods to minimize the construction time-schedule of EPR plants

    International Nuclear Information System (INIS)

    Pierrat, Michel; L'Huby, Yvan; Decelle, Alain

    1999-01-01

    This paper presents the results of the investigations made during the Basic Design of the EPR project (European Pressurized water Reactor) to shorten the construction schedule. A 57 months construction schedule can be reached for the first unit. The investigations concern both design and construction methods. (author)

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

    Science.gov (United States)

    2010-07-01

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

  9. 15 CFR 700.14 - Preferential scheduling.

    Science.gov (United States)

    2010-01-01

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

  10. A hybrid job-shop scheduling system

    Science.gov (United States)

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

    1992-01-01

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

  11. Spent nuclear fuel project integrated schedule plan

    International Nuclear Information System (INIS)

    Squires, K.G.

    1995-01-01

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

  12. Spent nuclear fuel project integrated schedule plan

    Energy Technology Data Exchange (ETDEWEB)

    Squires, K.G.

    1995-03-06

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

  13. 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 messages are statically scheduled, and we use process reexecution for recovering from multiple transient faults. We propose a finegrained transparent recovery, where the property of transparency can be selectively applied to processes and messages. Transparency hides the recovery actions in a selected part...... 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....

  14. A review of scheduling problem and resolution methods in flexible flow shop

    Directory of Open Access Journals (Sweden)

    Tian-Soon Lee

    2019-01-01

    Full Text Available The Flexible flow shop (FFS is defined as a multi-stage flow shops with multiple parallel machines. FFS scheduling problem is a complex combinatorial problem which has been intensively studied in many real world industries. This review paper gives a comprehensive exploration review on the FFS scheduling problem and guides the reader by considering and understanding different environmental assumptions, system constraints and objective functions for future research works. The published papers are classified into two categories. First is the FFS system characteristics and constraints including the problem differences and limitation defined by different studies. Second, the scheduling performances evaluation are elaborated and categorized into time, job and multi related objectives. In addition, the resolution approaches that have been used to solve FFS scheduling problems are discussed. This paper gives a comprehensive guide for the reader with respect to future research work on the FFS scheduling problem.

  15. Nonstandard Work Schedules, Family Dynamics, and Mother-Child Interactions During Early Childhood.

    Science.gov (United States)

    Prickett, Kate C

    2018-03-01

    The rising number of parents who work nonstandard schedules has led to a growing body of research concerned with what this trend means for children. The negative outcomes for children of parents who work nonstandard schedules are thought to arise from the disruptions these schedules place on family life, and thus, the types of parenting that support their children's development, particularly when children are young. Using a nationally representative sample of two-parent families (Early Childhood Longitudinal Study-Birth cohort, n = 3,650), this study examined whether mothers' and their partners' nonstandard work schedules were associated with mothers' parenting when children were 2 and 4 years old. Structural equation models revealed that mothers' and their partners' nonstandard work schedules were associated with mothers' lower scores on measures of positive and involved parenting. These associations were mediated by fathers' lower levels of participation in cognitively supportive parenting and greater imbalance in cognitively supportive tasks conducted by mothers versus fathers.

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

  17. Flow shop scheduling with heterogeneous workers

    OpenAIRE

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

    2014-01-01

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

  18. LEARNING SCHEDULER PARAMETERS FOR ADAPTIVE PREEMPTION

    OpenAIRE

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

    2015-01-01

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

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

    International Nuclear Information System (INIS)

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

    2006-01-01

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

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

  1. PRACTICAL IMPLICATIONS OF LOCATION-BASED SCHEDULING

    DEFF Research Database (Denmark)

    Andersson, Niclas; Christensen, Knud

    2007-01-01

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

  2. 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 job satisfaction, and turnover intentions. Higher schedule control might enhance the planning and delivery of strategies to prevent or cure pressure ulcers. Further research is needed to identify potential causal mechanisms by which schedule control could improve quality of care. © The Author(s) 2014.

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

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

  5. Joint Network Coding and Opportunistic Scheduling for the Bidirectional Relay Channel

    KAUST Repository

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

    2013-01-01

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

  6. Environmental surveillance master sampling schedule

    Energy Technology Data Exchange (ETDEWEB)

    Bisping, L.E.

    1993-01-01

    Environmental surveillance of the Hanford Site and surrounding areas is conducted by the Pacific Northwest Laboratory (PNL) for the US Department of Energy (DOE). Samples are routinely collected and analyzed to determine the quality of air, surface water, ground water, soil, sediment, wildlife, vegetation, foodstuffs, and farm products at Hanford Site and surrounding communities. This document contains the planned schedule for routine sample collection for the Surface Environmental Surveillance Project (SESP) and Drinking Water Project, and Ground-Water Surveillance Project.

  7. The Vessel Schedule Recovery Problem

    DEFF Research Database (Denmark)

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

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

  8. Effects on employees of controlling working hours and working schedules.

    Science.gov (United States)

    Kubo, T; Takahashi, M; Togo, F; Liu, X; Shimazu, A; Tanaka, K; Takaya, M

    2013-03-01

    High levels of control over working time and low variability in working hours have been associated with improved health-related outcomes. The potential mechanisms for this association remain unclear. To examine how work-time control and variability of working times are associated with fatigue recovery, sleep quality, work-life balance, and 'near misses' at work. Manufacturing sector employees completed a questionnaire that assessed work-time control, work-time variability, fatigue recovery, sleep quality, work-life balance and the frequency of near misses in the past 6 months. Mixed model analysis of covariance and multiple logistic regression analysis tested the main effects of work-time control and variability and their interaction, while adjusting for age, sex, work schedules, and overtime work in the past month. Subscales of work-time control were also investigated (control over daily working hours and over days off). One thousand three hundred and seventy-two completed questionnaires were returned, a response rate of 69%. A significantly higher quality of sleep and better work-life balance were found in the 'high control with low variability' reference group than in the other groups. Significantly better recovery of fatigue was also observed in the group having control over days off with low variability. While near misses were more frequent in the group with high control over daily working hours coupled with high variability compared with the reference group this was not significant. High work-time control and low variability were associated with favourable outcomes of health and work-life balance. This combined effect was not observed for the safety outcome addressed here.

  9. BIM-BASED SCHEDULING OF CONSTRUCTION

    DEFF Research Database (Denmark)

    Andersson, Niclas; Büchmann-Slorup, Rolf

    2010-01-01

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

  10. Environmental surveillance master sampling schedule

    International Nuclear Information System (INIS)

    Bisping, L.E.

    1995-02-01

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

  11. Environmental surveillance master sampling schedule

    Energy Technology Data Exchange (ETDEWEB)

    Bisping, L.E.

    1995-02-01

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

  12. Emergency Radiology Practice Patterns: Shifts, Schedules, and Job Satisfaction.

    Science.gov (United States)

    Hanna, Tarek N; Shekhani, Haris; Lamoureux, Christine; Mar, Hanna; Nicola, Refky; Sliker, Clint; Johnson, Jamlik-Omari

    2017-03-01

    To assess the practice environment of emergency radiologists with a focus on schedule, job satisfaction, and self-perception of health, wellness, and diagnostic accuracy. A survey drawing from prior radiology and health care shift-work literature was distributed via e-mail to national societies, teleradiology groups, and private practices. The survey remained open for 4 weeks in 2016, with one reminder. Data were analyzed using hypothesis testing and logistic regression modeling. Response rate was 29.6% (327/1106); 69.1% of respondents (n = 226) were greater than 40 years old, 73% (n = 240) were male, and 87% (n = 284) practiced full time. With regard to annual overnight shifts (NS): 36% (n = 118) did none, 24.9% (n = 81) did 182 or more, and 15.6% (n = 51) did 119. There was a significant association between average NS worked per year and both perceived negative health effects (P impact on memory (P job enjoyment and number of annual NS (P job" for radiologists who work no NS is 2.21 times greater than for radiologists who work at least 119 NS, when shift length is held constant. Radiologists with 11+ years of experience who work no NS or 1 to 100 NS annually have lower odds of feeling overwhelmed when compared with those working the same number of NS with job satisfaction and negative health self-perception. Copyright © 2016 American College of Radiology. Published by Elsevier Inc. All rights reserved.

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

  14. Schedule of the nuclear program

    International Nuclear Information System (INIS)

    Heigl, F.

    1977-01-01

    The lecure tries to explain the main phases which must be passed to establish nuclear power plants, the feasibility phase, preconstruction and construction phase. Each phase consists of a lot of activities which are commented. Further the lecture tries to give some ideas of durances and dependence between the phases or activities to get a complete time schedule of the realization of a nuclear power project. (HP) [de

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

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

  17. Gain scheduling using the Youla parameterization

    DEFF Research Database (Denmark)

    Niemann, Hans Henrik; Stoustrup, Jakob

    1999-01-01

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

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

    National Research Council Canada - National Science Library

    Rodin, Ervin Y

    2005-01-01

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

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

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

    Science.gov (United States)

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

    2016-08-01

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

  1. Schedules of Controlled Substances: Temporary Placement of Six Synthetic Cannabinoids (5F-ADB, 5F-AMB, 5F-APINACA, ADB-FUBINACA, MDMB-CHMICA and MDMB-FUBINACA) into Schedule I. Temporary Scheduling Order.

    Science.gov (United States)

    2017-04-10

    The Administrator of the Drug Enforcement Administration is issuing this temporary scheduling order to schedule six synthetic cannabinoids: methyl 2-(1-(5-fluoropentyl)-1H-indazole-3-carboxamido)-3,3-dimethylbutanoate [5F-ADB; 5F-MDMB-PINACA]; methyl 2-(1-(5-fluoropentyl)-1H-indazole-3-carboxamido)-3-methylbutanoate [5F-AMB]; N-(adamantan-1-yl)-1-(5-fluoropentyl)-1H-indazole-3-carboxamide [5F-APINACA, 5F-AKB48]; N-(1-amino-3,3-dimethyl-1-oxobutan-2-yl)-1-(4-fluorobenzyl)-1H-indazole-3-carboxamide [ADB-FUBINACA]; methyl 2-(1-(cyclohexylmethyl)-1H-indole-3-carboxamido)-3,3-dimethylbutanoate [MDMB-CHMICA, MMB-CHMINACA] and methyl 2-(1-(4-fluorobenzyl)-1H-indazole-3-carboxamido)-3,3-dimethylbutanoate [MDMB-FUBINACA], and their optical, positional, and geometric isomers, salts, and salts of isomers into schedule I pursuant to the temporary scheduling provisions of the Controlled Substances Act. This action is based on a finding by the Administrator that the placement of these synthetic cannabinoids into schedule I of the Controlled Substances Act is necessary to avoid an imminent hazard to the public safety. As a result of this order, the regulatory controls and administrative, civil, and criminal sanctions applicable to schedule I controlled substances will be imposed on persons who handle (manufacture, distribute, reverse distribute, import, export, engage in research, conduct instructional activities or chemical analysis, or possess), or propose to handle, 5F-ADB, 5F-AMB, 5F-APINACA, ADB-FUBINACA, MDMB-CHMICA or MDMB-FUBINACA.

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

  3. QoS Differentiated and Fair Packet Scheduling in Broadband Wireless Access Networks

    Directory of Open Access Journals (Sweden)

    Zhang Yan

    2009-01-01

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

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

    ... 1041 and Related Schedules D, J, and K-1 AGENCY: Internal Revenue Service (IRS), Treasury. ACTION..., the IRS is soliciting comments concerning Form 1041 and related Schedules D, J, and K-1, U.S. Income...), Accumulation Distribution for Certain Complex Trusts (Schedule J), and Beneficiary's Share of Income...

  5. Multiagent scheduling method with earliness and tardiness objectives in flexible job shops.

    Science.gov (United States)

    Wu, Zuobao; Weng, Michael X

    2005-04-01

    Flexible job-shop scheduling problems are an important extension of the classical job-shop scheduling problems and present additional complexity. Such problems are mainly due to the existence of a considerable amount of overlapping capacities with modern machines. Classical scheduling methods are generally incapable of addressing such capacity overlapping. We propose a multiagent scheduling method with job earliness and tardiness objectives in a flexible job-shop environment. The earliness and tardiness objectives are consistent with the just-in-time production philosophy which has attracted significant attention in both industry and academic community. A new job-routing and sequencing mechanism is proposed. In this mechanism, two kinds of jobs are defined to distinguish jobs with one operation left from jobs with more than one operation left. Different criteria are proposed to route these two kinds of jobs. Job sequencing enables to hold a job that may be completed too early. Two heuristic algorithms for job sequencing are developed to deal with these two kinds of jobs. The computational experiments show that the proposed multiagent scheduling method significantly outperforms the existing scheduling methods in the literature. In addition, the proposed method is quite fast. In fact, the simulation time to find a complete schedule with over 2000 jobs on ten machines is less than 1.5 min.

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

  7. Agent-based scheduling for aircraft deicing

    NARCIS (Netherlands)

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

    2006-01-01

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

  8. Optimal joint scheduling of electrical and thermal appliances in a smart home environment

    International Nuclear Information System (INIS)

    Shirazi, Elham; Zakariazadeh, Alireza; Jadid, Shahram

    2015-01-01

    Highlights: • Thermal appliances are scheduled based on desired temperature and energy prices. • A discomfort index has been introduced within the home energy scheduling model. • Appliances are scheduled based on activity probability and desired options. • Starting probability depends on the social random factor and consumption behavior. - Abstract: With the development of home area network, residents have the opportunity to schedule their power usage in the home by themselves aiming at reducing electricity expenses. Moreover, as renewable energy sources are deployed in home, a home energy management system needs to consider both energy consumption and generation simultaneously to minimize the energy cost. In this paper, a smart home energy management model has been presented in which electrical and thermal appliances are jointly scheduled. The proposed method aims at minimizing the electricity cost of a residential customer by scheduling various type of appliances considering the residents consumption behavior, seasonal probability, social random factor, discomfort index and appliances starting probability functions. In this model, the home central controller receives the electricity price information, environmental factors data as well as the resident desired options in order to optimally schedule appliances including electrical and thermal. The scheduling approach is tested on a typical home including variety of home appliances, a small wind turbine, photovoltaic panel, combined heat and power unit, boiler and electrical and thermal storages over a 24-h period. The results show that the scheduling of different appliances can be reached simultaneously by using the proposed formulation. Moreover, simulation results evidenced that the proposed home energy management model exhibits a lower cost and, therefore, is more economical.

  9. Decay-usage scheduling in multiprocessors

    NARCIS (Netherlands)

    Epema, D.H.J.

    1998-01-01

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

  10. 46 CFR 525.2 - Terminal schedules.

    Science.gov (United States)

    2010-10-01

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

  11. 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... opposite it. (b) Stimulants. Unless specifically excepted or unless listed in another schedule, any... a stimulant effect on the central nervous sxstem, including its salts, isomers (whether optical...

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

    Science.gov (United States)

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

    2017-09-01

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

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

    NARCIS (Netherlands)

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

    2016-01-01

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

  14. NASA Instrument Cost/Schedule Model

    Science.gov (United States)

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

    2011-01-01

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

  15. Integration of look-ahead multicast and unicast scheduling for input-queued cell switches

    DEFF Research Database (Denmark)

    Yu, Hao; Ruepp, Sarah Renée; Berger, Michael Stübert

    2012-01-01

    This paper presents an integration of multicast and unicast traffic scheduling algorithms for input-queued cell switches. The multi-level round-robin multicast scheduling (ML-RRMS) algorithm with the look-ahead (LA) mechanism provides a highly scalable architecture and is able to reduce the head...... module that filters out the conflicting requests to ensure fairness. Simulation results show that comparing with the scheme using WBA for the multicast scheduling, the scheme proposed in this paper reduces the HOL blocking problem for multicast traffic and provides a significant improvement in terms...

  16. Gender discrepancies in the outcomes of schedule control on overtime hours and income in Germany

    OpenAIRE

    Lott, Yvonne; Chung, Heejung

    2016-01-01

    Schedule control can have both positive – e.g., increased income – but also negative outcomes – e.g., increased overtime. Here our core interest is whether there are gender discrepancies in these outcomes. Given the different ways in which schedule control can be used, and perceived to be used by men and women, their outcomes are also expected to be different. This is examined using the German Socio-Economic Panel Study (2003-2011), and panel regression models. The results show that schedule ...

  17. A dynamic approach to vehicle scheduling

    NARCIS (Netherlands)

    D. Huisman (Dennis); R. Freling (Richard); A.P.M. Wagelmans (Albert)

    2001-01-01

    textabstractThis paper presents a dynamic approach to the vehicle scheduling problem. We discuss the potential benefit of our approach compared to the traditional one, where the vehicle scheduling problem is solved only once for a whole period and the travel times are assumed to be fixed. In our

  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. Management Matters. Changing to Flexible Scheduling

    Science.gov (United States)

    Pappas, Marjorie L.

    2005-01-01

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

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