WorldWideScience

Sample records for schedules

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

  2. Schedule Analytics

    Science.gov (United States)

    2016-04-30

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

  3. Online Scheduling

    OpenAIRE

    Sgall, Jiri

    2005-01-01

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

  4. Records Control Schedules Repository

    Data.gov (United States)

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

  5. Immunization Schedules for Adults

    Science.gov (United States)

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

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

  7. Class Schedules Need Class.

    Science.gov (United States)

    Monfette, Ronald J.

    1986-01-01

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

  8. Rotating Workforce Scheduling

    OpenAIRE

    Granfeldt, Caroline

    2015-01-01

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

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

  10. Combinatory CPU Scheduling Algorithm

    OpenAIRE

    Saeeda Bibi; Farooque Azam; Yasir Chaudhry

    2010-01-01

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

  11. Charlo Class Scheduling Plan.

    Science.gov (United States)

    Fiebiger, Leo J.

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

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

  13. Effects of Block Scheduling

    Directory of Open Access Journals (Sweden)

    William R. Veal

    1999-09-01

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

  14. Scheduling for production teams

    Directory of Open Access Journals (Sweden)

    Yuri Mauergauz

    2015-09-01

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

  15. Project Schedule Simulation

    DEFF Research Database (Denmark)

    Mizouni, Rabeb; Lazarova-Molnar, Sanja

    2015-01-01

    overrun both their budget and time. To improve the quality of initial project plans, we show in this paper the importance of (1) reflecting features’ priorities/risk in task schedules and (2) considering uncertainties related to human factors in plan schedules. To make simulation tasks reflect features....... By comparing EPS to classical schedules, EPS simulation provides more accurate results with regards to project goals. These instructions give you guidelines for preparing papers for Journal of Software (JSW). Use this document as a template if you are using Microsoft Word 6.0 or later. Otherwise, use...

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

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

  18. Childhood Vaccine Schedule

    Science.gov (United States)

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

  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. CERN confirms LHC schedule

    CERN Multimedia

    2003-01-01

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

  1. Registration Review Schedules

    Science.gov (United States)

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

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

  3. Probabilistic Bisimulation for Realistic Schedulers

    DEFF Research Database (Denmark)

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

    2015-01-01

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

  4. Introduction to Scheduling

    CERN Document Server

    Robert, Yves

    2009-01-01

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

  5. PAR Loop Schedule Review

    Energy Technology Data Exchange (ETDEWEB)

    Schaffer, Jr.; W.F.

    1958-04-30

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

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

  7. Routing and scheduling problems

    DEFF Research Database (Denmark)

    Reinhardt, Line Blander

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

  8. Post LS1 schedule

    CERN Document Server

    Lamont, M

    2014-01-01

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

  9. Intelligent retail logistics scheduling

    Energy Technology Data Exchange (ETDEWEB)

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

    1996-12-31

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

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

  11. CMS multicore scheduling strategy

    Energy Technology Data Exchange (ETDEWEB)

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

    2014-01-01

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

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

  13. Iterative robust multiprocessor scheduling

    NARCIS (Netherlands)

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

    2015-01-01

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

  14. Decentralized Ground Staff Scheduling

    DEFF Research Database (Denmark)

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

    2002-01-01

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

  15. DPS - Dynamic Parallel Schedules

    OpenAIRE

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

    2003-01-01

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

  16. Visualization and Simulation in Scheduling

    Directory of Open Access Journals (Sweden)

    R. Čapek

    2008-01-01

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

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

  18. Location-based Scheduling

    DEFF Research Database (Denmark)

    Andersson, Niclas; Christensen, Knud

    The coordination of activities and resources in order to establish an effective production flow is central to the management of construction projects. The traditional technique for coordination of activities and resources in construction projects is the CPM-scheduling, which has been...... on the market. However, CPM is primarily an activity based method that takes the activity as the unit of focus and there is criticism raised, specifically in the case of construction projects, on the method for deficient management of construction work and continuous flow of resources. To seek solutions...

  19. Estimating exponential scheduling preferences

    DEFF Research Database (Denmark)

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

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

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

  1. 1993 Wholesale Power and Transmission Rate Schedules.

    Energy Technology Data Exchange (ETDEWEB)

    US Bonneville Power Administration

    1993-10-01

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

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

  3. Stochastic scheduling on unrelated machines

    NARCIS (Netherlands)

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

    2014-01-01

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

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

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

  6. Constraint-Based Scheduling System

    Science.gov (United States)

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

    1995-01-01

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

  7. Bulletin publication schedule

    CERN Multimedia

    Publications Section, DG-CO Group

    2011-01-01

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

  8. TECHNICAL COORDINATION SCHEDULE & INTEGRATION

    CERN Multimedia

    W. Zeuner

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

  9. Multiuser Switched Diversity Scheduling Schemes

    CERN Document Server

    Shaqfeh, Mohammad; Alouini, Mohamed-Slim

    2012-01-01

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

  10. Robust and Flexible Scheduling with Evolutionary Computation

    DEFF Research Database (Denmark)

    Jensen, Mikkel T.

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

  11. 21 CFR 1308.12 - Schedule II.

    Science.gov (United States)

    2010-04-01

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

  12. 21 CFR 1308.14 - Schedule IV.

    Science.gov (United States)

    2010-04-01

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

  13. 21 CFR 1308.11 - Schedule I.

    Science.gov (United States)

    2010-04-01

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

  14. 21 CFR 1308.15 - Schedule V.

    Science.gov (United States)

    2010-04-01

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

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

  16. Immunization Schedules for Infants and Children

    Science.gov (United States)

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

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

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

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

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

  1. Search Strategies for Scheduling Problems

    OpenAIRE

    Kypta, Tomáš

    2012-01-01

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

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

  3. Non-clairvoyant Scheduling Games

    Science.gov (United States)

    Dürr, Christoph; Nguyen, Kim Thang

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

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

    Energy Technology Data Exchange (ETDEWEB)

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

    2002-12-31

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

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

  6. Nurse Scheduling Using Genetic Algorithm

    Directory of Open Access Journals (Sweden)

    Komgrit Leksakul

    2014-01-01

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

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

  8. Gain scheduling using the youla parameterization

    DEFF Research Database (Denmark)

    Niemann, H.H.; Stoustrup, Jakob

    1999-01-01

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

  9. Flexible Scheduling to Fit the Firefighters.

    Science.gov (United States)

    Cox, Clarice Robinson

    Three flexible scheduling plans were tried in order that firefighters could take regular college courses despite their 24 hours on the 24 off work schedule. Plan one scheduled the firefighters into a regular Monday-Wednesday-Friday class which they attended every other week, making up missed material outside of class. Plan two scheduled special…

  10. Optimal randomized scheduling by replacement

    Energy Technology Data Exchange (ETDEWEB)

    Saias, I.

    1996-05-01

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

  11. Environmental surveillance master sampling schedule

    Energy Technology Data Exchange (ETDEWEB)

    Bisping, L.E.

    1997-01-01

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

  12. Fuzzy scheduled RTDA controller design.

    Science.gov (United States)

    Srinivasan, K; Anbarasan, K

    2013-03-01

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

  13. Schedulability Analysis for Java Finalizers

    DEFF Research Database (Denmark)

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

    2010-01-01

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

  14. Hubble Systems Optimize Hospital Schedules

    Science.gov (United States)

    2009-01-01

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

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

  16. Support system for process flow scheduling

    OpenAIRE

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

    2001-01-01

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

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

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

  19. Endogenous scheduling preferences and congestion

    DEFF Research Database (Denmark)

    Fosgerau, Mogens; Small, Kenneth

    2010-01-01

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

  20. Lifetime improvement by battery scheduling

    NARCIS (Netherlands)

    Jongerden, M.R.; Haverkort, Boudewijn R.H.M.

    The use of mobile devices is often limited by the lifetime of its battery. For devices that have multiple batteries or that have the option to connect an extra battery, battery scheduling, thereby exploiting the recovery properties of the batteries, can help to extend the system lifetime. Due to the

  1. Lifetime Improvement by Battery Scheduling

    NARCIS (Netherlands)

    Jongerden, M.R.; Schmitt, Jens B.; Haverkort, Boudewijn R.H.M.

    The use of mobile devices is often limited by the lifetime of their batteries. For devices that have multiple batteries or that have the option to connect an extra battery, battery scheduling, thereby exploiting the recovery properties of the batteries, can help to extend the system lifetime. Due to

  2. Endogenous scheduling preferences and congestion

    DEFF Research Database (Denmark)

    Fosgerau, Mogens; Small, Kenneth

    2010-01-01

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

  3. Scheduling EURO-k Conferences

    DEFF Research Database (Denmark)

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

    2017-01-01

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

  4. Robustness analysis of multiprocessor schedules

    NARCIS (Netherlands)

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

    2014-01-01

    Tasks executing on general purpose multiprocessor platforms exhibit variations in their execution times. As such, there is a need to explicitly consider robustness, i.e., tolerance to these fluctuations. This work aims to quantify the robustness of schedules of directed acyclic graphs (DAGs) on

  5. Intelligent perturbation algorithms for space scheduling optimization

    Science.gov (United States)

    Kurtzman, Clifford R.

    1991-01-01

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

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

    NARCIS (Netherlands)

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

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

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

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

    Science.gov (United States)

    2012-10-23

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

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

  10. The CHI 2013 interactive schedule

    DEFF Research Database (Denmark)

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

    2013-01-01

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

  11. On Optimal Deadlock Detection Scheduling

    OpenAIRE

    Ling, Yibei; Chen, Shigang; Chiang, Cho-Yu Jason

    2010-01-01

    Deadlock detection scheduling is an important, yet often overlooked problem that can significantly affect the overall performance of deadlock handling. Excessive initiation of deadlock detection increases overall message usage, resulting in degraded system performance in the absence of deadlocks; while insufficient initiation of deadlock detection increases the deadlock persistence time, resulting in an increased deadlock resolution cost in the presence of deadlocks. The investigation of this...

  12. Nurse Scheduling Using Genetic Algorithm

    OpenAIRE

    Leksakul, Komgrit; Phetsawat, Sukrit

    2014-01-01

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

  13. A Decision Support System for Academic Scheduling.

    Science.gov (United States)

    Burleson, Donald K.; Leivano, Rodrigo J.

    1986-01-01

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

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

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

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

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

  18. Self-optimization aspects for dynamic scheduling

    OpenAIRE

    Pereira, Ivo; Madureira, Ana Maria

    2010-01-01

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

  19. Partially clairvoyant scheduling for aggregate constraints

    OpenAIRE

    Subramani, K.

    2005-01-01

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

  20. PRACTICAL IMPLICATIONS OF LOCATION-BASED SCHEDULING

    OpenAIRE

    Andersson, Niclas; Christensen, Knud

    2007-01-01

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

  1. 75 FR 7411 - Schedule of Water Charges

    Science.gov (United States)

    2010-02-19

    ... COMMISSION 18 CFR Part 410 Schedule of Water Charges AGENCY: Delaware River Basin Commission. ACTION: Notice... Regulations--Water Supply Charges to revise the schedule of water charges. DATES: The Commission will hold a... the subject line ``Schedule of Water Charges.'' FOR FURTHER INFORMATION, CONTACT: Please contact Paula...

  2. An improved scheduling algorithm for linear networks

    KAUST Repository

    Bader, Ahmed

    2017-02-09

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

  3. 21 CFR 1308.49 - Emergency scheduling.

    Science.gov (United States)

    2010-04-01

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

  4. A planning language for activity scheduling

    Science.gov (United States)

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

    1991-01-01

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

  5. PRACTICAL IMPLICATIONS OF LOCATION-BASED SCHEDULING

    DEFF Research Database (Denmark)

    Andersson, Niclas; Christensen, Knud

    2007-01-01

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

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

  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. Schedule optimization study implementation plan

    Energy Technology Data Exchange (ETDEWEB)

    1993-11-01

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

  9. Environmental surveillance master sampling schedule

    Energy Technology Data Exchange (ETDEWEB)

    Bisping, L.E.

    1994-02-01

    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 the onsite drinking water falls outside the scope of the SESP. The Hanford Environmental Health Foundation is responsible for monitoring the nonradiological parameters as defined in the National Drinking Water Standards while PNL conducts the radiological monitoring of the onsite drinking water. PNL conducts the drinking water monitoring project concurrent with the SESP to promote efficiency and consistency, utilize the 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.

  10. Extending the range of linear scheduling in highway construction

    OpenAIRE

    Bafna, Tarun

    1991-01-01

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

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

  12. On Coding of Scheduling Information in OFDM

    OpenAIRE

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

    2009-01-01

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

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

    OpenAIRE

    Kroon, Leo; Fischetti, Matteo

    2000-01-01

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

  14. Religion as Schedule-Induced Behavior

    OpenAIRE

    Strand, Paul S

    2009-01-01

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

  15. Distributed Link Scheduling with Constant Overhead

    OpenAIRE

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

    2006-01-01

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

  16. AVLIS production plant project schedule and milestones

    Energy Technology Data Exchange (ETDEWEB)

    1984-11-15

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

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

    Science.gov (United States)

    2010-07-22

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

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

    NARCIS (Netherlands)

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

    2014-01-01

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

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

  20. 29 CFR 1952.173 - Developmental schedule.

    Science.gov (United States)

    2010-07-01

    ... 29 Labor 9 2010-07-01 2010-07-01 false Developmental schedule. 1952.173 Section 1952.173 Labor Regulations Relating to Labor (Continued) OCCUPATIONAL SAFETY AND HEALTH ADMINISTRATION, DEPARTMENT OF LABOR... schedule. (a) Within 1 year following plan approval, legislation will be enacted authorizing complete...

  1. Lightweight EDF Scheduling with Deadline Inheritance

    NARCIS (Netherlands)

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

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

  2. Special cases of online parallel job scheduling

    NARCIS (Netherlands)

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

    2007-01-01

    In this paper we consider the online scheduling of jobs, which require processing on a number of machines simultaneously. These jobs are presented to a decision maker one by one, where the next job becomes known as soon as the current job is scheduled. The objective is to minimize the makespan. For

  3. 15 CFR 700.14 - Preferential scheduling.

    Science.gov (United States)

    2010-01-01

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

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

  5. Clustering and scheduling maintenance tasks over time

    OpenAIRE

    Kreuger, Per

    2008-01-01

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

  6. HEURISTIC SCHEDULING IN A NIGERIA FURNITURE SHOP

    African Journals Online (AJOL)

    NIJOTECH

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

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

  8. Scheduling identical jobs on uniform parallel machines

    NARCIS (Netherlands)

    M.I. Dessouky; B.J. Lageweg; J.K. Lenstra (Jan Karel); S.L. van de Velde

    1990-01-01

    textabstractWe address the problem of scheduling n identical jobs on m uniform parallel machines to optimize scheduling criteria that are nondecreasing in the job completion times. It is well known that this can be formulated as a linear assignment problem, and subsequently solved in O(n3) time. We

  9. Religion as Schedule-Induced Behavior

    Science.gov (United States)

    Strand, Paul S.

    2009-01-01

    In this article, I argue that a class of religious behaviors exists that is induced, for prepared organisms, by specific stimuli that are experienced according to a response-independent schedule. Like other schedule-induced behaviors, the members of this class serve as minimal units out of which functional behavior may arise. In this way, there…

  10. Sensitivity Analysis of List Scheduling Heuristics

    NARCIS (Netherlands)

    A.W.J. Kolen; A.H.G. Rinnooy Kan (Alexander); C.P.M. van Hoesel; A.P.M. Wagelmans (Albert)

    1994-01-01

    textabstractWhen jobs have to be processed on a set of identical parallel machines so as to minimize the makespan of the schedule, list scheduling rules form a popular class of heuristics. The order in which jobs appear on the list is assumed here to be determined by the relative size of their

  11. A computational approach to optimized appointment scheduling

    NARCIS (Netherlands)

    Kuiper, A.; Kemper, B.; Mandjes, M.

    2015-01-01

    Appointment scheduling is prevalent in various healthcare settings. Generally, the objective is to determine a schedule (i.e., the sequence of epochs at which the individual patients are asked to appear) that appropriately balances the interests of the patients (low waiting times) and the medical

  12. 21 CFR 1308.13 - Schedule III.

    Science.gov (United States)

    2010-04-01

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

  13. Optimal online-list batch scheduling

    NARCIS (Netherlands)

    Paulus, J.J.; Ye, Deshi; Zhang, Guochuan

    We consider the online-list batch scheduling problem. Jobs arrive one by one and have to be assigned upon arrival to a scheduled batch such that the makespan is minimized. Each batch can accommodate up to B jobs. We give a complete classification of the tractability of this online problem.

  14. Unrelated Machine Scheduling with Stochastic Processing Times

    NARCIS (Netherlands)

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

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

  15. Machine scheduling with resource dependent processing times

    NARCIS (Netherlands)

    Grigoriev, A.; Sviridenko, M.; Uetz, Marc Jochen

    We consider machine scheduling on unrelated parallel machines with the objective to minimize the schedule makespan. We assume that, in addition to its machine dependence, the processing time of any job is dependent on the usage of a discrete renewable resource, e.g. workers. A given amount of that

  16. 76 FR 18262 - January 2011 Pay Schedules

    Science.gov (United States)

    2011-04-01

    ... members covered by a certified SES performance appraisal system and $165,300 (level III of the Executive Schedule) for SES members covered by an SES performance appraisal system that has not been certified. The... (level II of the Executive Schedule) for SL or ST employees covered by a certified SL/ST performance...

  17. Schedule-extended synchronous dataflow graphs

    NARCIS (Netherlands)

    Damavandpeyma, M.; Stuijk, S.; Basten, T.; Geilen, M.; Corporaal, H.

    2013-01-01

    Synchronous dataflow graphs (SDFGs) are used extensively to model streaming applications. An SDFG can be extended with scheduling decisions, allowing SDFG analysis to obtain properties, such as throughput or buffer sizes for the scheduled graphs. Analysis times depend strongly on the size of the

  18. A Heuristic Approach to Scheduling University Timetables.

    Science.gov (United States)

    Loo, E. H.; And Others

    1986-01-01

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

  19. A Program Master Schedule Can Improve Results

    Science.gov (United States)

    2014-02-01

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

  20. Improved MLWDF scheduler for LTE downlink transmission

    Science.gov (United States)

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

    2016-11-01

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

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

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

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

  4. Development of an Irrigation Scheduling Model

    Directory of Open Access Journals (Sweden)

    BAKHSHAL KHAN LASHARI

    2010-10-01

    Full Text Available This paper presents an irrigation scheduling software named ?Mehran Model? which computes reference evapotranspiration (ETo using FAO-56 Penman Monteith method and crop evapotranspiration (ETc by dual crop coefficients. The model can develop irrigation schedules for sixty-six crop types using soil and water balance approach. The model distinguishes soil texture classes, irrigation methods, and designs real time irrigation schedule for a crop using daily weather data of a reference site. The Mehran Model also includes planning on demand basis as well as rotational (warabandi irrigation schedules, and synchronizes both systems as well. The model has been field tested and validated on planning and management of irrigation schedules for cotton and wheat crops in Lower Indus Basin of Pakistan. Statistical analysis showed that the model at an average overestimated seasonal ETc of cotton and wheat crop by 2.41% and 4.31% respectively.

  5. Production scheduling with ant colony optimization

    Science.gov (United States)

    Chernigovskiy, A. S.; Kapulin, D. V.; Noskova, E. E.; Yamskikh, T. N.; Tsarev, R. Yu

    2017-10-01

    The optimum solution of the production scheduling problem for manufacturing processes at an enterprise is crucial as it allows one to obtain the required amount of production within a specified time frame. Optimum production schedule can be found using a variety of optimization algorithms or scheduling algorithms. Ant colony optimization is one of well-known techniques to solve the global multi-objective optimization problem. In the article, the authors present a solution of the production scheduling problem by means of an ant colony optimization algorithm. A case study of the algorithm efficiency estimated against some others production scheduling algorithms is presented. Advantages of the ant colony optimization algorithm and its beneficial effect on the manufacturing process are provided.

  6. MEDICAL STAFF SCHEDULING USING SIMULATED ANNEALING

    Directory of Open Access Journals (Sweden)

    Ladislav Rosocha

    2015-07-01

    Full Text Available Purpose: The efficiency of medical staff is a fundamental feature of healthcare facilities quality. Therefore the better implementation of their preferences into the scheduling problem might not only rise the work-life balance of doctors and nurses, but also may result into better patient care. This paper focuses on optimization of medical staff preferences considering the scheduling problem.Methodology/Approach: We propose a medical staff scheduling algorithm based on simulated annealing, a well-known method from statistical thermodynamics. We define hard constraints, which are linked to legal and working regulations, and minimize the violations of soft constraints, which are related to the quality of work, psychic, and work-life balance of staff.Findings: On a sample of 60 physicians and nurses from gynecology department we generated monthly schedules and optimized their preferences in terms of soft constraints. Our results indicate that the final value of objective function optimized by proposed algorithm is more than 18-times better in violations of soft constraints than initially generated random schedule that satisfied hard constraints.Research Limitation/implication: Even though the global optimality of final outcome is not guaranteed, desirable solutionwas obtained in reasonable time. Originality/Value of paper: We show that designed algorithm is able to successfully generate schedules regarding hard and soft constraints. Moreover, presented method is significantly faster than standard schedule generation and is able to effectively reschedule due to the local neighborhood search characteristics of simulated annealing.

  7. Mission Operations Planning and Scheduling System (MOPSS)

    Science.gov (United States)

    Wood, Terri; Hempel, Paul

    2011-01-01

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

  8. Downlink Scheduling for Multiclass Traffic in LTE

    Directory of Open Access Journals (Sweden)

    Madan Ritesh

    2009-01-01

    Full Text Available We present a design of a complete and practical scheduler for the 3GPP Long Term Evolution (LTE downlink by integrating recent results on resource allocation, fast computational algorithms, and scheduling. Our scheduler has low computational complexity. We define the computational architecture and describe the exact computations that need to be done at each time step (1 milliseconds. Our computational framework is very general, and can be used to implement a wide variety of scheduling rules. For LTE, we provide quantitative performance results for our scheduler for full buffer, streaming video (with loose delay constraints, and live video (with tight delay constraints. Simulations are performed by selectively abstracting the PHY layer, accurately modeling the MAC layer, and following established network evaluation methods. The numerical results demonstrate that queue- and channel-aware QoS schedulers can and should be used in an LTE downlink to offer QoS to a diverse mix of traffic, including delay-sensitive flows. Through these results and via theoretical analysis, we illustrate the various design tradeoffs that need to be made in the selection of a specific queue-and-channel-aware scheduling policy. Moreover, the numerical results show that in many scenarios strict prioritization across traffic classes is suboptimal.

  9. NRC comprehensive records disposition schedule. Revision 3

    Energy Technology Data Exchange (ETDEWEB)

    NONE

    1998-02-01

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

  10. Simultaneous scheduling of machines and mobile robots

    DEFF Research Database (Denmark)

    Dang, Vinh Quang; Nielsen, Izabela Ewa

    2013-01-01

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

  11. Scheduling Network Traffic for Grid Purposes

    DEFF Research Database (Denmark)

    Gamst, Mette

    This thesis concerns scheduling of network traffic in grid context. Grid computing consists of a number of geographically distributed computers, which work together for solving large problems. The computers are connected through a network. When scheduling job execution in grid computing, data...... transmission has so far not been taken into account. This causes stability problems, because data transmission takes time and thus causes delays to the execution plan. This thesis proposes the integration of job scheduling and network routing. The scientific contribution is based on methods from operations...

  12. Starshade Observation Scheduling for WFIRST

    Science.gov (United States)

    Soto, Gabriel; Garrett, Daniel; Delacroix, Christian; Savransky, Dmitry

    2018-01-01

    An exoplanet direct imaging mission can employ an external starshade for starlight suppression to achieve higher contrasts and potentially higher throughput than with an internal coronagraph. This separately-launched starshade spacecraft is assumed to maintain a single, constant separation distance from the space telescope—for this study, the Wide Field Infrared Survey Telescope (WFIRST)—based on a designated inner working angle during integration times. The science yield of such a mission can be quantified using the Exoplanet Open-Source Imaging Simulator (EXOSIMS): this simulator determines the distributions of mission outcomes, such as the types and amount of exoplanet detections, based on ensembles of end-to-end simulations of the mission. This study adds a starshade class to the survey simulation module of EXOSIMS and outlines a method for efficiently determining observation schedules. The new starshade class solves boundary value problems using circular restricted three-body dynamics to find fast, high-accuracy estimates of the starshade motion while repositioning between WFIRST observations. Fuel usage dictates the mission lifetime of the starshade given its limited fuel supply and is dominated by the Δv used to reposition the starshade between the LOS of different targets; the repositioning time-of-flight is kept constant in this study. A starshade burns less fuel to reach certain target stars based on their relative projected positions on a skymap; other targets with costly transfers can be filtered out to increase the starshade mission duration. Because the initial target list can consist of nearly 2000 stars, calculating the Δv required to move the starshade to every other star on the target list would be too computationally expensive and renders running ensembles of survey simulations infeasible. Assuming the starshade begins its transfer at the LOS of a certain star, a Δv curve is approximated for the remaining target stars based on their right

  13. Physician Fee Schedule Carrier Specific Files

    Data.gov (United States)

    U.S. Department of Health & Human Services — The Centers for Medicare and Medicaid Services (CMS) has condensed all 56 Physician Fee Schedule (PFS) carrier specific pricing files into one zip file. It is...

  14. Oversubscribed Mission Scheduler Conflict Resolution System Project

    Data.gov (United States)

    National Aeronautics and Space Administration — The allocation and scheduling of limited communication assets to an increasing number of satellites and other spacecraft remains a complex and challenging problem....

  15. Strategic Gang Scheduling for Railroad Maintenance

    Science.gov (United States)

    2012-08-14

    We address the railway track maintenance scheduling problem. The problem stems from the : significant percentage of the annual budget invested by the railway industry for maintaining its railway : tracks. The process requires consideration of human r...

  16. Nonblocking Scheduling for Web Service Transactions

    DEFF Research Database (Denmark)

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

    2007-01-01

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

  17. A Scheduling Problem in the Baking Industry

    National Research Council Canada - National Science Library

    da Silva, Felipe Augusto Moreira; Moretti, Antonio Carlos; de Azevedo, Anibal Tavares

    2014-01-01

      This paper addresses a scheduling problem in an actual industrial environment of a baking industry where production rates have been growing every year and the need for optimized planning becomes...

  18. Integrated Job Scheduling and Network Routing

    DEFF Research Database (Denmark)

    Gamst, Mette; Pisinger, David

    2013-01-01

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

  19. Job Scheduling in a Heterogeneous Grid Environment

    Science.gov (United States)

    Shan, Hong-Zhang; Smith, Warren; Oliker, Leonid; Biswas, Rupak

    2004-01-01

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

  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. Home Appliance Load Scheduling with SEMIAH

    DEFF Research Database (Denmark)

    Jacobsen, Rune Hylsberg; Ghasem Azar, Armin; Zhang, Qi

    2015-01-01

    The European research project SEMIAH aims at designing a scalable infrastructure for residential demand response. This paper presents the progress towards a centralized load scheduling algorithm for controlling home appliances taking power grid constraints and satisfaction of consumers into account....

  2. Onboard Autonomous Scheduling Intelligence System Project

    Data.gov (United States)

    National Aeronautics and Space Administration — Scheduling the daily activities of the crew on a human space mission is currently a cumbersome job performed by a large team of operations experts on the ground....

  3. Monitoring Building Systems for Schedule Compliance

    Energy Technology Data Exchange (ETDEWEB)

    Jensen, Andrew M.; Belew, Shan T.

    2013-02-19

    As Pacific Northwest National Laboratory (PNNL) initiated a Core Business Hours program, it became a challenge to ensure that the hundreds of systems campus wide were operating within their programmed schedules. Therefore, a collaborative exchange between PNNL operations and PNNL researchers developing the Decision Support for Operations and Maintenance (DSOM) software package was initiated to create a tool to solve this problem. This new DSOM tool verifies systems are operating within scheduled operation times by polling Building Automation and Control Network (BACnet) identifiers of systems’ on/off or command statuses. The tool records the time spent in operation state (ON) and totalizes each system over a rolling 7-day period, highlighting systems that are running over the scheduled hours. This snapshot view allows building management to look quickly at the entire campus to ensure that systems are not operating beyond their scheduled hours.

  4. Partially clairvoyant scheduling for aggregate constraints

    Directory of Open Access Journals (Sweden)

    K. Subramani

    2005-01-01

    constraints. In this paper, we extend the class of constraints for which partially clairvoyant schedules can be determined efficiently, to include aggregate constraints. Aggregate constraints form a strict superset of standard constraints and can be used to model performance metrics.

  5. Cure Schedule for Stycast 2651/Catalyst 11.

    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 Henkel technical data sheet (TDS) for Stycast 2651/Catalyst 11 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 was motivated by (1) a desire to cure at a single temperature for ease of manufacture and (2) a desire to keep the cure temperature low (to minimize residual stress build-up associated with the cooldown from the cure temperature to room temperature) without excessively limiting the cure reaction due to vitrification (i.e., material glass transition temperature, Tg, exceeding cure temperature).

  6. Schedule Sales Query Report Generation System

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

  7. A Cyclical Nurse Schedule Using Goal Programming

    Directory of Open Access Journals (Sweden)

    Ruzzakiah Jenal

    2011-11-01

    Full Text Available Scheduling is a very tedious task in organizations where duty is around the clock. Constructing timetable for nurses in hospital is one of the challenging jobs for the head nurse or nurse manager. It requires a lot of time to spend for generating a good and fair timetable. Thus, in this study, we propose a cyclical nurse scheduling model using a 0-1 goal programming that would help the head nurse or nurse manager to have less effort on building new schedules periodically. The proposed model satisfies the stated hospital’s policies and the nurses’ preferences. The result obtained from this model gives an optimal solution where all goals are achieved. The model also provides an unbiased way of scheduling the nurses and thus leads to an overall higher satisfaction and fairness to the nurses and the hospital management.

  8. Firefighter Shift Schedules Affect Sleep Quality.

    Science.gov (United States)

    Billings, Joel; Focht, Will

    2016-03-01

    The aim of this study was to investigate the prevalence and severity of firefighter sleep quality across department shift schedules. Sleep quality was assessed using a Pittsburgh Sleep Quality Index in a sample of 109 male career firefighters from six fire departments in three Southwestern US states. The three shift schedules studied were 24on/48off, 48on/96off, and Kelly. Seventy-three percent of firefighters report poor sleep quality. The 24on/48off shift schedule is associated with the best sleep quality and Kelly is associated with the worst sleep quality. Firefighters working second jobs report significantly poorer sleep quality than those who do not. Shift schedules that disrupt normal circadian rhythms more result in poorer sleep quality, which can lead to less effective emergency response and increased risk to firefighter health and safety.

  9. Feedback Scheduling: An Event-Driven Paradigm

    OpenAIRE

    Xia, Feng; Tian, Guosong; Sun, Youxian

    2008-01-01

    Embedded computing systems today increasingly feature resource constraints and workload variability, which lead to uncertainty in resource availability. This raises great challenges to software design and programming in multitasking environments. In this paper, the emerging methodology of feedback scheduling is introduced to address these challenges. As a closed-loop approach to resource management, feedback scheduling promises to enhance the flexibility and resource efficiency of various sof...

  10. Advanced Reactors Transition Program Resource Loaded Schedule

    Energy Technology Data Exchange (ETDEWEB)

    GANTT, D.A.

    2000-01-12

    The Advanced Reactors Transition (ART) Resource Loaded Schedule (RLS) provides a cost and schedule baseline for managing the project elements within the ART Program. The Fast Flux Test Facility (FETF) activities are delineated through the end of FY 2000, assuming continued standby. The Nuclear Energy (NE) Legacies and Plutonium Recycle Test Reactor (PRTR) activities are delineated through the end of the deactivation process. This revision reflects the 19 Oct 1999 baseline.

  11. Advanced Reactors Transition Program Resource Loaded Schedule

    Energy Technology Data Exchange (ETDEWEB)

    BOWEN, W.W.

    1999-11-08

    The Advanced Reactors Transition (ART) Resource Loaded Schedule (RLS) provides a cost and schedule baseline for managing the project elements within the ART Program. The Fast Flux Test Facility (FFTF) activities are delineated through the end of FY 2000, assuming continued standby. The Nuclear Energy (NE) Legacies and Plutonium Recycle Test Reactor (PRTR) activities are delineated through the end of the deactivation process. This document reflects the 1 Oct 1999 baseline.

  12. Synchronized sweep algorithms for scalable scheduling constraints

    OpenAIRE

    Letort, Arnaud; Carlsson, Mats; Beldiceanu, Nicolas

    2013-01-01

    This report introduces a family of synchronized sweep based filtering algorithms for handling scheduling problems involving resource and precedence constraints. The key idea is to filter all constraints of a scheduling problem in a synchronized way in order to scale better. In addition to normal filtering mode, the algorithms can run in greedy mode, in which case they perform a greedy assignment of start and end times. The filtering mode achieves a significant speed-up over ...

  13. 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-based sched...... should be prioritized and coordinated with each craft, a process library should be introduced to promote transfer of knowledge and continuous improvements, and information flow between design and scheduling processes must change from push to pull....

  14. Maritime wideband communication networks video transmission scheduling

    CERN Document Server

    Yang, Tingting

    2014-01-01

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

  15. Revised data taking schedule with ion beams

    CERN Document Server

    Gazdzicki, Marek; Aduszkiewicz, A; Andrieu, B; Anticic, T; Antoniou, N; Argyriades, J; Asryan, A G; Baatar, B; Blondel, A; Blumer, J; Boldizsar, L; Bravar, A; Brzychczyk, J; Bubak, A; Bunyatov, S A; Choi, K U; Christakoglou, P; Chung, P; Cleymans, J; Derkach, D A; Diakonos, F; Dominik, W; Dumarchez, J; Engel, R; Ereditato, A; Feofilov, G A; Fodor, Z; Ferrero, A; Gazdzicki, M; Golubeva, M; Grebieszkow, K; Grzeszczuk, A; Guber, F; Hasegawa, T; Haungs, A; Igolkin, S; Ivanov, A S; Ivashkin, A; Kadija, K; Katrynska, N; Kielczewska, D; Kikola, D; Kisiel, J; Kobayashi, T; Kolesnikov, V I; Kolev, D; Kolevatov, R S; Kondratiev, V P; Kowalski, S; Kurepin, A; Lacey, R; Laszlo, A; Lyubushkin, V V; Majka, Z; I Malakhov, A; Marchionni, A; Marcinek, A; Maris, I; Matveev, V; Melkumov, G L; Meregaglia, A; Messina, M; Mijakowski, P; Mitrovski, M; Montaruli, T; Mrówczynski, St; Murphy, S; Nakadaira, T; Naumenko, P A; Nikolic, V; Nishikawa, K; Palczewski, T; Pálla, G; Panagiotou, A D; Peryt, W; Planeta, R; Pluta, J; Popov, B A; Posiadala, M; Przewlocki, P; Rauch, W; Ravonel, M; Renfordt, R; Röhrich, D; Rondio, E; Rossi, B; Roth, M; Rubbia, A; Rybczynski, M; Sadovskii, A; Sakashita, K; Schuster, T; Sekiguchi, T; Seyboth, P; Shibata, M; Sissakian, A N; Skrzypczak, E; Slodkowski, M; Sorin, A S; Staszel, P; Stefanek, G; Stepaniak, J; Strabel, C; Ströbele, H; Susa, T; Szentpétery, I; Szuba, M; Tada, M; Taranenko, A; Tsenov, R; Ulrich, R; Unger, M; Vassiliou, M; Vechernin, V V; Vesztergombi, G; Wlodarczyk, Z; Wojtaszek, A; Zipper, W; CERN. Geneva. SPS and PS Experiments Committee; SPSC

    2009-01-01

    This document presents the revised data taking schedule of NA61 with ion beams. The revision takes into account limitations due to the new LHC schedule as well as final results concerning the physics performance with secondary ion beams. It is proposed to take data with primary Ar and Xe beams in 2012 and 2014, respectively, and to test and use for physics a secondary B beam from primary Pb beam fragmentation in 2010, 2011 and 2013.

  16. An approach to process production reactive scheduling.

    Science.gov (United States)

    Hauptman, Bostjan; Jovan, Vladimir

    2004-04-01

    Process manufacturing has some characteristics that make it different from other types of industry. In practice, there are many examples of process industrial settings where production resources are shared and there is no intermediate storage between two processing units. Perhaps the most important issue usually to be excluded from the academic discussion of process production scheduling/control problems is the uncertainty of the duration of real chemical processes. These properties of process manufacturing result in blocking, no-wait, and other constraints that must be taken into account during designing the production scheduling system. The first part of the paper addresses some features of process manufacturing and their influence on production scheduling. The main part of the paper analyzes the scheduling problems under the presence of typical process constraints and unpredictable process duration times and introduces a simple and reliable approach to avoid these problems. The proposed concept is presented on a case study of an industrial two-stage washing batch subprocess. It is considered that the presented approach would be relatively easy to implement in a process production scheduling system and that it can contribute to more effective process production scheduling.

  17. Prescribed Travel Schedules for Fatigue Management

    Science.gov (United States)

    Whitmire, Alexandra; Johnston, Smith; Lockley, Steven

    2011-01-01

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

  18. Chip Attach Scheduling in Semiconductor Assembly

    Directory of Open Access Journals (Sweden)

    Zhicong Zhang

    2013-01-01

    Full Text Available Chip attach is the bottleneck operation in semiconductor assembly. Chip attach scheduling is in nature unrelated parallel machine scheduling considering practical issues, for example, machine-job qualification, sequence-dependant setup times, initial machine status, and engineering time. The major scheduling objective is to minimize the total weighted unsatisfied Target Production Volume in the schedule horizon. To apply Q-learning algorithm, the scheduling problem is converted into reinforcement learning problem by constructing elaborate system state representation, actions, and reward function. We select five heuristics as actions and prove the equivalence of reward function and the scheduling objective function. We also conduct experiments with industrial datasets to compare the Q-learning algorithm, five action heuristics, and Largest Weight First (LWF heuristics used in industry. Experiment results show that Q-learning is remarkably superior to the six heuristics. Compared with LWF, Q-learning reduces three performance measures, objective function value, unsatisfied Target Production Volume index, and unsatisfied job type index, by considerable amounts of 80.92%, 52.20%, and 31.81%, respectively.

  19. Optimal Schedules in Multitask Motor Learning.

    Science.gov (United States)

    Lee, Jeong Yoon; Oh, Youngmin; Kim, Sung Shin; Scheidt, Robert A; Schweighofer, Nicolas

    2016-04-01

    Although scheduling multiple tasks in motor learning to maximize long-term retention of performance is of great practical importance in sports training and motor rehabilitation after brain injury, it is unclear how to do so. We propose here a novel theoretical approach that uses optimal control theory and computational models of motor adaptation to determine schedules that maximize long-term retention predictively. Using Pontryagin's maximum principle, we derived a control law that determines the trial-by-trial task choice that maximizes overall delayed retention for all tasks, as predicted by the state-space model. Simulations of a single session of adaptation with two tasks show that when task interference is high, there exists a threshold in relative task difficulty below which the alternating schedule is optimal. Only for large differences in task difficulties do optimal schedules assign more trials to the harder task. However, over the parameter range tested, alternating schedules yield long-term retention performance that is only slightly inferior to performance given by the true optimal schedules. Our results thus predict that in a large number of learning situations wherein tasks interfere, intermixing tasks with an equal number of trials is an effective strategy in enhancing long-term retention.

  20. Analysis of gain scheduled control for nonlinear plants

    Science.gov (United States)

    Shamma, Jeff S.; Athans, Michael

    1990-01-01

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

  1. Enabling a New Planning and Scheduling Paradigm

    Science.gov (United States)

    Jaap, John; Davis, Elizabeth

    2004-01-01

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

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

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

    Science.gov (United States)

    Moore, J. E.

    1975-01-01

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

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

  5. Hybrid stop schedule of urban rail train

    Directory of Open Access Journals (Sweden)

    Zhengmin Tan

    2015-01-01

    Full Text Available Purpose: In order to better serve the transport demand of urban area by rail, target at the Ur-ban Rail Train Stop Schedule problem.Design/methodology/approach: Bi-level mathematical programming model and game relation was used.Findings: A 0-1 bi-level mathematical programming model for urban rail transit hybrid Stop Schedule is developed when game relation between train Stop Schedule and passenger transfer choice is considered.Research limitations/implications: The research is still in progress. Practical implications: ChongQing urban rail line 2 was taken as an example, the practical application of the model has proved its feasibility and efficiency.Originality/value: A 0-1 bi-level mathematical programming model for urban rail transit hybrid Stop Schedule is developed. The upper level model is Stop Schedule targeting at the optimal profit from the operators side. The lower level model is passenger routing aims to minimize total travel time. According to its features, the bi-level model is integrated in order to be directly solvable by optimizing software.

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

  7. Analysis of crimes committed against scheduled tribes

    Science.gov (United States)

    Khadse, Vivek P.; Akhil, P.; Anto, Christopher; Gnanasigamani, Lydia J.

    2017-11-01

    One of the curses to the society is a crime which has a deep impact on the society. Victims of crimes are the one who is impacted the most. All communities in the world are affected by crime and the criminal justice system, but largely impacted communities are the backward classes. There are many cases reported of crime committed against scheduled tribes from the year 2005 till date. This paper states the analysis of Crimes Committed against Scheduled Tribes in the year 2015 in various states and union territories in India. In this study, Multiple Linear regression techniques have been used to analyze the crimes committed against scheduled tribes’ community in India. This study compares the number of cases reported to the police station and rate of crime committed in different states in India. It also states the future prediction of the crime that would happen. It will also predict the number of cases of crime committed against the scheduled tribe that can be reported in future. The dataset which has been used in this study is taken from official Indian government repository for crimes which include different information of crimes committed against scheduled tribes in different states and union territories measured under the population census of the year 2011. This study will help different Indian states and union territory government to analyze and predict the future crimes that may occur and take appropriate measures against it before the actual crime would occur.

  8. Human choice under schedules of negative reinforcement.

    Science.gov (United States)

    Alessandri, Jérôme; Cançado, Carlos R X

    2015-12-01

    The generalized matching equation provides a good description of response allocation in concurrent schedules of positive reinforcement in nonhumans as well as in humans. The present experiment was conducted to further investigate the allocation of responding under concurrent schedules of negative reinforcement (i.e., timeouts from pressing a force cell) in humans. Each of three participants was exposed to different reinforcement ratios (9:1, 1:1 and 1:9) in the terminal links of a concurrent-chains schedule of negative reinforcement. The allocation of responding under this schedule was well described by the generalized matching equation, for each participant. These results replicate previous findings obtained with nonhumans and humans under concurrent schedules of positive reinforcement. In addition, they extend the results reported by Alessandri and Rivière (2013) showing that human behavior maintained by timeouts from an effortful response is sensitive to changes in relative reinforcement ratios as well as relative delays of reinforcement. Copyright © 2015 Elsevier B.V. All rights reserved.

  9. Generalized multiprocessor scheduling for directed acylic graphs

    Energy Technology Data Exchange (ETDEWEB)

    Prasanna, G.N.S. [AT and T Bell Labs., Murray Hill, NJ (United States); Musicus, B.R. [Bolt, Beranek, and Newman, Inc., Cambridge, MA (United States)

    1994-12-31

    This paper considerably extends the multiprocessor scheduling techniques in the authors` previous work, and applies it to matrix arithmetic compilation. In that paper, they presented several new results in the theory of homogeneous multiprocessor scheduling. A directed acyclic graph (DAG) of tasks is to be scheduled. Tasks are assumed to be parallelizable -- as more processors are applied to a task, the time taken to compute it decreases, yielding some speedup. Because of communication, synchronization, and task scheduling overhead, this speedup increases less than linearly with the number of processors applied. The optimal scheduling problem is to determine the number of processors assigned to each task, and task sequencing, to minimize the finishing time. Using optimal control theory, in the special case where the speedup function of each task is p{sup {alpha}}, where p is the amount of processing power applied to the task, a closed form solution for task graphs formed from parallel and series connections was derived. This paper extends these results for arbitrary DAGS. The optimality conditions impose nonlinear constraints on the flow of processing power from predecessors to successors, and on the finishing times of siblings. This paper presents a fast algorithm for determining and solving these nonlinear equations. The algorithm utilizes the structure of the finishing time equations to efficiently run a conjugate gradient minimization, leading to the optimal solution. The algorithm has been tested on a variety of DAGS. The results presented show that it is superior to alternative heuristic approaches.

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

    NARCIS (Netherlands)

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

    2017-01-01

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

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

  12. Investigations into Generalization of Constraint-Based Scheduling Theories with Applications to Space Telescope Observation Scheduling

    Science.gov (United States)

    Muscettola, Nicola; Smith, Steven S.

    1996-09-01

    This final report summarizes research performed under NASA contract NCC 2-531 toward generalization of constraint-based scheduling theories and techniques for application to space telescope observation scheduling problems. Our work into theories and techniques for solution of this class of problems has led to the development of the Heuristic Scheduling Testbed System (HSTS), a software system for integrated planning and scheduling. Within HSTS, planning and scheduling are treated as two complementary aspects of the more general process of constructing a feasible set of behaviors of a target system. We have validated the HSTS approach by applying it to the generation of observation schedules for the Hubble Space Telescope. This report summarizes the HSTS framework and its application to the Hubble Space Telescope domain. First, the HSTS software architecture is described, indicating (1) how the structure and dynamics of a system is modeled in HSTS, (2) how schedules are represented at multiple levels of abstraction, and (3) the problem solving machinery that is provided. Next, the specific scheduler developed within this software architecture for detailed management of Hubble Space Telescope operations is presented. Finally, experimental performance results are given that confirm the utility and practicality of the approach.

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

    NARCIS (Netherlands)

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

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

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

    NARCIS (Netherlands)

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

    2005-01-01

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

  15. Investigations into Generalization of Constraint-Based Scheduling Theories with Applications to Space Telescope Observation Scheduling

    Science.gov (United States)

    Muscettola, Nicola; Smith, Steven S.

    1996-01-01

    This final report summarizes research performed under NASA contract NCC 2-531 toward generalization of constraint-based scheduling theories and techniques for application to space telescope observation scheduling problems. Our work into theories and techniques for solution of this class of problems has led to the development of the Heuristic Scheduling Testbed System (HSTS), a software system for integrated planning and scheduling. Within HSTS, planning and scheduling are treated as two complementary aspects of the more general process of constructing a feasible set of behaviors of a target system. We have validated the HSTS approach by applying it to the generation of observation schedules for the Hubble Space Telescope. This report summarizes the HSTS framework and its application to the Hubble Space Telescope domain. First, the HSTS software architecture is described, indicating (1) how the structure and dynamics of a system is modeled in HSTS, (2) how schedules are represented at multiple levels of abstraction, and (3) the problem solving machinery that is provided. Next, the specific scheduler developed within this software architecture for detailed management of Hubble Space Telescope operations is presented. Finally, experimental performance results are given that confirm the utility and practicality of the approach.

  16. 77 FR 63766 - Schedules of Controlled Substances: Placement of Methylone Into Schedule I

    Science.gov (United States)

    2012-10-17

    ...- methylenedioxypyrovalerone (MDPV)) into Schedule I pursuant to the temporary scheduling provisions of the CSA (76 FR 55616... section 202(c) of the CSA to include mephedrone and MDPV but not methylone, and amended section 201(h)(2... Health for HHS for methylone, mephedrone and MDPV pursuant to 21 U.S.C. 811(b). Upon receipt and...

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

    Science.gov (United States)

    2010-01-01

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

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

    Science.gov (United States)

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

    1988-01-01

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

  19. Automated Scheduling of Science Activities for Titan Encounters by Cassini

    Science.gov (United States)

    Ray, Trina L.; Knight, Russel L.; Mohr, Dave

    2014-01-01

    In an effort to demonstrate the efficacy of automated planning and scheduling techniques for large missions, we have adapted ASPEN (Activity Scheduling and Planning Environment) [1] and CLASP (Compressed Large-scale Activity Scheduling and Planning) [2] to the domain of scheduling high-level science goals into conflict-free operations plans for Titan encounters by the Cassini spacecraft.

  20. System/360 Computer Assisted Network Scheduling (CANS) System

    Science.gov (United States)

    Brewer, A. C.

    1972-01-01

    Computer assisted scheduling techniques that produce conflict-free and efficient schedules have been developed and implemented to meet needs of the Manned Space Flight Network. CANS system provides effective management of resources in complex scheduling environment. System is automated resource scheduling, controlling, planning, information storage and retrieval tool.

  1. 40 CFR 147.2921 - Schedule of compliance.

    Science.gov (United States)

    2010-07-01

    ...-Class II Wells § 147.2921 Schedule of compliance. The permit may, when appropriate, specify a schedule... 40 Protection of Environment 22 2010-07-01 2010-07-01 false Schedule of compliance. 147.2921.... (a) Any schedule of compliance shall require compliance as soon as possible, and in no case later...

  2. Topology-based hierarchical scheduling using deficit round robin

    DEFF Research Database (Denmark)

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

    2009-01-01

    This paper proposes a topology-based hierarchical scheduling scheme using Deficit Round Robin (DRR). The main idea of the topology-based hierarchical scheduling is to map the topology of the connected network into the logical structure of the scheduler, and combine several token schedulers...

  3. Global Scheduling Heuristics for Multicore Architecture

    Directory of Open Access Journals (Sweden)

    D. C. Kiran

    2015-01-01

    Full Text Available This work discusses various compiler level global scheduling techniques for multicore processors. The main contribution of the work is to delegate the job of exploiting fine grained parallelism to the compiler, thereby reducing the hardware overhead and the programming complexity. This goal is achieved by decomposing a sequential program into multiple subblocks and constructing subblock dependency graph (SDG. The proposed schedulers select subblocks from the SDG and schedules it on different cores, by ensuring the correct order of execution of subblocks. In conjunction with parallelization techniques, locality optimizations are performed to minimize communication overhead between the cores. The results observed are indicative of better and balanced speed-up per watt.

  4. Energy-aware scheduling on multiprocessor platforms

    CERN Document Server

    Li, Dawei

    2014-01-01

    Multiprocessor platforms play important roles in modern computing systems, and appear in various applications, ranging from energy-limited hand-held devices to large data centers. As the performance requirements increase, energy-consumption in these systems also increases signi cantly. Dynamic Voltage and Frequency Scaling (DVFS), which allows processors to dynamically adjust the supply voltage and the clock frequency to operate on di erent power/energy levels, is considered an e ective way to achieve the goal of energy-saving. This book surveys existing works that have been on energy-aware task scheduling on DVFS multiprocessor platforms. Energy-aware scheduling problems are intrinsically optimization problems, the formulations of which greatly depend on the platform and task models under consideration. Thus, Energy-aware Scheduling on Multiprocessor Platforms covers current research on this topic and classi es existing works according to two key standards, namely, homogeneity/heterogeneity of multi processo...

  5. An introduction to optimal satellite range scheduling

    CERN Document Server

    Vázquez Álvarez, Antonio José

    2015-01-01

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

  6. Scheduling jobs that arrive over time

    Energy Technology Data Exchange (ETDEWEB)

    Phillips, C. [Sandia National Labs., Albuquerque, NM (United States); Stein, C. [Dartmouth Coll., Hanover, NH (United States); Wein, J. [Polytechnic Univ., Brooklyn, NY (United States). Dept. of Computer Science

    1995-04-06

    A natural and basic problem in scheduling theory is to provide good average quality of service to a stream of jobs that arrive over time. In this paper we consider the problem of scheduling n jobs that are released over time in order to minimize the average completion time of the set of jobs. In contrast to the problem of minimizing average completion time when all jobs are available at time 0, all the problems that we consider are NP-hard, and essentially nothing was known about constructing good approximations in polynomial time. We give the first constant-factor approximation algorithms for several variants of the single and parallel machine model. Many of the algorithms are based on interesting algorithmic and structural relationships between preemptive and nonpreemptive schedules and linear programming relaxations of both. Many of the algorithms generalize to the minimization of average weighted completion time as well.

  7. Optimal Scheduling of Domestic Appliances via MILP

    Directory of Open Access Journals (Sweden)

    Zdenek Bradac

    2014-12-01

    Full Text Available This paper analyzes a consumption scheduling mechanism for domestic appliances within a home area network. The aim of the proposed scheduling is to minimize the total energy price paid by the consumer and to reduce power peaks in order to achieve a balanced daily load schedule. An exact and computationally efficient mixed-integer linear programming (MILP formulation of the problem is presented. This model is verified by several problem instances. Realistic scenarios based on the real price tariffs commercially available in the Czech Republic are calculated. The results obtained by solving the optimization problem are compared with a simulation of the ripple control service currently used by many domestic consumers in the Czech Republic.

  8. A progressive-duration schedule of reinforcement.

    Science.gov (United States)

    Gulotta, Kara B; Byrne, Tom

    2015-12-01

    We describe a schedule of reinforcement involving systematic, within-session increases in response-duration requirements. Rats received access to appetitive reinforcers for depressing and holding down a response lever. Duration requirements increased after each reinforcer delivery. Sessions ended when reinforcement criteria were unmet for a period of ten minutes. Breaking points, defined as the terminal duration requirement in effect prior to the end of the session, stabilized when environmental conditions were held constant. Breaking points were sensitive to manipulations of both food deprivation and reinforcer quality. Analogous to progressive-ratio schedules, progressive-duration schedules may provide an assay for measuring the amount of behavior an organism will emit for a given reinforcer under current motivational conditions. Copyright © 2015 Elsevier B.V. All rights reserved.

  9. Scheduling support for transactional memory contention management

    DEFF Research Database (Denmark)

    Maldonado, Walther; Marler, Patrick; Felber, Pascal

    2010-01-01

    Transactional Memory (TM) is considered as one of the most promising paradigms for developing concurrent applications. TM has been shown to scale well on >multiple cores when the data access pattern behaves "well," i.e., when few conflicts are induced. In contrast, data patterns with frequent write......-management has been proposed for increasing TM efficiency under high-contention [2, 5, 19]. However, only user-level schedulers have been considered. In this work, we propose, implement and evaluate several novel kernel-level scheduling support mechanisms for TM contention management. We also investigate...... different strategies for efficient communication between the kernel and the user-level TM library. To the best of our knowledge, our work is the first to investigate kernel-level support for TM contention management. We have introduced kernel-level TM scheduling support into both the Linux and Solaris...

  10. Cost and schedule estimation study report

    Science.gov (United States)

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

    1993-01-01

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

  11. A heuristic approach to incremental and reactive scheduling

    Science.gov (United States)

    Odubiyi, Jide B.; Zoch, David R.

    1989-01-01

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

  12. Scheduling Operations for Massive Heterogeneous Clusters

    Science.gov (United States)

    Humphrey, John; Spagnoli, Kyle

    2013-01-01

    High-performance computing (HPC) programming has become increasingly difficult with the advent of hybrid supercomputers consisting of multicore CPUs and accelerator boards such as the GPU. Manual tuning of software to achieve high performance on this type of machine has been performed by programmers. This is needlessly difficult and prone to being invalidated by new hardware, new software, or changes in the underlying code. A system was developed for task-based representation of programs, which when coupled with a scheduler and runtime system, allows for many benefits, including higher performance and utilization of computational resources, easier programming and porting, and adaptations of code during runtime. The system consists of a method of representing computer algorithms as a series of data-dependent tasks. The series forms a graph, which can be scheduled for execution on many nodes of a supercomputer efficiently by a computer algorithm. The schedule is executed by a dispatch component, which is tailored to understand all of the hardware types that may be available within the system. The scheduler is informed by a cluster mapping tool, which generates a topology of available resources and their strengths and communication costs. Software is decoupled from its hardware, which aids in porting to future architectures. A computer algorithm schedules all operations, which for systems of high complexity (i.e., most NASA codes), cannot be performed optimally by a human. The system aids in reducing repetitive code, such as communication code, and aids in the reduction of redundant code across projects. It adds new features to code automatically, such as recovering from a lost node or the ability to modify the code while running. In this project, the innovators at the time of this reporting intend to develop two distinct technologies that build upon each other and both of which serve as building blocks for more efficient HPC usage. First is the scheduling and dynamic

  13. Service scheduling for WWW traffic in GPRS

    Science.gov (United States)

    Shen, Qingguo

    2004-04-01

    Transmission scheduling algorithm for WWW traffic in GPRS needs to be optimized according to characteristics of Temporary Block Flow, TCP/IP and mobile access behavior. We analyze the radio resource allocation problem in GPRS and design a new scheduling algorithm FIFO-with-flow. It is simple and can adapt to temporal flows, and allocate bandwidth among temporal flows fairly. Based on the characteristics of mobile user access behavior, we determine the wireless WWW traffic model and its parameters reflecting TCP congest control. We simulate and compare the performance of FIFO-with-flow and FIFO. The FIFO-with-flow can support more WWW users than FIFO.

  14. Real-time systems scheduling 2 focuses

    CERN Document Server

    Chetto, Maryline

    2014-01-01

    Real-time systems are used in a wide range of applications, including control, sensing, multimedia, etc. Scheduling is a central problem for these computing/communication systems since it is responsible for software execution in a timely manner. This book, the second of two volumes on the subject, brings together knowledge on specific topics and discusses the recent advances for some of them.  It addresses foundations as well as the latest advances and findings in real-time scheduling, giving comprehensive references to important papers, but the chapters are short and not overloaded with co

  15. Real-time systems scheduling fundamentals

    CERN Document Server

    Chetto, Maryline

    2014-01-01

    Real-time systems are used in a wide range of applications, including control, sensing, multimedia, etc.  Scheduling is a central problem for these computing/communication systems since responsible of software execution in a timely manner. This book provides state of knowledge in this domain with special emphasis on the key results obtained within the last decade. This book addresses foundations as well as the latest advances and findings in Real-Time Scheduling, giving all references to important papers. But nevertheless the chapters will be short and not overloaded with confusing details.

  16. Planning, scheduling, and control for automatic telescopes

    Science.gov (United States)

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

    1992-01-01

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

  17. Long-term home care scheduling

    DEFF Research Database (Denmark)

    Gamst, Mette; Jensen, Thomas Sejr

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

  18. Load scheduling for decentralized CHP plants

    DEFF Research Database (Denmark)

    Nielsen, Henrik Aalborg, orlov 31.07.2008; Madsen, Henrik; Nielsen, Torben Skov

    .91) the calculations can be performed quickly enough to allow use to be applicable in practice. One optimal schedule covering one week can easily be found within 5 to 10 seconds. When considering many possible realizations of the future heat demand some techniques are needed to reduce the amount of CPU time required....... The results indicate that it is possible to find optimal schedules for 100 realizations of heat demand using less than 3 minutes of CPU time. Furthermore, the methods allow for massive use of parallel processing....

  19. Group Elevator Peak Scheduling Based on Robust Optimization Model

    OpenAIRE

    Zhang, J.; Q. Zong

    2013-01-01

    Scheduling of Elevator Group Control System (EGCS) is a typical combinatorial optimization problem. Uncertain group scheduling under peak traffic flows has become a research focus and difficulty recently. RO (Robust Optimization) method is a novel and effective way to deal with uncertain scheduling problem. In this paper, a peak scheduling method based on RO model for multi-elevator system is proposed. The method is immune to the uncertainty of peak traffic flows, optimal scheduling is re...

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

  1. Crane Scheduling for a Plate Storage

    DEFF Research Database (Denmark)

    Hansen, Jesper; Clausen, Jens

    2002-01-01

    Odense Steel Shipyard produces the worlds largest container ships. The first process of producing the steel ships is handling arrival and storage of steel plates until they are needed in production. This paper considers the problem of scheduling two cranes that carry out the movements of plates...

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

    African Journals Online (AJOL)

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

  3. Stochastic online scheduling on parallel machines

    NARCIS (Netherlands)

    Persiano, G; Megow, N.; Uetz, Marc Jochen; Solis-Oba, R; Vredeveld, T.

    We consider a non-preemptive, stochastic parallel machine scheduling model with the goal to minimize the weighted completion times of jobs. In contrast to the classical stochastic model where jobs with their processing time distributions are known beforehand, we assume that jobs appear one by one,

  4. 29 CFR 1952.161 - Developmental schedule.

    Science.gov (United States)

    2010-07-01

    ... 29 Labor 9 2010-07-01 2010-07-01 false Developmental schedule. 1952.161 Section 1952.161 Labor Regulations Relating to Labor (Continued) OCCUPATIONAL SAFETY AND HEALTH ADMINISTRATION, DEPARTMENT OF LABOR... provided by the plan: (a) Enabling legislation becomes effective (Chapter 88 of Iowa Code)—July 1972. (b...

  5. 29 CFR 1952.201 - Developmental schedule.

    Science.gov (United States)

    2010-07-01

    ... Regulations Relating to Labor (Continued) OCCUPATIONAL SAFETY AND HEALTH ADMINISTRATION, DEPARTMENT OF LABOR... schedule. (a) Retraining of present occupational safety and health personnel during March-May 1973; (b... legislation, August 1, 1973; (d) Regulations on variances, August 1973; (e) Management information system...

  6. A Comparison of Software Schedule Estimators

    Science.gov (United States)

    1990-09-01

    illustrat- ed by the release of the 80386 micro-processor by Intel Corporation before the development of an operating system for the 80286 micro-processor...Analysis Reports covering probability profiles for meeting schedule and effort, a Work Breakdown 34 Plan, a Code Production Plan, a CPU Usage Plan, a

  7. 37 CFR 2.85 - Classification schedules.

    Science.gov (United States)

    2010-07-01

    ... Intellectual Property Organization, unless the International Bureau corrects the classification. Classes cannot... Intellectual Property Organization. (1) If international classification changes pursuant to the Nice Agreement... 37 Patents, Trademarks, and Copyrights 1 2010-07-01 2010-07-01 false Classification schedules. 2...

  8. The LSST Scheduler from design to construction

    Science.gov (United States)

    Delgado, Francisco; Reuter, Michael A.

    2016-07-01

    The Large Synoptic Survey Telescope (LSST) will be a highly robotic facility, demanding a very high efficiency during its operation. To achieve this, the LSST Scheduler has been envisioned as an autonomous software component of the Observatory Control System (OCS), that selects the sequence of targets in real time. The Scheduler will drive the survey using optimization of a dynamic cost function of more than 200 parameters. Multiple science programs produce thousands of candidate targets for each observation, and multiple telemetry measurements are received to evaluate the external and the internal conditions of the observatory. The design of the LSST Scheduler started early in the project supported by Model Based Systems Engineering, detailed prototyping and scientific validation of the survey capabilities required. In order to build such a critical component, an agile development path in incremental releases is presented, integrated to the development plan of the Operations Simulator (OpSim) to allow constant testing, integration and validation in a simulated OCS environment. The final product is a Scheduler that is also capable of running 2000 times faster than real time in simulation mode for survey studies and scientific validation during commissioning and operations.

  9. Scheduling of container storage and retrieval

    NARCIS (Netherlands)

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

    2009-01-01

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

  10. Intelligence amplification framework for enhancing scheduling processes

    NARCIS (Netherlands)

    Dobrkovic, Andrej; Liu, Luyao; Iacob, Maria Eugenia; van Hillegersberg, Jos

    2016-01-01

    The scheduling process in a typical business environment consists of predominantly repetitive tasks that have to be completed in limited time and often containing some form of uncertainty. The intelligence amplification is a symbiotic relationship between a human and an intelligent agent. This

  11. Scheduling drayage operations in synchromodal transport

    NARCIS (Netherlands)

    Rivera, Arturo E.Pérez; Mes, Martijn R.K.; Bektas, Tolga; Coniglio, Stefano; Martinez-Sykora, Antonio; Voss, Stefan

    2017-01-01

    We study the problem of scheduling drayage operations in synchromodal transport. Besides the usual decisions to time the pick-up and delivery of containers, and to route the vehicles that transport them, synchromodal transport includes the assignment of terminals for empty and loaded containers. The

  12. Parental Work Schedules and Children's Cognitive Trajectories

    Science.gov (United States)

    Han, Wen-Jui; Fox, Liana E.

    2011-01-01

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

  13. 6 CFR 27.210 - Submissions schedule.

    Science.gov (United States)

    2010-01-01

    ... Domestic Security DEPARTMENT OF HOMELAND SECURITY, OFFICE OF THE SECRETARY CHEMICAL FACILITY ANTI-TERRORISM STANDARDS Chemical Facility Security Program § 27.210 Submissions schedule. (a) Initial Submission. The... of any of the chemicals listed in appendix A at or above the STQ for any applicable Security Issue...

  14. LTE uplink scheduling - Flow level analysis

    NARCIS (Netherlands)

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

    2011-01-01

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

  15. LTE uplink scheduling - flow level analysis

    NARCIS (Netherlands)

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

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

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

  17. 76 FR 10233 - Schedule of Water Charges

    Science.gov (United States)

    2011-02-24

    ... COMMISSION 18 CFR Part 420 Schedule of Water Charges AGENCY: Delaware River Basin Commission. ACTION: Final...--Water Supply Charges. Accordingly, the Commission's water charging rates for consumptive use and non.... FOR FURTHER INFORMATION CONTACT: For questions about the water charging program, please contact Ms...

  18. DEVELOPMENT OF A MAINTENANCE SCHEDULING MODEL FOR ...

    African Journals Online (AJOL)

    This paper presents the development of an efficient method for use in obtaining the best time between coordinated overhauls for a group of machines. The method is capable of stating the overhaul frequency of each machine within this time period. For convenience in the formulation of the model, maintenance schedule ...

  19. Flexible Scheduling in Multimedia Kernels: An Overview

    NARCIS (Netherlands)

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

    1999-01-01

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

  20. Modeling the Optimization of Intermodal Train Schedules

    DEFF Research Database (Denmark)

    Pedersen, Michael Berliner; Crainic, Teodor Gabriel

    to those of direct door-to-door transportation. An intuitive idea is to reduce excess waiting time by synchronizing the schedules of the routes in the intermodal network. In this session we present a model based on the multicommodity network design problem that captures the synchronization aspect...

  1. Maximizing System Lifetime by Battery Scheduling

    NARCIS (Netherlands)

    Jongerden, M.R.; Haverkort, Boudewijn R.H.M.; Bohnenkamp, H.C.; Katoen, Joost P.

    2009-01-01

    The use of mobile devices is limited by the battery lifetime. Some devices have the option to connect an extra battery, or to use smart battery-packs with multiple cells to extend the lifetime. In these cases, scheduling the batteries over the load to exploit recovery properties usually extends the

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

    African Journals Online (AJOL)

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

  3. An integrated scheduling and program management system

    Science.gov (United States)

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

    2012-09-01

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

  4. Scheduling Policies for an Antiterrorist Surveillance System

    Science.gov (United States)

    2008-06-27

    times; for example, see Reiman and Wein [17] and Olsen [15]. For real-time scheduling problems involving impatient customers, see Gaver et al. [2...heavy traffic with throughput time constraints: Asymptotically optimal dynamic controls. Queueing Systems 39, 23–54. 30 [17] Reiman , M. I. and Wein

  5. Online Scheduling in Distributed Message Converter Systems

    NARCIS (Netherlands)

    Risse, Thomas; Wombacher, Andreas; Surridge, Mike; Taylor, Steve; Aberer, Karl

    The optimal distribution of jobs among hosts in distributed environments is an important factor to achieve high performance. The optimal strategy depends on the application. In this paper we present a new online scheduling strategy for distributed EDI converter system. The strategy is based on the

  6. Step-by-step cyclic processes scheduling

    DEFF Research Database (Denmark)

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

    2013-01-01

    Automated Guided Vehicles (AGVs) fleet scheduling is one of the big problems in Flexible Manufacturing System (FMS) control. The problem is more complicated when concurrent multi-product manufacturing and resource deadlock avoidance policies are considered. The objective of the research is to pro...

  7. Simplified scheduling for underwater acoustic networks

    NARCIS (Netherlands)

    van Kleunen, W.A.P.; Meratnia, Nirvana; Havinga, Paul J.M.

    The acoustic propagation speed under water poses significant challenges to the design of underwater sensor networks and their medium access control protocols. Similar to the air, scheduling transmissions under water has significant impact on throughput, energy consumption, and reliability. In this

  8. Advance Resource Provisioning in Bulk Data Scheduling

    Energy Technology Data Exchange (ETDEWEB)

    Balman, Mehmet

    2012-10-01

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

  9. Execution Time Estimation for Workflow Scheduling

    NARCIS (Netherlands)

    Chirkin, A.M.; Belloum, A..S.Z.; Kovalchuk, S.V.; Makkes, M.X.

    2014-01-01

    Estimation of the execution time is an important part of the workflow scheduling problem. The aim of this paper is to highlight common problems in estimating the workflow execution time and propose a solution that takes into account the complexity and the randomness of the workflow components and

  10. Execution time estimation for workflow scheduling

    NARCIS (Netherlands)

    Chirkin, A.M.; Belloum, A.S.Z.; Kovalchuk, S.V.; Makkes, M.X.; Melnik, M.A.; Visheratin, A.A.; Nasonov, D.A.

    2017-01-01

    Estimation of the execution time is an important part of the workflow scheduling problem. The aim of this paper is to highlight common problems in estimating the workflow execution time and propose a solution that takes into account the complexity and the stochastic aspects of the workflow

  11. 5 CFR 1631.14 - Fee schedule.

    Science.gov (United States)

    2010-01-01

    ... 5 Administrative Personnel 3 2010-01-01 2010-01-01 false Fee schedule. 1631.14 Section 1631.14 Administrative Personnel FEDERAL RETIREMENT THRIFT INVESTMENT BOARD AVAILABILITY OF RECORDS Production or... service. This will include the cost of operating the central processing unit (CPU) for that portion of...

  12. 44 CFR 5.46 - Fee schedule.

    Science.gov (United States)

    2010-10-01

    ... SECURITY GENERAL PRODUCTION OR DISCLOSURE OF INFORMATION Fees § 5.46 Fee schedule. (a) Manual searches for... processing unit (CPU) for that portion of operating time that is directly attributable to searching for... production of the tape or printout. If FEMA estimates that the allowable duplication charges are likely to...

  13. Split scheduling with uniform setup times.

    NARCIS (Netherlands)

    F. Schalekamp; R.A. Sitters (René); S.L. van der Ster; L. Stougie (Leen); V. Verdugo; A. van Zuylen

    2015-01-01

    htmlabstractWe study a scheduling problem in which jobs may be split into parts, where the parts of a split job may be processed simultaneously on more than one machine. Each part of a job requires a setup time, however, on the machine where the job part is processed. During setup, a

  14. Scheduling sport tournaments using constraint logic programming

    NARCIS (Netherlands)

    A. Schaerf

    1997-01-01

    textabstractWe tackle the problem of scheduling the matches of a round robin tournament for a sport league. We formally define the problem, state its computational complexity, and present a solution algorithm using a two-step approach. The first step is the creation of a tournament pattern and is

  15. Schedule and status of irradiation experiments

    Energy Technology Data Exchange (ETDEWEB)

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

    1998-09-01

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

  16. 77 FR 11599 - January 2012 Pay Schedules

    Science.gov (United States)

    2012-02-27

    ... performance appraisal system and $165,300 (level III of the Executive Schedule) for SL or ST employees covered... performance appraisal systems in 2012 for SES members and employees in SL and ST positions also must apply a... members covered by a certified SES performance appraisal system and $165,300 (level III of the Executive...

  17. 78 FR 37246 - January 2013 Pay Schedules

    Science.gov (United States)

    2013-06-20

    ... or ST employees covered by a certified SL/ST performance appraisal system and $165,300 (level III of the Executive Schedule) for SL or ST employees covered by an SL/ST performance appraisal system that... performance appraisal system that has not been certified. The minimum rate of basic pay for the senior-level...

  18. 5 CFR 293.404 - Retention schedule.

    Science.gov (United States)

    2010-01-01

    ... RECORDS Employee Performance File System Records § 293.404 Retention schedule. (a)(1) Except as provided... prescribe and consistent with § 293.405(a). (3) Appraisals of unacceptable performance, where a notice of... performance-related documents five years old or less shall be forwarded in the Employee Performance File along...

  19. Physician Fee Schedule National Payment Amount File

    Data.gov (United States)

    U.S. Department of Health & Human Services — The significant size of the Physician Fee Schedule Payment Amount File-National requires that database programs (e.g., Access, dBase, FoxPro, etc.) be used to read...

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

  1. Crane Scheduling on a Plate Storage

    DEFF Research Database (Denmark)

    Hansen, Jesper

    2002-01-01

    OSS produces the worlds largest container ships. The first process of producing the steel ships is handling arrival and storage of steel plates until they are needed in production. Two gantry cranes carry out this task. The planning task is now to create a schedule of movements for the 2 cranes...

  2. Heterogeneous batch structures in throughput scheduling

    NARCIS (Netherlands)

    Weeda, P.J.; Weeda, P.J.

    1993-01-01

    Recently a few papers appeared on throughput scheduling, dealing with the relationship between batch structure and process structure in discrete batch production, while maximizing time-constrained throughput. Results have been concentrated on the class of homogeneous batch structures, i.e. batch

  3. 29 CFR 1956.43 - Developmental schedule.

    Science.gov (United States)

    2010-07-01

    ... 29 Labor 9 2010-07-01 2010-07-01 false Developmental schedule. 1956.43 Section 1956.43 Labor Regulations Relating to Labor (Continued) OCCUPATIONAL SAFETY AND HEALTH ADMINISTRATION, DEPARTMENT OF LABOR (CONTINUED) STATE PLANS FOR THE DEVELOPMENT AND ENFORCEMENT OF STATE STANDARDS APPLICABLE TO STATE AND LOCAL...

  4. 29 CFR 1956.51 - Developmental schedule.

    Science.gov (United States)

    2010-07-01

    ... 29 Labor 9 2010-07-01 2010-07-01 false Developmental schedule. 1956.51 Section 1956.51 Labor Regulations Relating to Labor (Continued) OCCUPATIONAL SAFETY AND HEALTH ADMINISTRATION, DEPARTMENT OF LABOR (CONTINUED) STATE PLANS FOR THE DEVELOPMENT AND ENFORCEMENT OF STATE STANDARDS APPLICABLE TO STATE AND LOCAL...

  5. 29 CFR 1956.61 - Developmental Schedule.

    Science.gov (United States)

    2010-07-01

    ... 29 Labor 9 2010-07-01 2010-07-01 false Developmental Schedule. 1956.61 Section 1956.61 Labor Regulations Relating to Labor (Continued) OCCUPATIONAL SAFETY AND HEALTH ADMINISTRATION, DEPARTMENT OF LABOR (CONTINUED) STATE PLANS FOR THE DEVELOPMENT AND ENFORCEMENT OF STATE STANDARDS APPLICABLE TO STATE AND LOCAL...

  6. Artificial intelligence for the CTA Observatory scheduler

    Science.gov (United States)

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

    2014-08-01

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

  7. Scheduling Broadcasts in a Network of Timelines

    KAUST Repository

    Manzoor, Emaad A.

    2015-05-12

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

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

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

  10. Achieving reutilization of scheduling software through abstraction and generalization

    Science.gov (United States)

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

    1995-01-01

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

  11. Online Scheduling in Manufacturing A Cumulative Delay Approach

    CERN Document Server

    Suwa, Haruhiko

    2013-01-01

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

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

  13. Group Elevator Peak Scheduling Based on Robust Optimization Model

    Directory of Open Access Journals (Sweden)

    ZHANG, J.

    2013-08-01

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

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

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

    Science.gov (United States)

    2011-02-01

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

  17. 77 FR 64032 - Schedules of Controlled Substances: Extension of Temporary Placement of Methylone Into Schedule I...

    Science.gov (United States)

    2012-10-18

    ..., namely mephedrone (4-methyl-N-methylcathinone), MDPV (3,4- methylenedioxypyrovalerone) and methylone... completed, whichever occurs first. \\3\\ Section 1152 of FDASIA controlled mephedrone and MDPV as Schedule I...

  18. Analyzing Job Aware Scheduling Algorithm in Hadoop for Heterogeneous Cluster

    Directory of Open Access Journals (Sweden)

    Mayuri A Mehta

    2015-12-01

    Full Text Available A scheduling algorithm is required to efficiently manage cluster resources in a Hadoop cluster, thereby to increase resource utilization and to reduce response time. The job aware scheduling algorithm schedules non-local map tasks of jobs based on job execution time, earliest deadline first or workload of the job. In this paper, we present the performance evaluation of the job aware scheduling algorithm using MapReduce WordCount benchmark. The experimental results are compared with matchmaking scheduling algorithm. The results show that the job aware scheduling algorithm reduces average waiting time and memory wastage considerably as compared to matchmaking algorithm.

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

    Science.gov (United States)

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

    2006-01-01

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

  20. Scheduling of resource-constrained projects

    CERN Document Server

    Klein, Robert

    2000-01-01

    Project management has become a widespread instrument enabling organizations to efficiently master the challenges of steadily shortening product life cycles, global markets and decreasing profit margins. With projects increasing in size and complexity, their planning and control represents one of the most crucial management tasks. This is especially true for scheduling, which is concerned with establishing execution dates for the sub-activities to be performed in order to complete the project. The ability to manage projects where resources must be allocated between concurrent projects or even sub-activities of a single project requires the use of commercial project management software packages. However, the results yielded by the solution procedures included are often rather unsatisfactory. Scheduling of Resource-Constrained Projects develops more efficient procedures, which can easily be integrated into software packages by incorporated programming languages, and thus should be of great interest for practiti...

  1. Present and future hydropower scheduling in Statkraft

    Science.gov (United States)

    Bruland, O.

    2012-12-01

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

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

  3. Software Schedules Missions, Aids Project Management

    Science.gov (United States)

    2008-01-01

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

  4. A practical approach to scheduling examinations

    Directory of Open Access Journals (Sweden)

    Luis Gerardo Astaiza A

    2010-11-01

    Full Text Available The scheduling of exams is a well-studied combinatorial optimisation problem. However, the growth in student numbers and the advent of modularity in many institutions of higher education has resulted in a significant increase in its complexity, imposing even more difficulties on university administrators who must resolve situations, often without having recourse to any computerised aid. This paper presents a practical approach towards timetabling examinations, consisting of several phases. Such phases would include constructing a conflict matrix, selecting suitable rooms for use when scheduling exams, establishing groups of courses which can be timetabled at the same time so that clashes are not incurred, imposing restrictions for loint exams for all groups from any particular course or specifying an exam in particular, fixing the times and allocating rooms and making the timetable available to students, teachers and administrators.

  5. Multiprocessor scheduling for real-time systems

    CERN Document Server

    Baruah, Sanjoy; Buttazzo, Giorgio

    2015-01-01

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

  6. Sensor Transmission Power Schedule for Smart Grids

    Science.gov (United States)

    Gao, C.; Huang, Y. H.; Li, J.; Liu, X. D.

    2017-11-01

    Smart grid has attracted much attention by the requirement of new generation renewable energy. Nowadays, the real-time state estimation, with the help of phasor measurement unit, plays an important role to keep smart grid stable and efficient. However, the limitation of the communication channel is not considered by related work. Considering the familiar limited on-board batteries wireless sensor in smart grid, transmission power schedule is designed in this paper, which minimizes energy consumption with proper EKF filtering performance requirement constrain. Based on the event-triggered estimation theory, the filtering algorithm is also provided to utilize the information contained in the power schedule. Finally, its feasibility and performance is demonstrated using the standard IEEE 39-bus system with phasor measurement units (PMUs).

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

  8. Estimating demand schedules in hedonic analysis

    DEFF Research Database (Denmark)

    Panduro, Toke Emil; Jensen, Cathrine Ulla; Lundhede, Thomas

    The hedonic pricing method has been used extensively to obtain implicit prices for availability of urban green space, but few hedonic studies have obtained households’ preference parameters. We estimate willingness to pay functions for park availability in Copenhagen using an approach that places...... an alternative path for estimation of demand schedules for public goods using hedonic data. The findings also stress the importance of paying attention to how public goods are defined when undertaking welfare economic policy analyses....

  9. A Scheduling Problem in the Baking Industry

    OpenAIRE

    Felipe Augusto Moreira da Silva; Antonio Carlos Moretti; Anibal Tavares de Azevedo

    2014-01-01

    This paper addresses a scheduling problem in an actual industrial environment of a baking industry where production rates have been growing every year and the need for optimized planning becomes increasingly important in order to address all the features presented by the problem. This problem contains relevant aspects of production, such as parallel production, setup time, batch production, and delivery date. We will also consider several aspects pertaining to transportation, such as the t...

  10. Optimal scheduling of aircrafts’ engines repair process

    OpenAIRE

    Cerdeira, Jorge Orestes; Lopes,Isabel Cristina; Silva, Eliana Costa e

    2013-01-01

    We address a real world scheduling problem concerning the repair process of aircrafts’ engines by TAP - Maintenance & Engineering (TAP-ME). TAP-ME is the maintenance, repair and overhaul organization of TAP Portugal, Portugal’s leading airline, which employs about 4000 persons to provide maintenance and engineering services in aircraft, engines and components. TAP-ME is aiming to optimize its maintenance services, focusing on the reduction of the engines repair turnaround time....

  11. Algorithms for Scheduling and Network Problems

    Science.gov (United States)

    1991-09-01

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

  12. Schedulers with load-store queue awareness

    Science.gov (United States)

    Chen, Tong; Eichenberger, Alexandre E.; Jacob, Arpith C.; Sura, Zehra N.

    2017-01-24

    In one embodiment, a computer-implemented method includes tracking a size of a load-store queue (LSQ) during compile time of a program. The size of the LSQ is time-varying and indicates how many memory access instructions of the program are on the LSQ. The method further includes scheduling, by a computer processor, a plurality of memory access instructions of the program based on the size of the LSQ.

  13. Adapting immunisation schedules for children undergoing chemotherapy.

    Science.gov (United States)

    Fernández-Prada, María; Rodríguez-Martínez, María; García-García, Rebeca; García-Corte, María Dolores; Martínez-Ortega, Carmen

    2018-02-01

    Children undergoing chemotherapy for cancer have special vaccination needs after completion of the treatment. The aim of this study was to evaluate the adaptation of post-chemotherapy vaccination schedules. An observational study was performed on a retrospective cohort that included all children aged from 0 to 14 years, who completed chemotherapy in a tertiary hospital between 2009 and 2015. Inclusion and exclusion criteria were applied. Immunisation was administered in accordance with the guidelines of the Vaccine Advisory Committee of the Spanish Association of Paediatrics. Primary Care immunisation and clinical records of the Preventive Medicine and Public Health Department were reviewed. Of the 99 children who had received chemotherapy, 51 (70.6% males) were included in the study. As regards the type of tumour, 54.9% had a solid organ tumour, and 45.1% had a haematological tumour. Post-chemotherapy immunisation was administered to 70.6%. The most common vaccines received were: diphtheria-tetanus-pertussis or diphtheria-tetanus (54.9%), meningococcus C (41.2%), and seasonal influenza (39.2%). The rate of adaptation of the immunisation schedule after chemotherapy was 9.8%. The pneumococcal conjugate vaccine against 7v or 13v was administered to 21.6% of study subjects. However, only 17.6% received polysaccharide 23v. None received vaccination against hepatitis A. No statistically significant differences were observed between adherence to immunisation schedules and type of tumour (P=.066), gender (P=.304), or age (P=.342). Post-chemotherapy immunisation of children with cancer is poor. The participation of health professionals in training programs and referral of paediatric cancer patients to Vaccine Units could improve the rate of schedule adaptation and proper immunisation of this population. Copyright © 2016 Elsevier España, S.L.U. and Sociedad Española de Enfermedades Infecciosas y Microbiología Clínica. All rights reserved.

  14. Responsive versus scheduled feeding for preterm infants

    OpenAIRE

    Watson, Julie; McGuire, William

    2016-01-01

    BACKGROUND: Feeding preterm infants in response to their hunger and satiation cues (responsive, cue-based, or infant-led feeding) rather than at scheduled intervals might enhance infants' and parents' experience and satisfaction, help in the establishment of independent oral feeding, increase nutrient intake and growth rates, and allow earlier hospital discharge. OBJECTIVES: To assess the effect of a policy of feeding preterm infants on a responsive basis versus feeding prescribed volumes at ...

  15. Schedulers with load-store queue awareness

    Energy Technology Data Exchange (ETDEWEB)

    Chen, Tong; Eichenberger, Alexandre E.; Jacob, Arpith C.; Sura, Zehra N.

    2017-02-07

    In one embodiment, a computer-implemented method includes tracking a size of a load-store queue (LSQ) during compile time of a program. The size of the LSQ is time-varying and indicates how many memory access instructions of the program are on the LSQ. The method further includes scheduling, by a computer processor, a plurality of memory access instructions of the program based on the size of the LSQ.

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

    Science.gov (United States)

    1991-09-01

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

  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. 37 CFR 6.4 - Schedule for collective membership marks.

    Science.gov (United States)

    2010-07-01

    ... 37 Patents, Trademarks, and Copyrights 1 2010-07-01 2010-07-01 false Schedule for collective... Schedule for collective membership marks. All collective membership marks in applications based on sections... follows: Class Title 200 Collective Membership. ...

  19. Analyzing scheduling in the food-processing industry

    DEFF Research Database (Denmark)

    Akkerman, Renzo; van Donk, Dirk Pieter

    2009-01-01

    Production scheduling has been widely studied in several research areas, resulting in a large number of methods, prescriptions, and approaches. However, the impact on scheduling practice seems relatively low. This is also the case in the food-processing industry, where industry-specific character......Production scheduling has been widely studied in several research areas, resulting in a large number of methods, prescriptions, and approaches. However, the impact on scheduling practice seems relatively low. This is also the case in the food-processing industry, where industry......-specific characteristics induce specific and complex scheduling problems. Based on ideas about decomposition of the scheduling task and the production process, we develop an analysis methodology for scheduling problems in food processing. This combines an analysis of structural (technological) elements of the production...... and information flows related to scheduling....

  20. Training and Operations Integrated Calendar Scheduler - TROPICS

    Energy Technology Data Exchange (ETDEWEB)

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

    2003-01-27

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

  1. Circannual basis of geographically distinct bird schedules.

    Science.gov (United States)

    Helm, Barbara; Schwabl, Ingrid; Gwinner, Eberhard

    2009-05-01

    To anticipate seasonal change, organisms schedule their annual activities by using calendrical cues like photoperiod. The use of cues must be fitted to local conditions because schedules differ between species and habitats. In complete absence of temporal information, many species show persistent circannual cycles that are synchronised, but not driven, by photoperiod. The contribution of circannual rhythms to timing under natural photoperiodic conditions is still unclear. In a suite of experiments, we examined timing in two closely related songbirds (Siberian and European stonechats) that inhabit similar latitudes but differ in seasonal behaviour. Under a more continental climate, Siberian stonechats breed later, moult faster and migrate further than European stonechats. We tested hypotheses for seasonal timing mechanisms by comparing the birds under constant and naturally changing daylengths. The taxa retained characteristic reproductive and moult schedules and hybrids behaved roughly intermediately. Based on their distinct circannual cycles, we expected European and Siberian stonechats to differ in photoperiodic responses at a given time of year. We found that the taxa responded, as predicted, in opposite ways to photoperiodic simulations as experienced on different migration routes. The findings indicate that circannual rhythms reflect geographically distinct periodic changes in seasonal disposition and cue-response mechanisms. Under natural daylengths, the phase relationship of the underlying circannual rhythm to the external year determines the action of photoperiod. Circannual rhythms are widespread among long-lived species. Accordingly, responses to environmental change, range expansion and novel migration patterns may depend on the particulars of a species' underlying circannual programming.

  2. Coordinated Science Campaign Scheduling for Sensor Webs

    Science.gov (United States)

    Edgington, Will; Morris, Robert; Dungan, Jennifer; Williams, Jenny; Carlson, Jean; Fleming, Damian; Wood, Terri; Yorke-Smith, Neil

    2005-01-01

    Future Earth observing missions will study different aspects and interacting pieces of the Earth's eco-system. Scientists are designing increasingly complex, interdisciplinary campaigns to exploit the diverse capabilities of multiple Earth sensing assets. In addition, spacecraft platforms are being configured into clusters, trains, or other distributed organizations in order to improve either the quality or the coverage of observations. These simultaneous advances in the design of science campaigns and in the missions that will provide the sensing resources to support them offer new challenges in the coordination of data and operations that are not addressed by current practice. For example, the scheduling of scientific observations for satellites in low Earth orbit is currently conducted independently by each mission operations center. An absence of an information infrastructure to enable the scheduling of coordinated observations involving multiple sensors makes it difficult to execute campaigns involving multiple assets. This paper proposes a software architecture and describes a prototype system called DESOPS (Distributed Earth Science Observation Planning and Scheduling) that will address this deficiency.

  3. Prioritizing sleep for healthy work schedules

    Directory of Open Access Journals (Sweden)

    Takahashi Masaya

    2012-03-01

    Full Text Available Abstract Good sleep is advantageous to the quality of life. Sleep-related benefits are particularly helpful for the working class, since poor or inadequate amounts of sleep degrade work productivity and overall health. This review paper explores the essential role of sleep in healthy work schedules and primarily focuses on the timing of sleep in relation to the work period (that is, before, during and after work. Data from laboratory, field and modeling studies indicate that consistent amounts of sleep prior to work are fundamental to improved performance and alertness in the workplace. In addition, planned naps taken during work maintain appropriate levels of waking function for both daytime and night-time work. Clearly, sufficient sleep after work is vital in promoting recovery from fatigue. Recent data also suggest that the time interval between shifts should be adjusted according to the biological timing of sleep. Although sleep is more likely to be replaced by job and other activities in the real life, research shows that it is worthwhile to revise the work schedules in order to optimize sleep before, sometime during and after the work period. Therefore, we suggest establishing work-sleep balance, similar to work-life balance, as a principle for designing and improving work schedules.

  4. Ant Colony Optimisation for Backward Production Scheduling

    Directory of Open Access Journals (Sweden)

    Leandro Pereira dos Santos

    2012-01-01

    Full Text Available The main objective of a production scheduling system is to assign tasks (orders or jobs to resources and sequence them as efficiently and economically (optimised as possible. Achieving this goal is a difficult task in complex environment where capacity is usually limited. In these scenarios, finding an optimal solution—if possible—demands a large amount of computer time. For this reason, in many cases, a good solution that is quickly found is preferred. In such situations, the use of metaheuristics is an appropriate strategy. In these last two decades, some out-of-the-shelf systems have been developed using such techniques. This paper presents and analyses the development of a shop-floor scheduling system that uses ant colony optimisation (ACO in a backward scheduling problem in a manufacturing scenario with single-stage processing, parallel resources, and flexible routings. This scenario was found in a large food industry where the corresponding author worked as consultant for more than a year. This work demonstrates the applicability of this artificial intelligence technique. In fact, ACO proved to be as efficient as branch-and-bound, however, executing much faster.

  5. A microeconomic scheduler for parallel computers

    Science.gov (United States)

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

    1995-01-01

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

  6. Schedule performance measurement based on statistical process control charts

    OpenAIRE

    Oleghe, Omogbai; Salonitis, Konstantinos

    2014-01-01

    In a job-shop manufacturing environment, achieving a schedule that is on target is difficult due to the dynamism of factors affecting the system, and this makes schedule performance measurement systems hard to design and implement. In the present paper, Statistical Process Control charts are directly applied to a scheduling process for the purpose of objectively measuring schedule performance. SPC charts provide an objective and timely approach to designing, implementing and mo...

  7. Quality-aware scheduling for key-value data stores

    CERN Document Server

    Xu, Chen

    2015-01-01

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

  8. A system of model fertility schedules with graphically intuitive parameters

    OpenAIRE

    Carl Schmertmann

    2003-01-01

    I propose and examine a new family of models for age-specific fertility schedules, in which three index ages determine the schedule's shape. The new system is based on constrained quadratic splines. It has easily interpretable parameters, is flexible enough to fit a variety of "noiseless" schedules well, and is inflexible enough to avoid implausible estimates from noisy data. Across a set of over two hundred contemporary ASFR schedules, the new model fits a majority better, and in some cases ...

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

  10. Fair channel-dependent scheduling in CDMA systems

    NARCIS (Netherlands)

    de Bruin, I.C.C.; Heijenk, Geert; El Zarki, Magda; Zan, Jasmine Lei

    2003-01-01

    In this study a scheduling algorithm for CDMA systems is presented which is a trade-off between two extreme ways of scheduling: C/I based and Round-Robin scheduling. The simulation results indeed display that the advantages of both these extremes have been combined in the new algorithm: a good

  11. 48 CFR 1352.271-73 - Schedule of work.

    Science.gov (United States)

    2010-10-01

    ... 48 Federal Acquisition Regulations System 5 2010-10-01 2010-10-01 false Schedule of work. 1352.271... of work. As prescribed in 48 CFR 1371.104, insert the following clause. Schedule of Work (APR 2010... arrival at the contractor's facility: (1) Production Schedule. (2) Work Package Network. (3) Total...

  12. 33 CFR 401.58 - Pleasure craft scheduling.

    Science.gov (United States)

    2010-07-01

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

  13. 39 CFR 3010.7 - Schedule of regular rate changes.

    Science.gov (United States)

    2010-07-01

    ... of mailers of each class of mail in developing the schedule. (e) Whenever the Postal Service deems it... 39 Postal Service 1 2010-07-01 2010-07-01 false Schedule of regular rate changes. 3010.7 Section... PRODUCTS General Provisions § 3010.7 Schedule of regular rate changes. (a) The Postal Service shall...

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

    NARCIS (Netherlands)

    Leeftink, Gréanne; Hans, Erwin W.

    2017-01-01

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

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

    Science.gov (United States)

    2012-08-14

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

  16. 38 CFR 4.21 - Application of rating schedule.

    Science.gov (United States)

    2010-07-01

    ... 38 Pensions, Bonuses, and Veterans' Relief 1 2010-07-01 2010-07-01 false Application of rating schedule. 4.21 Section 4.21 Pensions, Bonuses, and Veterans' Relief DEPARTMENT OF VETERANS AFFAIRS SCHEDULE FOR RATING DISABILITIES General Policy in Rating § 4.21 Application of rating schedule. In view of the...

  17. 7 CFR 305.23 - Steam sterilization treatment schedules.

    Science.gov (United States)

    2010-01-01

    ... 7 Agriculture 5 2010-01-01 2010-01-01 false Steam sterilization treatment schedules. 305.23... Steam sterilization treatment schedules. Treatment schedule Temperature( °F) Pressure Exposure period (minutes) Directions T303-b-1 10 lbs 20 Use 28″ vacuum. Steam sterilization is not practical for treatment...

  18. 7 CFR 305.25 - Dry heat treatment schedules.

    Science.gov (United States)

    2010-01-01

    ... 7 Agriculture 5 2010-01-01 2010-01-01 false Dry heat treatment schedules. 305.25 Section 305.25... SERVICE, DEPARTMENT OF AGRICULTURE PHYTOSANITARY TREATMENTS Heat Treatments § 305.25 Dry heat treatment schedules. Treatment schedule Temperature ( °F) Time Directions T302-a-1-2 168 minimum At least 2 hours...

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

  20. A feature model and development approach for schedulers

    NARCIS (Netherlands)

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

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

  1. User interface issues in supporting human-computer integrated scheduling

    Science.gov (United States)

    Cooper, Lynne P.; Biefeld, Eric W.

    1991-01-01

    The topics are presented in view graph form and include the following: characteristics of Operations Mission Planner (OMP) schedule domain; OMP architecture; definition of a schedule; user interface dimensions; functional distribution; types of users; interpreting user interaction; dynamic overlays; reactive scheduling; and transitioning the interface.

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

  3. In-house development of scheduling decision support systems: case study for scheduling semiconductor device test operations

    OpenAIRE

    Freed, T.; Doerr, K. H.; Chang, T.

    2007-01-01

    Most manufacturing processes can benefit from an automated scheduling system. However, the design of a fast, computerised scheduling system that achieves high-quality results and requires minimal resources is a difficult undertaking. Efficient scheduling of a semiconductor device test facility requires an information system that provides good schedules quickly. Semiconductor device testing is the last stage of the long semiconductor manufacturing process, and therefore is su...

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

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

    Science.gov (United States)

    2010-01-01

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

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

    Science.gov (United States)

    2010-01-01

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

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

    DEFF Research Database (Denmark)

    Hansen, Anders Dohn; Clausen, Jens

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

  8. Schedule of voucher delivery influences initiation of cocaine abstinence.

    Science.gov (United States)

    Kirby, K C; Marlowe, D B; Festinger, D S; Lamb, R J; Platt, J J

    1998-10-01

    This study examined whether voucher delivery arrangements affect treatment outcome. First, 90 cocaine-dependent adults were randomly assigned to behavioral counseling or counseling plus vouchers for cocaine-free urine samples. The value of each voucher was low at the beginning but increased as the patient progressed (Voucher Schedule 1). Voucher Schedule 1 produced no improvements relative to counseling only. Next, 23 patients received vouchers on either Voucher Schedule 1 or Voucher Schedule 2. Voucher Schedule 2 began with high voucher values, but requirements for earning vouchers increased as the patient progressed. Average durations of cocaine abstinence were 6.9 weeks on Voucher Schedule 2 versus 2.0 weeks on Voucher Schedule 1 (p = .02). This confirms that vouchers can assist in initiating abstinence and that voucher delivery arrangements are critical.

  9. Factors Associated With Pediatrician Responses to Alternative Immunization Schedule Requests.

    Science.gov (United States)

    Mohanty, Salini; Feemster, Kristen A; Buttenheim, Alison; Moser, Charlotte A; Field, Robert I; Mayer, Whitney; Carroll-Scott, Amy

    2017-02-01

    We conducted a cross-sectional online survey among 4 chapters of the American Academy of Pediatrics from July through October 2014 to describe characteristics of pediatricians and practices associated with practice-level responses to alternative immunization schedule requests. Among 374 pediatricians, 58% reported frequent alternative immunization schedule requests and 24% reported feeling comfortable using them. Pediatricians who work in practices that accommodate alternative immunization schedule requests have increased odds of having a high frequency of alternative immunization schedule requests, and beliefs that relationships with families would be negatively affected if they refused requests. Practices that discontinue care to families who request alternative immunization schedules have increased odds of being a private group practice and having a formal office vaccine policy. Pediatricians are frequently asked to use alternative immunization schedules and many are not comfortable using them. Practice-level responses to alternative immunization schedules are associated with characteristics of pediatricians and practices.

  10. Developing optimal nurses work schedule using integer programming

    Science.gov (United States)

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

    2017-08-01

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

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

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

    Science.gov (United States)

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

    2009-09-01

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

  13. National Oceanographic Fleet Operating Schedules for 1983.

    Science.gov (United States)

    1983-01-01

    187 DAVID STARR JORDAN .................................................. 188 MCARTHUR...8217TLANT9 S!A OCEAN A C A 141I A4 ALF3fTQC% IV ALPUA HELIX A%TFLCPF* ATLRTIS H 1 * atLUE FINJ CApr rLCPIL’ CAPr HATTERAS* CAPr I’ENLOPIN It * DAVID STAPP...ALBATROSS IV LAST CHANGED 15 OCT 82 OPS SCHEDULE FOR PERIOD 01 JAN 83 THRU 31 DEC F3 N4FS NOIA DEP: 22 FEB S3 WOODS HOLE MACKEREL ACOUSTICSARR: 04

  14. Optimal scheduling using priced timed automata

    DEFF Research Database (Denmark)

    Behrmann, Gerd; Larsen, Kim Guldstrand; Rasmussen, Jacob Illum

    2005-01-01

    This contribution reports on the considerable effort made recently towards extending and applying well-established timed automata technology to optimal scheduling and planning problems. The effort of the authors in this direction has to a large extent been carried out as part of the European...... projects VHS [20] and AMETIST [16] and are available in the recently released UPPAAL CORA [12], a variant of the real-time verification tool UPPAAL [18, 5] specialized for cost-optimal reachability for the extended model of so-called priced timed automata....

  15. Software sizing, cost estimation and scheduling

    Science.gov (United States)

    Cheadle, William G.

    1988-01-01

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

  16. Binary Trees and Parallel Scheduling Algorithms.

    Science.gov (United States)

    1980-09-01

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

  17. Application of genetic algorithm for hemodialysis schedule optimization.

    Science.gov (United States)

    Choi, Jin Woo; Lee, Hajeong; Lee, Jung Chan; Lee, Saram; Kim, Yon Su; Yoon, Hyung-Jin; Kim, Hee Chan

    2017-07-01

    The conventional hemodialysis (HD) schedule has been used for decades, even though new modalities have been introduced. Many reasons limit practices of frequent dialysis, such as patients' environments and unknown optimal schedules for each patient. This research provides a theoretical recommendation of HD schedule through genetic algorithm (GA). An end-stage renal disease (ESRD) with various dialysis conditions was modeled through a classic variable-volume two-compartment kinetic model to simulate an anuric patient, and GA was implemented to search for an optimal HD schedule for each individual considering and ignoring burden consumption of each dialysis session. The adequacy of the optimized HD schedules through GA was assessed with time average concentration (TAC) and time average deviation (TAD). While ignoring the burden of dialysis sessions, GA returned schedules with slightly improved values of adequacy criteria (EKRc and std Kt/V), compared to the conventional regular uniform HD schedules. The optimized HD schedules also showed decreased TAC and TAD values compared to the conventional regular uniform HD schedules. It showed that frequent dialysis resulted in more effective treatment and higher fitness values. However, when burden was considered, less frequent dialysis schedules showed better fitness value. Through this research, GA confirmed that at least 12h of dialysis should be conducted for a week. The optimized schedules from GA indicated that evenly distributing the intervals amongst sessions is efficient, and that scheduling a session at the start and end of a week is optimal to overcome a long weekend interval. The theoretical optimal schedule of HD may help distribution of frequent dialysis and provide more schedule options to patients. Copyright © 2017 Elsevier B.V. All rights reserved.

  18. Runway Scheduling Using Generalized Dynamic Programming

    Science.gov (United States)

    Montoya, Justin; Wood, Zachary; Rathinam, Sivakumar

    2011-01-01

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

  19. Solving University Scheduling Problem Using Hybrid Approach

    Directory of Open Access Journals (Sweden)

    Aftab Ahmed Shaikh

    2011-10-01

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

  20. Intelligent Scheduling for Underground Mobile Mining Equipment.

    Directory of Open Access Journals (Sweden)

    Zhen Song

    Full Text Available Many studies have been carried out and many commercial software applications have been developed to improve the performances of surface mining operations, especially for the loader-trucks cycle of surface mining. However, there have been quite few studies aiming to improve the mining process of underground mines. In underground mines, mobile mining equipment is mostly scheduled instinctively, without theoretical support for these decisions. Furthermore, in case of unexpected events, it is hard for miners to rapidly find solutions to reschedule and to adapt the changes. This investigation first introduces the motivation, the technical background, and then the objective of the study. A decision support instrument (i.e. schedule optimizer for mobile mining equipment is proposed and described to address this issue. The method and related algorithms which are used in this instrument are presented and discussed. The proposed method was tested by using a real case of Kittilä mine located in Finland. The result suggests that the proposed method can considerably improve the working efficiency and reduce the working time of the underground mine.

  1. Optimized Treatment Schedules for Chronic Myeloid Leukemia.

    Directory of Open Access Journals (Sweden)

    Qie He

    2016-10-01

    Full Text Available Over the past decade, several targeted therapies (e.g. imatinib, dasatinib, nilotinib have been developed to treat Chronic Myeloid Leukemia (CML. Despite an initial response to therapy, drug resistance remains a problem for some CML patients. Recent studies have shown that resistance mutations that preexist treatment can be detected in a substantial number of patients, and that this may be associated with eventual treatment failure. One proposed method to extend treatment efficacy is to use a combination of multiple targeted therapies. However, the design of such combination therapies (timing, sequence, etc. remains an open challenge. In this work we mathematically model the dynamics of CML response to combination therapy and analyze the impact of combination treatment schedules on treatment efficacy in patients with preexisting resistance. We then propose an optimization problem to find the best schedule of multiple therapies based on the evolution of CML according to our ordinary differential equation model. This resulting optimization problem is nontrivial due to the presence of ordinary different equation constraints and integer variables. Our model also incorporates drug toxicity constraints by tracking the dynamics of patient neutrophil counts in response to therapy. We determine optimal combination strategies that maximize time until treatment failure on hypothetical patients, using parameters estimated from clinical data in the literature.

  2. AN INFLATION-BASED MAINTENANCE SCHEDULING MODEL

    Directory of Open Access Journals (Sweden)

    S.A. Oke

    2012-01-01

    Full Text Available

    ENGLISH ABSTRACT: This paper attempts to extend an original Gantt-charting model for optimal maintenance scheduling of multiple facilities in multiple periods credited to Charles- Owaba. In particular, an inflationary factor is incorporated into the period-dependent cost function element of the model. Some computational experimentation on the new model is tested. This work is perhaps the first to advance the extension of the Optimal Gantt Charting (OGC model in terms of inflation. The work presents a wealth of research opportunities and has at least the modest potential to evaluate maintenance scheduling theory into the ranks of major theories of maintenance.

    AFRIKAANSE OPSOMMING: Die artikel poog om inflasie te akkommodeer binne die raamwerk van ‘n Ganttkaartmodel vir die bepaling van optimum skedulering van instandhouding vir meervoudige fasiliteite met die verloop van tyd. Inflasie vorm dus deel van die koste-element van die model. Die model is ook op ‘n beperkte wyse gevalideer met behulp van ‘n rekenaarstudie. Die verkreë resultate toon dat addisionele navorsing gedoen kan word om sodoende die metode te vestig in die voorste rang van instandhoudingsbeplanning

  3. A subjective scheduler for subjective dedicated networks

    Science.gov (United States)

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

    2017-09-01

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

  4. Responsive versus scheduled feeding for preterm infants.

    Science.gov (United States)

    Watson, Julie; McGuire, William

    2016-08-31

    Feeding preterm infants in response to their hunger and satiation cues (responsive, cue-based, or infant-led feeding) rather than at scheduled intervals might enhance infants' and parents' experience and satisfaction, help in the establishment of independent oral feeding, increase nutrient intake and growth rates, and allow earlier hospital discharge. To assess the effect of a policy of feeding preterm infants on a responsive basis versus feeding prescribed volumes at scheduled intervals on growth rates, levels of parent satisfaction, and time to hospital discharge. We used the standard search strategy of the Cochrane Neonatal Review group to search the Cochrane Central Register of Controlled Trials (CENTRAL 2016, Issue 1), MEDLINE via PubMed (1966 to 17 February 2016), Embase (1980 to 17 February 2016), and CINAHL (1982 to 17 February 2016). We also searched clinical trials' databases, conference proceedings, and the reference lists of retrieved articles for randomised controlled trials and quasi-randomised trials. Randomised controlled trials (RCTs) or quasi-RCTs that compared a policy of feeding preterm infants on a responsive basis versus feeding at scheduled intervals. Two review authors assessed trial eligibility and risk of bias and undertook data extraction independently. We analysed the treatment effects in the individual trials and reported the risk ratio and risk difference for dichotomous data and mean difference (MD) for continuous data, with respective 95% confidence intervals (CIs). We used a fixed-effect model in meta-analyses and explored the potential causes of heterogeneity in sensitivity analyses. We assessed the quality of evidence at the outcome level using the Grading of Recommendations Assessment, Development and Evaluation (GRADE) approach. We found nine eligible RCTs including 593 infants in total. These trials compared responsive with scheduled interval regimens in preterm infants in the transition phase from intragastric tube to oral

  5. 77 FR 75075 - Schedules of Controlled Substances: Placement of Lorcaserin Into Schedule IV

    Science.gov (United States)

    2012-12-19

    ... a human abuse potential study in recreational drug abusers of psychedelic drugs and CNS depressants... From the Federal Register Online via the Government Publishing Office DEPARTMENT OF JUSTICE Drug... Schedule IV AGENCY: Drug Enforcement Administration, Department of Justice. ACTION: Notice of proposed...

  6. 78 FR 26701 - Schedules of Controlled Substances: Placement of Lorcaserin Into Schedule IV

    Science.gov (United States)

    2013-05-08

    ...; Telephone, (202) 307-7165. SUPPLEMENTARY INFORMATION: Legal Authority The DEA implements and enforces Titles II and III of the Comprehensive Drug Abuse Prevention and Control Act of 1970, often referred to as... are classified in one of five schedules based upon their potential for abuse, their currently accepted...

  7. 76 FR 65424 - Schedules of Controlled Substances: Placement of Ezogabine Into Schedule V

    Science.gov (United States)

    2011-10-21

    ... restricted to ``(A) find that such drug or other substance has a potential for abuse, and (B) mak with... address information provided above. Legal Authority Under the CSA, controlled substances are classified in one of five schedules based upon their potential for abuse, their currently accepted medical use, and...

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

    NARCIS (Netherlands)

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

    2010-01-01

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

  9. LiveGantt: Interactively Visualizing a Large Manufacturing Schedule.

    Science.gov (United States)

    Jo, Jaemin; Huh, Jaeseok; Park, Jonghun; Kim, Bohyoung; Seo, Jinwook

    2014-12-01

    In this paper, we introduce LiveGantt as a novel interactive schedule visualization tool that helps users explore highly-concurrent large schedules from various perspectives. Although a Gantt chart is the most common approach to illustrate schedules, currently available Gantt chart visualization tools suffer from limited scalability and lack of interactions. LiveGantt is built with newly designed algorithms and interactions to improve conventional charts with better scalability, explorability, and reschedulability. It employs resource reordering and task aggregation to display the schedules in a scalable way. LiveGantt provides four coordinated views and filtering techniques to help users explore and interact with the schedules in more flexible ways. In addition, LiveGantt is equipped with an efficient rescheduler to allow users to instantaneously modify their schedules based on their scheduling experience in the fields. To assess the usefulness of the application of LiveGantt, we conducted a case study on manufacturing schedule data with four industrial engineering researchers. Participants not only grasped an overview of a schedule but also explored the schedule from multiple perspectives to make enhancements.

  10. Data analysis with the DIANA meta-scheduling approach

    CERN Document Server

    Anjum, A; Willers, I

    2008-01-01

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

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

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

  13. A reduced feedback proportional fair multiuser scheduling scheme

    KAUST Repository

    Shaqfeh, Mohammad

    2011-12-01

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

  14. Distributed Research Project Scheduling Based on Multi-Agent Methods

    Directory of Open Access Journals (Sweden)

    Constanta Nicoleta Bodea

    2011-01-01

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

  15. An Improved Ant Algorithm for Grid Task Scheduling Strategy

    Science.gov (United States)

    Wei, Laizhi; Zhang, Xiaobin; Li, Yun; Li, Yujie

    Task scheduling is an important factor that directly influences the performance and efficiency of the system. Grid resources are usually distributed in different geographic locations, belonging to different organizations and resources' properties are vastly different, in order to complete efficiently, intelligently task scheduling, the choice of scheduling strategy is essential. This paper proposes an improved ant algorithm for grid task scheduling strategy, by introducing a new type pheromone and a new node redistribution selection rule. On the one hand, the algorithm can track performances of resources and tag it. On the other hand, add algorithm to deal with task scheduling unsuccessful situations that improve the algorithm's robustness and the successful probability of task allocation and reduce unnecessary overhead of system, shortening the total time to complete tasks. The data obtained from simulation experiment shows that use this algorithm to resolve schedule problem better than traditional ant algorithm.

  16. Where do we stand with fuzzy project scheduling?

    CERN Document Server

    Bonnal, Pierre; Lacoste, Germain

    2004-01-01

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

  17. A Randomization Approach for Stochastic Workflow Scheduling in Clouds

    Directory of Open Access Journals (Sweden)

    Wei Zheng

    2016-01-01

    Full Text Available In cloud systems consisting of heterogeneous distributed resources, scheduling plays a key role to obtain good performance when complex applications are run. However, there is unavoidable error in predicting individual task execution times and data transmission times. When this error is being not negligible, deterministic scheduling approaches (i.e., scheduling based on accurate time prediction may suffer. In this paper, we assume the error in time predictions is modelled in stochastic manner, and a novel randomization approach making use of the properties of random variables is proposed to improve deterministic scheduling. The randomization approach is applied to a classic deterministic scheduling heuristic, but its applicability is not limited to this one heuristic. Evaluation results obtained from extensive simulation show that the randomized scheduling approach can significantly outperform its static counterpart and the extra overhead introduced is not only controllable but also acceptable.

  18. Research on logistics scheduling based on PSO

    Science.gov (United States)

    Bao, Huifang; Zhou, Linli; Liu, Lei

    2017-08-01

    With the rapid development of e-commerce based on the network, the logistics distribution support of e-commerce is becoming more and more obvious. The optimization of vehicle distribution routing can improve the economic benefit and realize the scientific of logistics [1]. Therefore, the study of logistics distribution vehicle routing optimization problem is not only of great theoretical significance, but also of considerable value of value. Particle swarm optimization algorithm is a kind of evolutionary algorithm, which is based on the random solution and the optimal solution by iteration, and the quality of the solution is evaluated through fitness. In order to obtain a more ideal logistics scheduling scheme, this paper proposes a logistics model based on particle swarm optimization algorithm.

  19. Scheduling and congestion control for wireless internet

    CERN Document Server

    Wang, Xin

    2014-01-01

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

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

  1. Flowering schedule in a perennial plant

    DEFF Research Database (Denmark)

    Ehrlén, Johan; Raabova, Jana; Dahlgren, Johan

    2015-01-01

    Optimal timing of reproduction within a season may be influenced by several abiotic and biotic factors. These factors sometimes affect different components of fitness, making assessments of net selection difficult. We used estimates of offspring fitness to examine how pre-dispersal seed predation...... from early flowers. Reproductive values of early and late flowers balanced at a predation intensity of 63%. Across 15 natural populations, the strength of selection for allocation to late flowers was positively correlated with mean seed predation intensity. Our results suggest that the optimal shape...... of the flowering schedule, in terms of the allocation between early and late flowers, is determined by the trade-off between offspring number and quality, and that variation in antagonistic interactions among populations influence the balancing of this trade-off. At the same time they illustrate that phenotypic...

  2. Optimal OFDMA Downlink Scheduling Under a Control Signaling Cost Constraint

    OpenAIRE

    Larsson, Erik G.

    2010-01-01

    This paper proposes a new algorithm for downlink scheduling in OFDMA systems. The method maximizes the throughput, taking into account the amount of signaling needed to transmit scheduling maps to the users. A combinatorial problem is formulated and solved via a dynamic programming approach reminiscent of the Viterbi algorithm. The total computational complexity of the algorithm is upper boundedby O(K^4N) where K is the number of users that are being considered for scheduling in a frame and N...

  3. Scheduling for Improving System Capacity in Multiservice 3GPP LTE

    Directory of Open Access Journals (Sweden)

    Francisco Rafael Marques Lima

    2010-01-01

    according to these ideas named capacity-driven resource allocation (CRA. The CRA scheduler dynamically controls the resource sharing among flows of different services such as delay-sensitive and rate demanding ones. Moreover, CRA scheduler exploits the channel-quality knowledge to utilize the system resources efficiently. Simulation results in a multicell scenario show that the CRA scheduler is robust regarding channel quality knowledge and that it provides significant gains in joint system capacity in single and mixed service scenarios.

  4. Bias of phencyclidine discrimination by the schedule of reinforcement.

    OpenAIRE

    McMillan, D E; Wenger, G R

    1984-01-01

    Pigeons, trained to discriminate phencyclidine from saline under a procedure requiring the bird to track the location of a color, received cumulative doses of phencyclidine, pentobarbital, or d-amphetamine with a variety of schedules of reinforcement in effect (across phases). When the same second-order schedules were used to reinforce responding after either saline or phencyclidine administration, stimulus control by phencyclidine did not depend on the schedule parameter. When different seco...

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

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

  7. Impact of Personnel Flexibility on Job Shop Scheduling

    Directory of Open Access Journals (Sweden)

    Ren Lin

    2016-01-01

    Full Text Available Considering the lack of the research on the relationship between HR flexibility and scheduling effect, a resource-competency matrix-based method was proposed in order to reveal the quantitative relationship between them. Meanwhile, a job shop scheduling model with HR flexibility was established and the improved genetic algorithm was used to solve the model. A case analysis demonstrated significant impact of HR flexibility on the scheduling effect, which provided valuable guidance for building flexible manufacturing systems.

  8. Compositional Schedulability Analysis of Multicore Modular Avionic Architectures

    DEFF Research Database (Denmark)

    Boudjadar, Jalil

    2017-01-01

    This paper presents a compositional schedulability analysis of multicore modular avionic systems (IMA). It provides a fine grained description of the software architecture and behavior to reduce the over-approximation, and a holistic analysis to check schedulability while considering computation...... functionality. Schedulability is formally analyzed using Uppaal model checker. Our evaluation results show that our compositional analysis technique consumes up to 95% less than regular analysis, in terms of analysis time and memory space....

  9. Analysis of matching cross-border electricity exchange schedules

    OpenAIRE

    Ekmečič, Davorin

    2013-01-01

    Electricity markets in Europe are opening up. New business opportunities and increasing volume of electricity trading represent a challenge to the operators of transmission systems, who have to check scheduled programs (verify that production, trades and consumption are balanced) and ensure system stability even in case of deviations from planned schedules. The purpose of this thesis was to analyze the protocol for exchange of planned schedules according to ENTSO-E ESS 3.3 standard, evalua...

  10. Scheduling Additional Train Unit Services on Rail Transit Lines

    OpenAIRE

    Zhibin Jiang; Yuyan Tan; Özgür Yalçınkaya

    2014-01-01

    This paper deals with the problem of scheduling additional train unit (TU) services in a double parallel rail transit line, and a mixed integer programming (MIP) model is formulated for integration strategies of new trains connected by TUs with the objective of obtaining higher frequencies in some special sections and special time periods due to mass passenger volumes. We took timetable scheduling and TUs scheduling as an integrated optimization model with two objectives: minimizing travel ti...

  11. Schedulability-Driven Communication Synthesis for Time Triggered Embedded Systems

    DEFF Research Database (Denmark)

    Pop, Paul; Eles, Petru; Peng, Zebo

    1999-01-01

    We present an approach to static priority preemptive process scheduling for the synthesis of hard real-time distributed embedded systems where communication plays an important role. The communication model is based on a time-triggered protocol. We have developed an analysis for the communication...... delays proposing four different message scheduling policies over a time-triggered communication channel. Optimization strategies for the synthesis of communication are developed, and the four approaches to message scheduling are compared using extensive experiments....

  12. Schedulability-Driven Communication Synthesis for Time Triggered Embedded Systems

    DEFF Research Database (Denmark)

    Pop, Paul; Eles, Petru; Peng, Zebo

    2004-01-01

    We present an approach to static priority preemptive process scheduling for the synthesis of hard real-time distributed embedded systems where communication plays an important role. The communication model is based on a time-triggered protocol. We have developed an analysis for the communication...... delays with four different message scheduling policies over a time-triggered communication channel. Optimization strategies for the synthesis of communication are developed, and the four approaches to message scheduling are compared using extensive experiments....

  13. Uplink Channel Dependent Scheduling for Future Cellular Systems

    OpenAIRE

    Jersenius, Kristina

    2007-01-01

    One goal in the development of future cellular systems is to increase performance. Channel dependent scheduling can possibly contribute to a performance enhancement. It requires channel qualityinformation and uplink channel knowledge is often incomplete. This master thesis work compares channel dependent scheduling and channel independent scheduling for a Single Carrier Frequency Division Multiple Access-based uplink in time domain and time and frequencydomain assuming continuous channel qual...

  14. Analyzing the scheduling system stage of production system life cycle

    Directory of Open Access Journals (Sweden)

    Rajesh Attri

    2015-05-01

    Full Text Available The main objective of this paper is to identify and understand the relationship dynamics among the quality enabled factors affecting the scheduling stage of production system life cycle. For this purpose, Interpretative structural modelling (ISM approach has been utilized for developing the relationships among the various factors of the scheduling system stage. Afterwards, MICMAC (Matriced Impacts Croises Multiplication Appliqueeaun Classement analysis has been carried out in order to classify the factors into different categories and to disclose the direct and indirect effects of each factor on the scheduling system. It is an approach for refining the decision making in the scheduling stage of production system life cycle.

  15. Hierarchical Scheduling Framework Based on Compositional Analysis Using Uppaal

    DEFF Research Database (Denmark)

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

    2014-01-01

    , which are some of the inputs for the parameterized timed automata that make up the framework. Components may have different scheduling policies, and each component is analyzed independently using Uppaal. We have applied our framework for the schedulability analysis of an avionics system.......This paper introduces a reconfigurable compositional scheduling framework, in which the hierarchical structure, the scheduling policies, the concrete task behavior and the shared resources can all be reconfigured. The behavior of each periodic preemptive task is given as a list of timed actions...

  16. Techniques for cash management in scheduling manufacturing operations

    Science.gov (United States)

    Morady Gohareh, Mehdy; Shams Gharneh, Naser; Ghasemy Yaghin, Reza

    2017-10-01

    The objective in traditional scheduling is usually time based. Minimizing the makespan, total flow times, total tardi costs, etc. are instances of these objectives. In manufacturing, processing each job entails a cost paying and price receiving. Thus, the objective should include some notion of managing the flow of cash. We have defined two new objectives: maximization of average and minimum available cash. For single machine scheduling, it is demonstrated that scheduling jobs in decreasing order of profit ratios maximizes the former and improves productivity. Moreover, scheduling jobs in increasing order of costs and breaking ties in decreasing order of prices maximizes the latter and creates protection against financial instability.

  17. VPipe: Virtual Pipelining for Scheduling of DAG Stream Query Plans

    Science.gov (United States)

    Wang, Song; Gupta, Chetan; Mehta, Abhay

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

  18. Heuristic-based scheduling algorithm for high level synthesis

    Science.gov (United States)

    Mohamed, Gulam; Tan, Han-Ngee; Chng, Chew-Lye

    1992-01-01

    A new scheduling algorithm is proposed which uses a combination of a resource utilization chart, a heuristic algorithm to estimate the minimum number of hardware units based on operator mobilities, and a list-scheduling technique to achieve fast and near optimal schedules. The schedule time of this algorithm is almost independent of the length of mobilities of operators as can be seen from the benchmark example (fifth order digital elliptical wave filter) presented when the cycle time was increased from 17 to 18 and then to 21 cycles. It is implemented in C on a SUN3/60 workstation.

  19. Brief-stimulus presentations on multiform tandem schedules

    OpenAIRE

    Reed, Phil

    1994-01-01

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

  20. A Value Focused Thinking Approach to Academic Course Scheduling

    National Research Council Canada - National Science Library

    Knighton, Shane

    1998-01-01

    .... The administration desired an expedient approach for course scheduling which supports the institute's mission of "providing scientific and technological education" to officers from all branches...

  1. Optimal schedules of light exposure for rapidly correcting circadian misalignment.

    Directory of Open Access Journals (Sweden)

    Kirill Serkh

    2014-04-01

    Full Text Available Jet lag arises from a misalignment of circadian biological timing with the timing of human activity, and is caused by rapid transmeridian travel. Jet lag's symptoms, such as depressed cognitive alertness, also arise from work and social schedules misaligned with the timing of the circadian clock. Using experimentally validated mathematical models, we develop a new methodology to find mathematically optimal schedules of light exposure and avoidance for rapidly re-entraining the human circadian system. In simulations, our schedules are found to significantly outperform other recently proposed schedules. Moreover, our schedules appear to be significantly more robust to both noise in light and to inter-individual variations in endogenous circadian period than other proposed schedules. By comparing the optimal schedules for thousands of different situations, and by using general mathematical arguments, we are also able to translate our findings into general principles of optimal circadian re-entrainment. These principles include: 1 a class of schedules where circadian amplitude is only slightly perturbed, optimal for dim light and for small shifts 2 another class of schedules where shifting occurs along the shortest path in phase-space, optimal for bright light and for large shifts 3 the determination that short light pulses are less effective than sustained light if the goal is to re-entrain quickly, and 4 the determination that length of daytime should be significantly shorter when delaying the clock than when advancing it.

  2. Request-Driven Schedule Automation for the Deep Space Network

    Science.gov (United States)

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

    2010-01-01

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

  3. SOFIA'S Challenge: Scheduling Airborne Astronomy Observations

    Science.gov (United States)

    Frank, Jeremy

    2005-01-01

    The Stratospheric Observatory for Infrared Astronomy (SOFIA) is NASA's next generation airborne astronomical observatory, and will commence operations in 2005. The facility consists of a 747-SP modified to accommodate a 2.5 meter telescope. SOFIA is expected to fly an average of 140 science flights per year over its 20 year lifetime. Depending on the nature of the instrument used during flight, 5-15 observations per flight are expected. The SOFIA telescope is mounted aft of the wings on the port side of the aircraft and is articulated through a range of 20deg to 60deg of elevation. The telescope has minimal lateral flexibility; thus, the aircraft must turn constantly to maintain the telescope's focus on an object during observations. A significant problem in future SOFIA operations is that of scheduling flights in support of observations. Investigators are expected to propose small numbers of observations, and many observations must be grouped together to make up single flights. Flight planning for the previous generation airborne observatory, the Kuiper Airborne Observatory (KAO), was done by hand; planners had to choose takeoff time, observations to perform, and decide on setup-actions (called "dead-legs") to position the aircraft prior to observing. This task frequently required between 6-8 hours to plan one flight The scope of the flight planning problem for supporting GI observations with the anticipated flight rate for SOFIA makes the manual approach for flight planning daunting. In response, we have designed an Automated Flight Planner (AFP) that accepts as input a set of requested observations, designated flight days, weather predictions and fuel limitations, and searches automatically for high-quality flight plans that satisfy all relevant aircraft and astronomer specified constraints. The AFP can generate one candidate flight plan in 5-10 minutes, of computation time, a feat beyond the capabilities of human flight planners. The rate at which the AFP can

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

    NARCIS (Netherlands)

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

    2008-01-01

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

  5. Dual decomposition of a single machine scheduling problem

    NARCIS (Netherlands)

    S.L. van de Velde (Steef)

    1995-01-01

    textabstractWe design a fast ascent direction algorithm for the Lagrangian dual problem of the single-machine scheduling problem of minimizing total weighted completion time subject to precedence constraints. We show that designing such an algorithm is relatively simple if a scheduling problem is

  6. Decomposition algorithm for the single machine scheduling polytope

    NARCIS (Netherlands)

    Hoeksma, R.P.; Manthey, Bodo; Uetz, Marc Jochen

    2013-01-01

    Given an $n$-vector $p$ of processing times of jobs, the single machine scheduling polytope $C$ arises as the convex hull of completion times of jobs when these are scheduled without idle time on a single machine. Given a point $x\\in C$, Carath\\'eodory's theorem implies that $x$ can be written as

  7. A decentralized scheduling algorithm for time synchronized channel hopping

    Directory of Open Access Journals (Sweden)

    Andrew Tinka

    2011-09-01

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

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

    Science.gov (United States)

    2012-06-12

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

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

    Science.gov (United States)

    2010-08-12

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

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

    Science.gov (United States)

    2010-07-19

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

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

  12. 21 CFR 113.83 - Establishing scheduled processes.

    Science.gov (United States)

    2010-04-01

    ... production shall be adequately provided for in establishing the scheduled process. Critical factors, e.g... 21 Food and Drugs 2 2010-04-01 2010-04-01 false Establishing scheduled processes. 113.83 Section 113.83 Food and Drugs FOOD AND DRUG ADMINISTRATION, DEPARTMENT OF HEALTH AND HUMAN SERVICES (CONTINUED...

  13. 7 CFR 305.29 - Vacuum heat treatment schedule.

    Science.gov (United States)

    2010-01-01

    ... 7 Agriculture 5 2010-01-01 2010-01-01 false Vacuum heat treatment schedule. 305.29 Section 305.29... SERVICE, DEPARTMENT OF AGRICULTURE PHYTOSANITARY TREATMENTS Heat Treatments § 305.29 Vacuum heat treatment schedule. T111-a-1. Place bay leaves in a vacuum chamber. Starting at 0 hour, gradually reduce to 0.133 Kpa...

  14. Decomposition algorithm for the single machine scheduling polytope

    NARCIS (Netherlands)

    Hoeksma, R.P.; Manthey, Bodo; Uetz, Marc Jochen

    2014-01-01

    Given an $n$-vector $p$ of processing times of jobs, the single machine scheduling polytope $C$ arises as the convex hull of completion times of jobs when these are scheduled without idle time on a single machine. Given a point $x\\in C$, Carathéodory's theorem implies that $x$ can be written as

  15. Schedule for Rating Disabilities; the Endocrine System. Final rule.

    Science.gov (United States)

    2017-11-02

    This document amends the Department of Veterans Affairs (VA) Schedule for Rating Disabilities (VASRD) by revising the portion of the Schedule that addresses endocrine conditions and disorders of the endocrine system. The effect of this action is to ensure that the VASRD uses current medical terminology and to provide detailed and updated criteria for evaluation of endocrine disorders.

  16. 7 CFR 305.22 - Hot water immersion treatment schedules.

    Science.gov (United States)

    2010-01-01

    ... 7 Agriculture 5 2010-01-01 2010-01-01 false Hot water immersion treatment schedules. 305.22... Hot water immersion treatment schedules. (a) T102-d. (1) Fruit must be grown and treated in Hawaii. (2) Fruit must be submerged at least 4 inches below the water's surface in a hot water immersion treatment...

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

  18. Performance Evaluation of Proportional Fair Scheduling Algorithm with Measured Channels

    DEFF Research Database (Denmark)

    Sørensen, Troels Bundgaard; Pons, Manuel Rubio

    2005-01-01

    Motivated by the promising performance results of the proportional fair (PF) packet scheduling algorithm, often quoted in connection with WCDMA High Speed Downlink Packet Access (HSDPA), we have performed an evaluation of the PF gain in comparison to the simpler round robin (RR) scheduler when...

  19. Agent-based transportation planning compared with scheduling heuristics

    NARCIS (Netherlands)

    Mes, Martijn R.K.; van der Heijden, Matthijs C.; van Harten, Aart

    2004-01-01

    Here we consider the problem of dynamically assigning vehicles to transportation orders that have di¤erent time windows and should be handled in real time. We introduce a new agent-based system for the planning and scheduling of these transportation networks. Intelligent vehicle agents schedule

  20. Evaluation of the planting schedule of soyabean/cassava intercrop ...

    African Journals Online (AJOL)

    Seven soyabean/cassava intercrop planting schedules were evaluated in a field trial at the National Cereal Research Institute, Badeggi during the 2005 and 2006 cropping seasons with a view to determining the planting schedule that will result in optimum yields of the component crops. Experimental design was ...

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

    DEFF Research Database (Denmark)

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

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

  2. 18 CFR 5.19 - Tendering notice and schedule.

    Science.gov (United States)

    2010-04-01

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

  3. 19 CFR 207.21 - Final phase notice of scheduling.

    Science.gov (United States)

    2010-04-01

    ... 19 Customs Duties 3 2010-04-01 2010-04-01 false Final phase notice of scheduling. 207.21 Section... INVESTIGATIONS OF WHETHER INJURY TO DOMESTIC INDUSTRIES RESULTS FROM IMPORTS SOLD AT LESS THAN FAIR VALUE OR FROM... notice of scheduling. (a) Notice from the administering authority of an affirmative preliminary...

  4. Finding Worst-Case Flexible Schedules using Coevolution

    DEFF Research Database (Denmark)

    Jensen, Mikkel Thomas

    2001-01-01

    Finding flexible schedules is important to industry, since in many environments changes such as machine breakdowns or the appearance of new jobs can happen at short notice.......Finding flexible schedules is important to industry, since in many environments changes such as machine breakdowns or the appearance of new jobs can happen at short notice....

  5. Scheduling Lacquer Production by Reachability Analysis -- A Case Study

    NARCIS (Netherlands)

    Behrmann, Gerd; Brinksma, Hendrik; Hendriks, Martijn; Mader, Angelika H.

    In this paper we describe a case study on lacquer production scheduling that was performed in the European IST-project AMETIST and was provided by one of the industrial partners. The approach is to derive schedules by means of reachability analysis: with this technique the search mechanism of model

  6. Incidence of obesity in parturients scheduled for caesarean section ...

    African Journals Online (AJOL)

    Objectives: To determine the incidence of obesity in parturients scheduled for Caesarean section, identify intra-operative complications, management and outcome. Design: A prospective observational study. Setting: University of Benin Teaching Hospital, a university-affiliated tertiary centre. Subjects: Parturients scheduled ...

  7. A reclaimer scheduling problem arising in coal stockyard management

    OpenAIRE

    Angelelli, Enrico; Kalinowski, Thomas; Kapoor, Reena; Savelsbergh, Martin W. P.

    2014-01-01

    We study a number of variants of an abstract scheduling problem inspired by the scheduling of reclaimers in the stockyard of a coal export terminal. We analyze the complexity of each of the variants, providing complexity proofs for some and polynomial algorithms for others. For one, especially interesting variant, we also develop a constant factor approximation algorithm.

  8. Bumpless Transfer between Observer-based Gain Scheduled Controllers

    DEFF Research Database (Denmark)

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

    2005-01-01

    subsequently be achieved by interpolating between each controller. The Youla-Jabr-Bongiorno-Kucera (YJBK) parameterisation is used to achieve a smooth scheduling between the controllers. This approach produces a scheduled controller as a linear fractional transformation between a fixed controller...

  9. 31 CFR 223.14 - Schedules of single risks.

    Science.gov (United States)

    2010-07-01

    ... 31 Money and Finance: Treasury 2 2010-07-01 2010-07-01 false Schedules of single risks. 223.14 Section 223.14 Money and Finance: Treasury Regulations Relating to Money and Finance (Continued) FISCAL... UNITED STATES § 223.14 Schedules of single risks. During the months of January, April, July, and October...

  10. Optimal sampling schedule for chemical exchange saturation transfer.

    Science.gov (United States)

    Tee, Y K; Khrapitchev, A A; Sibson, N R; Payne, S J; Chappell, M A

    2013-11-01

    The sampling schedule for chemical exchange saturation transfer imaging is normally uniformly distributed across the saturation frequency offsets. When this kind of evenly distributed sampling schedule is used to quantify the chemical exchange saturation transfer effect using model-based analysis, some of the collected data are minimally informative to the parameters of interest. For example, changes in labile proton exchange rate and concentration mainly affect the magnetization near the resonance frequency of the labile pool. In this study, an optimal sampling schedule was designed for a more accurate quantification of amine proton exchange rate and concentration, and water center frequency shift based on an algorithm previously applied to magnetization transfer and arterial spin labeling. The resulting optimal sampling schedule samples repeatedly around the resonance frequency of the amine pool and also near to the water resonance to maximize the information present within the data for quantitative model-based analysis. Simulation and experimental results on tissue-like phantoms showed that greater accuracy and precision (>30% and >46%, respectively, for some cases) were achieved in the parameters of interest when using optimal sampling schedule compared with evenly distributed sampling schedule. Hence, the proposed optimal sampling schedule could replace evenly distributed sampling schedule in chemical exchange saturation transfer imaging to improve the quantification of the chemical exchange saturation transfer effect and parameter estimation. Copyright © 2013 Wiley Periodicals, Inc.

  11. 48 CFR 49.602-3 - Schedule of accounting information.

    Science.gov (United States)

    2010-10-01

    ... 48 Federal Acquisition Regulations System 1 2010-10-01 2010-10-01 false Schedule of accounting information. 49.602-3 Section 49.602-3 Federal Acquisition Regulations System FEDERAL ACQUISITION REGULATION... accounting information. Standard Form 1439, Schedule of Accounting Information, shall be filed in support of...

  12. 40 CFR Appendix II to Part 86 - Temperature Schedules

    Science.gov (United States)

    2010-07-01

    ... 40 Protection of Environment 19 2010-07-01 2010-07-01 false Temperature Schedules II Appendix II... Appendix II to Part 86—Temperature Schedules (a) Ambient temperature cycle for the diurnal emission portion of the evaporative emission test (see § 86.133). Table I—Temperature Versus Time Sequence Use linear...

  13. 48 CFR 1371.104 - Schedule of work.

    Science.gov (United States)

    2010-10-01

    ... 48 Federal Acquisition Regulations System 5 2010-10-01 2010-10-01 false Schedule of work. 1371.104 Section 1371.104 Federal Acquisition Regulations System DEPARTMENT OF COMMERCE DEPARTMENT SUPPLEMENTAL... of work. Insert clause 1352.271-73, Schedule of Work, in all solicitations and contracts for ship...

  14. Using Integer Programming for Airport Service Planning in Staff Scheduling

    Directory of Open Access Journals (Sweden)

    W.H. Ip

    2010-09-01

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

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

  16. Drying schedules calculation of Camiyani Black Pine ( Pinus nigra ...

    African Journals Online (AJOL)

    In this study, computer aided drying schedules were developed for Camiyani Black Pine (Pinus nigra var. pallasiana) lumber for less than 30 mm thick, between 30-60 mm thick and larger than 60 mm. Schedules were calculated on drying gradient basis. In this software (named KILNBRAIN), users can find more then one ...

  17. Distributed energy resources scheduling considering real-time resources forecast

    DEFF Research Database (Denmark)

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

    2014-01-01

    Energy resource scheduling is becoming increasingly important, such as the use of more distributed generators and electric vehicles connected to the distribution network. This paper proposes a methodology to be used by Virtual Power Players (VPPs), regarding the energy resource scheduling in smar...

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

    Science.gov (United States)

    2010-01-01

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

  19. 40 CFR 798.6500 - Schedule-controlled operant behavior.

    Science.gov (United States)

    2010-07-01

    ... recommended. (ii) Age. Experimental animals should be young adults. Rats or mice should be at least 14 and 6... suitable period of time. (v) Schedule selection. The schedule of reinforcement chosen should generate... guideline the following references should be consulted: (1) Dews, P.B. “Assessing the Effects of Drugs...

  20. Improving the performance of sorter systems by scheduling inbound containers

    NARCIS (Netherlands)

    Haneyah, S.W.A.; Schutten, Johannes M.J.; Fikse, K.

    2013-01-01

    This paper addresses the inbound containers scheduling problem for automated sorter systems in two different industrial sectors: parcel & postal sorting and baggage handling. We build on existing literature, particularly on the dynamic load balancing algorithm designed for the parcel hub scheduling

  1. Linearly Ordered Attribute Grammar Scheduling Using SAT-Solving

    NARCIS (Netherlands)

    Bransen, Jeroen; van Binsbergen, L.Thomas; Claessen, Koen; Dijkstra, Atze

    2015-01-01

    Many computations over trees can be specified using attribute grammars. Compilers for attribute grammars need to find an evaluation order (or schedule) in order to generate efficient code. For the class of linearly ordered attribute grammars such a schedule can be found statically, but this problem

  2. Block Scheduling: A Catalyst for Change in High Schools.

    Science.gov (United States)

    Canady, Robert Lynn; Rettig, Michael D.

    This book presents detailed descriptions of alternative types of block schedules and discusses their effects on teachers and students. The book shows administrators how to organize their schools so that time enhances instruction and fosters learning. Chapter 1 discusses problems with the traditional high school schedule and chapter 2 provides…

  3. M-machine SDST flow shop scheduling using modified heuristic ...

    African Journals Online (AJOL)

    A very restricted research has been reported on bi-criteria SDST flow shop scheduling problems dealing with due date related performance measures. In the present work, a modified heuristic based genetic algorithm (MHGA) has been developed for the aforesaid scheduling problem subject to the minimization of weighted ...

  4. INTERACTIVE TOOL FOR SCHEDULING JOBS IN A FLEXIBLE MANUFACTURING ENVIRONMENT

    NARCIS (Netherlands)

    SLOMP, J; GUPTA, JND

    1992-01-01

    This paper describes an innovative interactive decision making tool for scheduling jobs in a flexible manufacturing environment. While the proposed tool provides computer integrated mechanism for scheduling jobs to the flexible manufacturing systems, it retains the human touch needed to augment

  5. How an Alternating-Day Schedule Empowers Teachers.

    Science.gov (United States)

    DiRocco, Mark D.

    1999-01-01

    The Lewisburg (Pennsylvania) Area Middle School has successfully implemented an alternating-day block schedule that has yielded improved academic performance. The positive effect may derive from administrative support, teacher empowerment, and community agreement. The culture of the traditional schedule and school year remains essentially intact,…

  6. Page 1 § > * r | *, Brownian approximation for scheduling {}39 ...

    Indian Academy of Sciences (India)

    Van Laarhoven P J M, Aarts E H L, Lenstra J K 1992 Job shop scheduling by simulated annealing. Oper. Res. 40: 1156–1179. Veatch M H, Wein L. M. 1992 ... Slochastic processes and queueing theory (Englewood Cliffs, NJ: Prentice Hall). Yao D D, Shantikumar J C 1990 Optimal scheduling control of a flexible machine.

  7. 41 CFR 51-9.304-5 - Reproduction fee schedule.

    Science.gov (United States)

    2010-07-01

    ... 41 Public Contracts and Property Management 1 2010-07-01 2010-07-01 true Reproduction fee schedule... RULES 9.3-Individual Access to Records § 51-9.304-5 Reproduction fee schedule. (a) The fee for... physical characteristics do not permit reproduction by routine electrostatic copying shall be the direct...

  8. 36 CFR 1258.12 - NARA reproduction fee schedule.

    Science.gov (United States)

    2010-07-01

    ... 36 Parks, Forests, and Public Property 3 2010-07-01 2010-07-01 false NARA reproduction fee... ADMINISTRATION PUBLIC AVAILABILITY AND USE FEES § 1258.12 NARA reproduction fee schedule. (a) Certification: $15...) Unlisted processes: For reproductions not covered by this fee schedule, see also § 1258.4. Fees for other...

  9. Genetic study of scheduled caste populations of Tamil Nadu

    Indian Academy of Sciences (India)

    Home; Journals; Journal of Genetics; Volume 87; Issue 2. Genetic study of scheduled caste populations of Tamil Nadu. M. Vijaya S. Kanthimathi A. Ramesh. Research Note Volume 87 Issue 2 ... Keywords. caste system; genetic affinity; scheduled castes; socio-economic groups; Tamil Nadu; principal component analysis.

  10. 76 FR 57681 - Modification of Interlibrary Loan Fee Schedule

    Science.gov (United States)

    2011-09-16

    ... Interlibrary Loan Fee Schedule AGENCY: Agricultural Research Service, USDA. ACTION: Proposed rule. SUMMARY: The Agricultural Research Service proposes to amend its regulations on the fee schedule for interlibrary loan from... debit/credit program for interlibrary loan) rather than type of material requested (loan, photocopy...

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

    NARCIS (Netherlands)

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

    2009-01-01

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

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

    Science.gov (United States)

    2010-04-15

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

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

    DEFF Research Database (Denmark)

    Pop, Paul

    2000-01-01

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

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

    Science.gov (United States)

    2013-06-04

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

  15. Multi-agent Pareto appointment exchanging in hospital patient scheduling

    NARCIS (Netherlands)

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

    2007-01-01

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

  16. 76 FR 18137 - Amendment of the Schedule of Application Fees

    Science.gov (United States)

    2011-04-01

    ... COMMISSION 47 CFR Part 1 Amendment of the Schedule of Application Fees AGENCY: Federal Communications..., the Commission required the filing of application fees in such cases, and section 1.1104, the Schedule... permits in the broadcast services in conjunction with their long-form applications. DATES: Comments are...

  17. An RF interference mitigation methodology with potential applications in scheduling

    Science.gov (United States)

    Wong, Yen F.; Rash, James L.

    1991-01-01

    Software tools for interference analysis and mitigation were developed in the Communications Link Analysis and Simulation System (CLASS) environment for: communications performance evaluation; and mission planning. Potential applications are seen in analysis, evaluation, and optimization of user schedules. Tools producing required separation angles and potential interference intervals can be used as an aid to mutual interference mitigation within a scheduling system.

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

    NARCIS (Netherlands)

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

    2014-01-01

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

  19. 7 CFR 305.28 - Kiln sterilization treatment schedule.

    Science.gov (United States)

    2010-01-01

    ... 7 Agriculture 5 2010-01-01 2010-01-01 false Kiln sterilization treatment schedule. 305.28 Section 305.28 Agriculture Regulations of the Department of Agriculture (Continued) ANIMAL AND PLANT HEALTH... sterilization treatment schedule. T404-b-4 Dry bulb temperature( °F) Wet bulb depression( °F) Percent...

  20. Concept of Indoor 3D-Route UAV Scheduling System

    DEFF Research Database (Denmark)

    Khosiawan, Yohanes; Nielsen, Izabela Ewa; Do, Ngoc Ang Dung

    2016-01-01

    environment. On top of that, the multi-source productive best-first-search concept also supports efficient real-time scheduling in response to uncertain events. Without human intervention, the proposed work provides an automatic scheduling system for UAV routing problem in 3D indoor environment....

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

  2. Safety Training: scheduled sessions in April

    CERN Multimedia

    DGS Unit

    2011-01-01

    The following training courses are scheduled in April. You can find the full Safety Training programme on the Safety Training online catalogue. If you are interested in attending any of the below courses, please talk to your supervisor, then apply electronically via EDH from the course description pages, by clicking on SIGN-UP. Registration for all courses is always open – sessions for the less-requested courses are organized on a demand-basis only. Depending on the demand, a session will be organised later in the year. Biocell Training 26-APR-11 (08.30 – 10.00) in French 26-APR-11 (10.30 – 12.00) in French Conduite de plates-formes élévatrices mobiles de personnel (PEMP) 28-APR-11 to 29-APR-11 (08.00 – 17.30) in French* Sécurité chimique – Introduction 29-APR-11 (09.00 – 11.30) in French (*) session in French with the possibility of receiving the documentation in English   By Isabelle Cusato (H...

  3. Metaheuristic Approaches for Hydropower System Scheduling

    Directory of Open Access Journals (Sweden)

    Ieda G. Hidalgo

    2015-01-01

    Full Text Available This paper deals with the short-term scheduling problem of hydropower systems. The objective is to meet the daily energy demand in an economic and safe way. The individuality of the generating units and the nonlinearity of their efficiency curves are taken into account. The mathematical model is formulated as a dynamic, mixed integer, nonlinear, nonconvex, combinatorial, and multiobjective optimization problem. We propose two solution methods using metaheuristic approaches. They combine Genetic Algorithm with Strength Pareto Evolutionary Algorithm and Ant Colony Optimization. Both approaches are divided into two phases. In the first one, to maximize the plant’s net generation, the problem is solved for each hour of the day (static dispatch. In the second phase, to minimize the units’ switching on-off, the day is considered as a whole (dynamic dispatch. The proposed methodology is applied to two Brazilian hydroelectric plants, in cascade, that belong to the national interconnected system. The nondominated solutions from both approaches are presented. All of them meet demand respecting the physical, electrical, and hydraulic constraints.

  4. Scheduling of Multiple Chillers in Trigeneration Plants

    Directory of Open Access Journals (Sweden)

    Chris Underwood

    2015-10-01

    Full Text Available The scheduling of both absorption cycle and vapour compression cycle chillers in trigeneration plants is investigated in this work. Many trigeneration plants use absorption cycle chillers only but there are potential performance advantages to be gained by using a combination of absorption and compression chillers especially in situations where the building electrical demand to be met by the combined heat and power (CHP plant is variable. Simulation models of both types of chillers are developed together with a simple model of a variable-capacity CHP engine developed by curve-fitting to supplier’s data. The models are linked to form an optimisation problem in which the contribution of both chiller types is determined at a maximum value of operating cost (or carbon emission saving. Results show that an optimum operating condition arises at moderately high air conditioning demands and moderately low power demand when the air conditioning demand is shared between both chillers, all recovered heat is utilised, and the contribution arising from the compression chiller results in an increase in CHP power generation and, hence, engine efficiency.

  5. An Optimal Transportation Schedule of Mobile Equipment

    Directory of Open Access Journals (Sweden)

    S. Guillén-Burguete

    2012-10-01

    Full Text Available Motivated by a problem faced by road construction companies, we develop a new model to obtain an optimaltransportation schedule of mobile machines which have to travel to execute tasks. In this problem, each task ischaracterized by the location where it is to be executed, a work-content in terms of machine-time units, and one ormore time intervals within which it can be performed. The machines can be transported from one location to anotherat any time, thus the problem has an indefinite number of variables. However, this indefinite number of variables canbe reduced to a definite one because, as we prove, the problem has an optimal solution in which the arrivals ofmachines occur only at certain time instants. The objective is to minimize the total transportation cost such that all thetasks are executed within their time intervals. The constraints ensuring that the tasks are processed within theirprescribed time intervals are nonlinear; nevertheless, due to the sets of the possible arrival times of the machinesforming bounded convex polyhedra, our problem can be transformed into a mixed integer linear program by the samedevice used in the decomposition principle of Dantzig-Wolfe.

  6. Safety Training: scheduled sessions in March

    CERN Multimedia

    DGS Unit

    2011-01-01

    The following training courses are scheduled in March. You can find the full Safety Training programme on the Safety Training online catalogue. If you are interested in attending any of the below courses, please talk to your supervisor, then apply electronically via EDH from the course description pages, by clicking on SIGN-UP. Registration for all courses is always open – sessions for the less-requested courses are organized on a demand-basis only. Depending on the demand, a session will be organised later in the year. Biocell Training 08-MAR-11 (08.30 – 10.00) in English 08-MAR-11 (10.30 – 12.00) in French 15-MAR-11 (08.30 – 10.00) in French 15-MAR-11 (10.30 – 12.00) in French 17-MAR-11 (08.30 – 10.00) in English 17-MAR-11 (10.30 – 12.00) in English 22-MAR-11 (08.30 – 10.00) in French 22-MAR-11 (10.30 – 12.00) in French 24-MAR-11 (08.30 – 10.00) in French 24-MAR-11 (10.30 – 12.00) in French 29-MAR...

  7. Safety Training: scheduled sessions in May

    CERN Multimedia

    Isabelle Cusato (HSE Unit)

    2011-01-01

    The following training courses are scheduled in March. You can find the full Safety Training programme on the Safety Training online catalogue. If you are interested in attending any of the below courses, please talk to your supervisor, then apply electronically via EDH from the course description pages, by clicking on SIGN-UP. Registration for all courses is always open – sessions for the less-requested courses are organized on a demand-basis only. Depending on the demand, a session will be organised later in the year.   Biocell Training 10-MAY-11 (08.30 – 10.00) in French 10-MAY-11 (10.30 – 12.00) in French 12-MAY-11 (08.30 – 10.00) in English 12-MAY-11 (10.30 – 12.00) in English 19-MAY-11 (08.30 – 10.00) in French 19-MAY-11 (10.30 – 12.00) in French 24-MAY-11 (08.30 – 10.00) in English 24-MAY-11 (10.30 – 12.00) in English   Champs Magnétiques 13-MAY-11 (09.30 – 11.30) in French...

  8. Fair packet scheduling in Wireless Mesh Networks

    KAUST Repository

    Nawab, Faisal

    2014-02-01

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

  9. Data-oriented scheduling for PROOF

    Science.gov (United States)

    Xu, Neng; Guan, Wen; Wu, Sau Lan; Ganis, Gerardo

    2011-12-01

    The Parallel ROOT Facility - PROOF - is a distributed analysis system optimized for I/O intensive analysis tasks of HEP data. With LHC entering the analysis phase, PROOF has become a natural ingredient for computing farms at Tier3 level. These analysis facilities will typically be used by a few tenths of users, and can also be federated into a sort of analysis cloud corresponding to the Virtual Organization of the experiment. Proper scheduling is required to guarantee fair resource usage, to enforce priority policies and to optimize the throughput. In this paper we discuss an advanced priority system that we are developing for PROOF. The system has been designed to automatically adapt to unknown length of the tasks, to take into account the data location and availability (including distribution across geographically separated sites), and the {group, user} default priorities. In this system, every element - user, group, dataset, job slot and storage - gets its priority and those priorities are dynamically linked with each other. In order to tune the interplay between the various components, we have designed and started implementing a simulation application that can model various type and size of PROOF clusters. In this application a monitoring package records all the changes of them so that we can easily understand and tune the performance. We will discuss the status of our simulation and show examples of the results we are expecting from it.

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

  11. In-Space Crew-Collaborative Task Scheduling

    Science.gov (United States)

    Jaap, John; Meyer, Patrick; Davis, Elizabeth; Richardson, Lea

    2006-01-01

    As humans venture farther from Earth for longer durations, it will become essential for those on the journey to have significant control over the scheduling of their own activities as well as the activities of their companion systems and robots. However, the crew will not do all the scheduling; timelines will be the result of collaboration with ground personnel. Emerging technologies such as in-space message buses, delay-tolerant networks, and in-space internet will be the carriers on which the collaboration rides. Advances in scheduling technology, in the areas of task modeling, scheduling engines, and user interfaces will allow the crew to become virtual scheduling experts. New concepts of operations for producing the timeline will allow the crew and the ground support to collaborate while providing safeguards to ensure that the mission will be effectively accomplished without endangering the systems or personnel.

  12. Scheduling IT Staff at a Bank: A Mathematical Programming Approach

    Directory of Open Access Journals (Sweden)

    M. Labidi

    2014-01-01

    Full Text Available We address a real-world optimization problem: the scheduling of a Bank Information Technologies (IT staff. This problem can be defined as the process of constructing optimized work schedules for staff. In a general sense, it requires the allocation of suitably qualified staff to specific shifts to meet the demands for services of an organization while observing workplace regulations and attempting to satisfy individual work preferences. A monthly shift schedule is prepared to determine the shift duties of each staff considering shift coverage requirements, seniority-based workload rules, and staff work preferences. Due to the large number of conflicting constraints, a multiobjective programming model has been proposed to automate the schedule generation process. The suggested mathematical model has been implemented using Lingo software. The results indicate that high quality solutions can be obtained within a few seconds compared to the manually prepared schedules.

  13. Minimum makespan task scheduling algorithm in cloud computing

    Directory of Open Access Journals (Sweden)

    N Sasikaladevi

    2016-11-01

    Full Text Available Cloud computing provides powerful and on-demand business environment. It is built on top of virtualized data centers. Virtualization provides the flexible infrastructure for cloud. But, managing the resources and scheduling the tasks in virtualized data center is a challenging task. This paper proposes a minimum makespan task scheduling framework named MMSF and minimum makespan task scheduling algorithm named as MMA. This algorithm is developed with two objectives. First, minimizing the total makespan and maximizing the virtual machine utilization. The task scheduling problem is formulated as multi-objective optimization problem. It is solved by using optimization techniques. Experiments shows that MMA outperforms the traditional task scheduling algorithms based on total makespan and virtual machine utilization.

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

    Science.gov (United States)

    Ward, M. T.

    1987-01-01

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

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

  16. Master schedule for CY-1981 Hanford environmental surveillance routine program

    Energy Technology Data Exchange (ETDEWEB)

    Blumer, P.J.; Sula, M.J.; Eddy, P.A.

    1980-12-01

    The current schedule of data collection for the routine environmental surveillance program at the Hanford Site is provided. Questions about specific entries should be referred to the authors since modifications to the schedule are made during the year and special areas of study, usually of short duration, are not scheduled. The environmental surveillance program objectives are to evaluate the levels of radioactive and nonradioactive pollutants in the Hanford environs, as required in Manual Chapter 0513, and to monitor Hanford operations for compliance with applicable environmental criteria given in Manual Chapter 0524 and Washington State Water Quality Standards. Air quality data obtained in a separate program are also reported. The collection schedule for potable water is shown but it is not part of the routine environmental surveillance program. Schedules are presented for the following subjects: air, Columbia River, sanitary water, surface water, ground water, foodstuffs, wildlife, soil and vegetation, external radiation measurement, portable instrument surveys, and surveillance of waste disposal sites. (JGB)

  17. How do employees prioritise when they schedule their own shifts?

    DEFF Research Database (Denmark)

    Nielsen, Kirsten Nabe; Lund, Henrik Lambrecht; Ajslev, Jeppe Zielinski Nguyen

    2013-01-01

    We investigated how employees prioritised when they scheduled their own shifts and whether priorities depended on age, gender, educational level, cohabitation and health status. We used cross-sectional questionnaire data from the follow-up survey of an intervention study investigating the effect...... of self-scheduling (n = 317). Intervention group participants were asked about their priorities when scheduling their own shifts succeeded by 17 items covering family/private life, economy, job content, health and sleep. At least half of the participants reported that they were giving high priority...... to their family life, having consecutive time off, leisure-time activities, rest between shifts, sleep, regularity of their everyday life, health and that the work schedule balanced. Thus, employees consider both their own and the workplace's needs when they have the opportunity to schedule their own shifts. Age...

  18. Research on remanufacturing scheduling problem based on critical chain management

    Science.gov (United States)

    Cui, Y.; Guan, Z.; He, C.; Yue, L.

    2017-06-01

    Remanufacturing is the recycling process of waste products as “as good as new products”, compared with materials recycling, remanufacturing represents a higher form of recycling. The typical structure of remanufacturing system consists of three parts: disassembly workshop, remanufacturing workshop and assembly workshop. However, the management of production planning and control activities can differ greatly from management activities in traditional manufacturing. Scheduling in a remanufacturing environment is more complex and the scheduler must deal with more uncertainty than in a traditional manufacturing environment. In order to properly schedule in a remanufacturing environment the schedule must be able to cope with several complicating factors which increase variability. This paper introduced and discussed seven complicating characteristics that require significant changes in production planning and control activities, in order to provide a new method for remanufacturing production scheduling system.

  19. Optimising steel production schedules via a hierarchical genetic algorithm

    Directory of Open Access Journals (Sweden)

    Worapradya, Kiatkajohn

    2014-08-01

    Full Text Available This paper presents an effective scheduling in a steel-making continuous casting (SCC plant. The main contribution of this paper is the formulation of a new optimisation model that more closely represents real-world situations, and a hierarchical genetic algorithm (HGA tailored particularly for searching for an optimal SCC schedule. The optimisation model is developed by integrating two main planning phases of traditional scheduling: (1 planning cast sequence, and (2 scheduling of steel-making and timing of all jobs. A novel procedure is given for genetic algorithm (GA chromosome coding that maps Gantt chart and hierarchical chromosomes. The performance of the proposed methodology is illustrated and compared with a two-phase traditional scheduling and a standard GA toolbox. Both qualitative and quantitative performance measures are investigated.

  20. Search Space Characterization for a Telescope Scheduling Application

    Science.gov (United States)

    Bresina, John; Drummond, Mark; Swanson, Keith; Friedland, Peter (Technical Monitor)

    1994-01-01

    This paper presents a technique for statistically characterizing a search space and demonstrates the use of this technique within a practical telescope scheduling application. The characterization provides the following: (i) an estimate of the search space size, (ii) a scaling technique for multi-attribute objective functions and search heuristics, (iii) a "quality density function" for schedules in a search space, (iv) a measure of a scheduler's performance, and (v) support for constructing and tuning search heuristics. This paper describes the random sampling algorithm used to construct this characterization and explains how it can be used to produce this information. As an example, we include a comparative analysis of an heuristic dispatch scheduler and a look-ahead scheduler that performs greedy search.

  1. Automated long-term scheduling for the SOFIA airborne observatory

    Science.gov (United States)

    Civeit, Thomas

    The NASA Stratospheric Observatory for Infrared Astronomy (SOFIA) is a joint US/German project to develop and operate a gyro-stabilized 2.5-meter telescope in a Boeing 747SP. SOFIA's first science observations were made in December 2010. During 2011, SOFIA accomplished 30 flights in the “ Early Science” program as well as a deployment to Germany. The next observing period, known as Cycle 1, is scheduled to begin in late fall 2012. It includes 46 science flights grouped in four multi-week observing campaigns spread through a 13-month span. Automation of the flight scheduling process offers a major challenge to the SOFIA mission operations. First because it is needed to mitigate its relatively high cost per unit observing time compared to space-borne missions. Second because automated scheduling techniques available for ground-based and space-based telescopes are inappropriate for an airborne observatory. Although serious attempts have been made in the past to solve part of the problem, until recently mission operations staff was still manually scheduling flights. We present in this paper a new automated solution for generating SOFIA's long-term schedules. We describe the constraints that should be satisfied to solve the SOFIA scheduling problem in the context of real operations. We establish key formulas required to efficiently calculate the aircraft course over ground when evaluating flight schedules. We describe the foundations of the SOFIA long-term scheduler, the constraint representation, and the random search based algorithm that generates observation and instrument schedules. Finally, we report on how the new long-term scheduler has been used in operations to date.

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

    Science.gov (United States)

    Lee, Sandra; Huang, Hui; Zelen, Marvin

    2004-12-01

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

  3. Advanced sleep schedules affect circadian gene expression in young adults with delayed sleep schedules.

    Science.gov (United States)

    Zhu, Yong; Fu, Alan; Hoffman, Aaron E; Figueiro, Mariana G; Carskadon, Mary A; Sharkey, Katherine M; Rea, Mark S

    2013-05-01

    Human circadian rhythms are regulated by the interplay between circadian genes and environmental stimuli. The influence of altered sleep-wake schedules or light on human circadian gene expression patterns is not well characterized. Twenty-one young adults were asked to keep to their usual sleep schedules and two blood samples were drawn at the end of the first week from each subject based on estimated time of dim light melatonin onset (DLMO); the first sample was obtained one and a half hours before the estimated DLMO and the second three hours later, at one and a half hours after the estimated DLMO. During the second week, participants were randomized into two groups, one that received a one hour blue-light (λmax=470 nm) exposure in the morning and one that received a comparable morning dim-light exposure. Two blood samples were obtained at the same clock times as the previous week at the end of the second week. We measured the expression of 10 circadian genes in response to sleep-wake schedule advancement and morning blue-light stimulation in the peripheral blood of 21 participants during a two-week field study. We found that nine of the 10 circadian genes showed significant expression changes from the first to the second week for participants in both the blue-light and dim-light groups, likely reflecting significant advances in circadian phase. This wholesale change in circadian gene expression may reflect considerable advances in circadian phase (i.e., advance in DLMO) from the first to the second week resulting from the advanced, daily personal light exposures. Copyright © 2013 Elsevier B.V. All rights reserved.

  4. Vehicle Scheduling with Network Flow Models

    Directory of Open Access Journals (Sweden)

    Gustavo P. Silva

    2010-04-01

    Full Text Available

    Este trabalho retrata a primeira fase de uma pesquisa de doutorado voltada para a utilização de modelos de fluxo em redes para programação de veículos (de ônibus, em particular. A utilização de modelos deste tipo ainda e muito pouco explorada na literatura, principalmente pela dificuldade imposta pelo grande numero de variáveis resultante. Neste trabalho são apresentadas formulações para tratamento do problema de programação de veículos associados a um único depósito (ou garagem como problema de fluxo em redes, incluindo duas técnicas para reduzir o numero de arcos na rede criada e, conseqüentemente, o numero de variáveis a tratar. Uma destas técnicas de redução de arcos foi implementada e o problema de fluxo resultante foi direcionado para ser resolvido, nesta fase da pesquisa, por uma versão disponível do algoritmo Simplex para redes. Problemas teste baseados em dados reais da cidade de Reading, UK, foram resolvidos com a utilização da formulação de fluxo em redes adotada, e os resultados comparados com aqueles obtidos pelo método heurístico BOOST, o qual tem sido largamente testado e comercializado pela School of Computer Studies da Universidade de Leeds, UK. Os resultados alcançados demonstram a possibilidade de tratamento de problemas reais com a técnica de redução de arcos.

    ABSTRACT

    This paper presents the successful results of a first phase of a doctoral research addressed to solving vehicle (bus, in particular scheduling problems through network flow formulations. Network flow modeling for this kind of problem is a promising, but not a well explored approach, mainly because of the large number of variables related to number of arcs of real case networks. The paper presents and discusses some network flow formulations for the single depot bus vehicle scheduling problem, along with two techniques of arc reduction. One of these arc reduction techniques has been implemented and the underlying

  5. AN EFFECTIVE SCHEDULING SCHEME FOR LIFT CLUBS

    Directory of Open Access Journals (Sweden)

    W. Van Wijck

    2012-01-01

    Full Text Available

    ENGLISH ABSTRACT: This paper describes a formula for scheduling the day-to-day operation of a lift club. The formula is remarkably simple, and can easily be implemented on a spreadsheet. It is also extremely flexible and can cater for almost any peculiarity that may arise. Much like a business, the lift club is viewed as an entity in its own right, rather than as a collection of individuals. The scheme can be used to generate interesting statistics such as percentage utilization of each member, average percentage utilization of all members, effective size of the lift club, etc. In addition, a graph, depicting each member's liability towards the club against time, can be generated. Finally, every member can obtain a record of his/her trip data over any specific period, which may be handy for income tax purposes.

    AFRIKAANSE OPSOMMING: Hierdie artikel beskryf 'n fonnule vir die dag-tot-dag skedulering van 'n saamryklub. Die fonnule is merkwaardig eenvoudig en kan maklik op 'n sigblad geimplementeer word. Dit is ook besonder buigsaam deurdat dit vir bykans enige gebeurlikheid voorsienning maak. Die voorgestelde skeduleringsmetode beskou die saamryklub as 'n entiteit in eie reg, en skeduleing word vanuit die saamryklub se oogpunt gedoen. Die skema kan gebruik word om interesante statistieke soos byvoorbeeld die persentasie benutting deur enige lid, die gemiddelde persentasie benutting deur aIle lede, die effektiewe grootte van die klub, ens., te genereer. Voorts kan 'n grafiek gegenereer word wat elke lid se aanspreeklikheid teenoor die klub as 'n funksie van tyd grafies vertoon. Laastens kan enige lid op enige stadium 'n rekord trek van die aantal saamrygeleenthede wat hy oor 'n bepaalde periode voorsien en ontvang het. Dit mag handig wees vir belasting doeleindes.

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

    Science.gov (United States)

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

    2015-04-24

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

  7. Scheduling Independent Partitions in Integrated Modular Avionics Systems.

    Science.gov (United States)

    Chen, Jinchao; Du, Chenglie; Han, Pengcheng

    2016-01-01

    Recently the integrated modular avionics (IMA) architecture has been widely adopted by the avionics industry due to its strong partition mechanism. Although the IMA architecture can achieve effective cost reduction and reliability enhancement in the development of avionics systems, it results in a complex allocation and scheduling problem. All partitions in an IMA system should be integrated together according to a proper schedule such that their deadlines will be met even under the worst case situations. In order to help provide a proper scheduling table for all partitions in IMA systems, we study the schedulability of independent partitions on a multiprocessor platform in this paper. We firstly present an exact formulation to calculate the maximum scaling factor and determine whether all partitions are schedulable on a limited number of processors. Then with a Game Theory analogy, we design an approximation algorithm to solve the scheduling problem of partitions, by allowing each partition to optimize its own schedule according to the allocations of the others. Finally, simulation experiments are conducted to show the efficiency and reliability of the approach proposed in terms of time consumption and acceptance ratio.

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

  9. Locomotive Schedule Optimization for Da-qin Heavy Haul Railway

    Directory of Open Access Journals (Sweden)

    Ruiye Su

    2015-01-01

    Full Text Available The main difference between locomotive schedule of heavy haul railways and that of regular rail transportation is the number of locomotives utilized for one train. One heavy-loaded train usually has more than one locomotive, but a regular train only has one. This paper develops an optimization model for the multilocomotive scheduling problem (MLSP through analyzing the current locomotive schedule of Da-qin Railway. The objective function of our paper is to minimize the total number of utilized locomotives. The MLSP is nondeterministic polynomial (NP hard. Therefore, we convert the multilocomotive traction problem into a single-locomotive traction problem. Then, the single-locomotive traction problem (SLTP can be converted into an assignment problem. The Hungarian algorithm is applied to solve the model and obtain the optimal locomotive schedule. We use the variance of detention time of locomotives at stations to evaluate the stability of locomotive schedule. In order to evaluate the effectiveness of the proposed optimization model, case studies for 20 kt and 30 kt heavy-loaded combined trains on Da-qin Railway are both conducted. Compared to the current schedules, the optimal schedules from the proposed models can save 62 and 47 locomotives for 20 kt and 30 kt heavy-loaded combined trains, respectively. Therefore, the effectiveness of the proposed model and its solution algorithm are both valid.

  10. Performance analysis of a large-grain dataflow scheduling paradigm

    Science.gov (United States)

    Young, Steven D.; Wills, Robert W.

    1993-01-01

    A paradigm for scheduling computations on a network of multiprocessors using large-grain data flow scheduling at run time is described and analyzed. The computations to be scheduled must follow a static flow graph, while the schedule itself will be dynamic (i.e., determined at run time). Many applications characterized by static flow exist, and they include real-time control and digital signal processing. With the advent of computer-aided software engineering (CASE) tools for capturing software designs in dataflow-like structures, macro-dataflow scheduling becomes increasingly attractive, if not necessary. For parallel implementations, using the macro-dataflow method allows the scheduling to be insulated from the application designer and enables the maximum utilization of available resources. Further, by allowing multitasking, processor utilizations can approach 100 percent while they maintain maximum speedup. Extensive simulation studies are performed on 4-, 8-, and 16-processor architectures that reflect the effects of communication delays, scheduling delays, algorithm class, and multitasking on performance and speedup gains.

  11. Residency Applicant Preferences of Online Systems for Scheduling Interviews.

    Science.gov (United States)

    Hern, H Gene; Wills, Charlotte P; Alter, Harrison J; Bowman, Steven H; Burns, Boyd D; Loyd, Joshua; Schneider, Jeffrey I; Yarris, Lalena M

    2016-12-01

    Residency applicants often have difficulty coordinating interviews with multiple programs. An online scheduling system might improve this process. The authors sought to determine applicant mean time to schedule interviews and satisfaction using online scheduling compared with manual scheduling. An electronic survey was sent to US graduates applying to any of 6 emergency medicine programs in the 2014-2015 application cycle. Of the participant programs, 3 used an online system and 3 did not. Applicants were asked to report estimated time to schedule with the online system compared to their average time using other methods, and to rate their satisfaction with the scheduling process. Of 1720 applicants to at least 1 of the 6 programs, 856 completed the survey (49.8%). Respondents reported spending less time scheduling interviews using the online system compared to other systems (median of 5 minutes [IQR 3-10] versus 60 minutes [IQR 15-240], respectively, P preferred using the online system (93.6% versus 1.4%, P travel arrangements (74.7% versus 41.5%, P travel arrangements. The results likely are generalizable to other medical and surgical specialties.

  12. The Influence of Scheduling Style on Assortment Size

    Directory of Open Access Journals (Sweden)

    Rai Dipankar

    2016-12-01

    Full Text Available People use two types of scheduling styles to schedule their daily activities, namely clock-time or event-time. When people use clock time, they organize tasks based on a clock. When they use event-time, they organize tasks based on their order of completion. This research shows that adopting different scheduling styles influence consumers’ assortment size preferences. We demonstrate, through two studies, that consumers using event-time scheduling style prefer a larger assortment size whereas consumers using clock-time scheduling style prefer a smaller assortment size. We also show that this effect is mediated by desirability-feasibility consideration. Specifically, event-time scheduling style leads consumers to focus on the desirability considerations, which leads them to prefer larger assortment size while shopping. On the other hand, clock-time scheduling style leads consumers to focus on the feasibility considerations, which leads them to prefer smaller assortment size while shopping. We also discuss the theoretical and managerial implications of our research.

  13. Developing algorithm for the critical care physician scheduling

    Science.gov (United States)

    Lee, Hyojun; Pah, Adam; Amaral, Luis; Northwestern Memorial Hospital Collaboration

    Understanding the social network has enabled us to quantitatively study social phenomena such as behaviors in adoption and propagation of information. However, most work has been focusing on networks of large heterogeneous communities, and little attention has been paid to how work-relevant information spreads within networks of small and homogeneous groups of highly trained individuals, such as physicians. Within the professionals, the behavior patterns and the transmission of information relevant to the job are dependent not only on the social network between the employees but also on the schedules and teams that work together. In order to systematically investigate the dependence of the spread of ideas and adoption of innovations on a work-environment network, we sought to construct a model for the interaction network of critical care physicians at Northwestern Memorial Hospital (NMH) based on their work schedules. We inferred patterns and hidden rules from past work schedules such as turnover rates. Using the characteristics of the work schedules of the physicians and their turnover rates, we were able to create multi-year synthetic work schedules for a generic intensive care unit. The algorithm for creating shift schedules can be applied to other schedule dependent networks ARO1.

  14. Optimization of radiotherapy fractionation schedules based on radiobiological functions.

    Science.gov (United States)

    Pizarro, Fernando; Hernández, Araceli

    2017-11-01

    To present a method for optimizing radiotherapy fractionation schedules using radiobiological tools and taking into account the patient´s dose-volume histograms (DVH). This method uses a figure of merit based on the uncomplicated tumour control probability (P(+)) and the generalized equivalent uniform dose (gEUD). A set of doses per fraction is selected in order to find the dose per fraction and the total dose, thus maximizing the figure of merit and leading to a biologically effective dose that is similar to the prescribed schedule. As a clinical example, a fractionation schedule for a prostate treatment plan is optimized and presented herein. From a prescription schedule of 70 Gy/35 × 2  Gy, the resulting optimal schema, using a figure of merit which only takes into account P(+), is 54.4 Gy/16 × 3.4  Gy. If the gEUD is included in that figure of merit, the result is 65 Gy/26 × 2.5  Gy. Alternative schedules, which include tumour control probability (TCP) and the normal tissue complication probability (NTCP) values are likewise shown. This allows us to compare different schedules instead of solely finding the optimal value, as other possible clinical factors must be taken into account to make the best decision for treatment. The treatment schedule can be optimized for each patient through radiobiological analysis. The optimization process shown below offers physicians alternative schedules that meet the objectives of the prescribed radiotherapy. Advances in knowledge: This article provides a simple, radiobiological-function-based method to take advantage of a patient's dose-volume histograms in order to better select the most suitable treatment schedule.

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

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

  17. Solving cyclical nurse scheduling problem using preemptive goal programming

    Science.gov (United States)

    Sundari, V. E.; Mardiyati, S.

    2017-07-01

    Nurse scheduling system in a hospital is being modeled as a preemptive goal programming problem that is solved by using LINGO software with the objective function to minimize deviation variable at each goal. The scheduling is done cyclically, so every nurse is treated fairly since they have the same work shift portion with the other nurses. By paying attention to the hospital's rules regarding nursing work shift cyclically, it can be obtained that numbers of nurse needed in every ward are 18 nurses and the numbers of scheduling periods are 18 periods where every period consists of 21 days.

  18. OPTIMIZATION OF GRID RESOURCE SCHEDULING USING PARTICLE SWARM OPTIMIZATION ALGORITHM

    Directory of Open Access Journals (Sweden)

    S. Selvakrishnan

    2010-10-01

    Full Text Available Job allocation process is one of the big issues in grid environment and it is one of the research areas in Grid Computing. Hence a new area of research is developed to design optimal methods. It focuses on new heuristic techniques that provide an optimal or near optimal solution for large grids. By learning grid resource scheduling and PSO (Particle Swarm Optimization algorithm, this proposed scheduler allocates an application to a host from a pool of available hosts and applications by selecting the best match. PSO-based algorithm is more effective in grid resources scheduling with the favor of reducing the executing time and completing time.

  19. Intra-node Memory Safe GPU Co-Scheduling

    OpenAIRE

    Reano, Carlos; Silla, Federico; Nikolopoulos, Dimitrios S.; Varghese, Blesson

    2017-01-01

    GPUs in High-Performance Computing systems remain under-utilised due to the unavailability of schedulers that can safely schedule multiple applications to share the same GPU. The research reported in this paper is motivated to improve the utilisation of GPUs by proposing a framework, we refer to as schedGPU, to facilitate intra-node GPU co-scheduling such that a GPU can be safely shared among multiple applications by taking memory constraints into account. Two approaches, namely a client-serv...

  20. Job Shop Scheduling Focusing on Role of Buffer

    Science.gov (United States)

    Hino, Rei; Kusumi, Tetsuya; Yoo, Jae-Kyu; Shimizu, Yoshiaki

    A scheduling problem is formulated in order to consistently manage each manufacturing resource, including machine tools, assembly robots, AGV, storehouses, material shelves, and so on. The manufacturing resources are classified into three types: producer, location, and mover. This paper focuses especially on the role of the buffer, and the differences among these types are analyzed. A unified scheduling formulation is derived from the analytical results based on the resource’s roles. Scheduling procedures based on dispatching rules are also proposed in order to numerically evaluate job shop-type production having finite buffer capacity. The influences of the capacity of bottle-necked production devices and the buffer on productivity are discussed.

  1. A DIFFERENTIAL EVOLUTION ALGORITHM DEVELOPED FOR A NURSE SCHEDULING PROBLEM

    Directory of Open Access Journals (Sweden)

    Shahnazari-Shahrezaei, P.

    2012-11-01

    Full Text Available Nurse scheduling is a type of manpower allocation problem that tries to satisfy hospital managers objectives and nurses preferences as much as possible by generating fair shift schedules. This paper presents a nurse scheduling problem based on a real case study, and proposes two meta-heuristics a differential evolution algorithm (DE and a greedy randomised adaptive search procedure (GRASP to solve it. To investigate the efficiency of the proposed algorithms, two problems are solved. Furthermore, some comparison metrics are applied to examine the reliability of the proposed algorithms. The computational results in this paper show that the proposed DE outperforms the GRASP.

  2. Multiuser Scheduling on the Downlink of an LTE Cellular System

    Directory of Open Access Journals (Sweden)

    Raymond Kwan

    2008-01-01

    Full Text Available The challenge of scheduling user transmissions on the downlink of a long-term evolution (LTE cellular communication system is addressed. In particular, a novel optimalmultiuser scheduler is proposed. Numerical results show that the system performance improves with increasing correlation among OFDMA subcarriers. It is found that only a limited amount of feedback information is needed to achieve relatively good performance. A suboptimal reduced-complexity scheduler is also proposed and shown to provide good performance. The suboptimal scheme is especially attractive when the number of users is large, in which case the complexity of the optimal scheme is high.

  3. The serial message-passing schedule for LDPC decoding algorithms

    Science.gov (United States)

    Liu, Mingshan; Liu, Shanshan; Zhou, Yuan; Jiang, Xue

    2015-12-01

    The conventional message-passing schedule for LDPC decoding algorithms is the so-called flooding schedule. It has the disadvantage that the updated messages cannot be used until next iteration, thus reducing the convergence speed . In this case, the Layered Decoding algorithm (LBP) based on serial message-passing schedule is proposed. In this paper the decoding principle of LBP algorithm is briefly introduced, and then proposed its two improved algorithms, the grouped serial decoding algorithm (Grouped LBP) and the semi-serial decoding algorithm .They can improve LBP algorithm's decoding speed while maintaining a good decoding performance.

  4. Quality-aware media scheduling on MPSoC platforms

    DEFF Research Database (Denmark)

    Gangadharan, Deepak; Chakraborty, Samarjit; Zimmermann, Roger

    2013-01-01

    with some prespecified quality constraint. Therefore, we propose a network calculus based formal framework to help schedule multiple media streams in the presence of buffer contraints. Further, our framework also presents a schedulability analysis condition to check if the multimedia streams can...... be scheduled such that a prespecified quality constraint is satisfied with the available service. We present this framework in the context of a PiP application, but it is applicable in general for multiple media streams. The results obtained using the formal framework were further verified using experiments...

  5. A Multiple Criteria Genetic Algorithm Scheduling Tool for Production Scheduling in the Capital Goods Industry

    Directory of Open Access Journals (Sweden)

    Wenbin Xie

    2014-01-01

    Full Text Available Production planners usually aim to satisfy multiple objectives. This paper describes the development of a genetic algorithm tool that finds optimum trade-offs among delivery performance, resource utilisation, and workin-progress inventory. The tool was specifically developed to meet the requirements of capital goods companies that manufacture products with deep and complex product structures with components that have long and complicated routings. The model takes into account operation and assembly precedence relationships and finite capacity constraints. The tool was tested using various production problems that were obtained from a collaborating company. A series of experiments showed the tool provides a set of non-dominated solutions that enable the planner to choose an optimum trade-off according to their preferences. Previous research had optimised a single objective function. This is the first scheduling tool of its type that has simultaneously optimised delivery performance, resource utilisation and work-in-progress inventory. The quality of the schedules produced was significantly better than the approaches used by the collaborating company.

  6. An Enabling Technology for New Planning and Scheduling Paradigms

    Science.gov (United States)

    Jaap, John; Davis, Elizabeth

    2004-01-01

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

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

    Science.gov (United States)

    Clark, F C; Smith, J B

    1977-11-01

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

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

    Science.gov (United States)

    2012-11-30

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

  9. Schedulability of Herschel revisited using statistical model checking

    DEFF Research Database (Denmark)

    David, Alexandre; Larsen, Kim Guldstrand; Legay, Axel

    2015-01-01

    and blocking times of tasks. Consequently, the method may falsely declare deadline violations that will never occur during execution. This paper is a continuation of previous work of the authors in applying extended timed automata model checking (using the tool UPPAAL) to obtain more exact schedulability...... analysis, here in the presence of non-deterministic computation times of tasks given by intervals [BCET,WCET]. Computation intervals with preemptive schedulers make the schedulability analysis of the resulting task model undecidable. Our contribution is to propose a combination of model checking techniques...... to obtain some guarantee on the (un)schedulability of the model even in the presence of undecidability. Two methods are considered: symbolic model checking and statistical model checking. Since the model uses stop-watches, the reachability problem becomes undecidable so we are using an over...

  10. [Toward a New Immunization Schedule in Spain, 2016 (Part 1)].

    Science.gov (United States)

    Limia-Sánchez, Aurora; Andreu, María Mar; Torres de Mier, María de Viarce; Navarro-Alonso, José Antonio

    2016-03-08

    The immunization Schedule is a dynamic public health tool that has incorporated different changes over the years influenced by the epidemiologic situation and the scientific evidence. The Immunization Advisory Committee [Ponencia de Programa y Registro de Vacunaciones], as the Interterritorial Council scientific and technical advisory body, carries out assessments of different programmes and vaccines and proposes changes that after approval will be introduced in the Regions schedule. This article is divided into two parts presenting the rationale followed to propose a new schedule for the immunization against diphtheria, tetanus, pertussis, hepatitis B and invasive disease by Haemophilus influenzae type b. This first part is focused in the reasoning to undertake the assessment, the review of the immunization policy and the impact of immunization in Spain, as well as a review of the immunization schedules in similar countries.

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

  12. Excel-based scheduling for reallocation of nursing staff.

    Science.gov (United States)

    2016-10-19

    Outi Annelli Tuominen and colleagues write in Nursing Management about the use of an Excel-based scheduling system for reallocation of nursing staff, which was trialled on ward managers and assistant ward managers.

  13. Harmonized Tariff Schedule of the United States (2015) - Revision 1

    Data.gov (United States)

    US International Trade Commission — This dataset is the 2015 Harmonized Tariff Schedule Revision 1 effective July 1, 2015. It provides the applicable tariff rates and statistical categories for all...

  14. Dose Schedule Optimization and the Pharmacokinetic Driver of Neutropenia

    Science.gov (United States)

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

    2014-01-01

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

  15. Integrated scheduled waste management system in Kuala Lumpur ...

    African Journals Online (AJOL)

    The overall development of this project was carried out in several phases which are problem identification, problem statement, literature review, identification of domain experts, prototype development, knowledge acquisition, knowledge representation and prototype development. Scheduled waste expert system is ...

  16. A greedy double swap heuristic for nurse scheduling

    Directory of Open Access Journals (Sweden)

    Murphy Choy

    2012-10-01

    Full Text Available One of the key challenges of nurse scheduling problem (NSP is the number of constraints placed on preparing the timetable, both from the regulatory requirements as well as the patients’ demand for the appropriate nursing care specialists. In addition, the preferences of the nursing staffs related to their work schedules add another dimension of complexity. Most solutions proposed for solving nurse scheduling involve the use of mathematical programming and generally considers only the hard constraints. However, the psychological needs of the nurses are ignored and this resulted in subsequent interventions by the nursing staffs to remedy any deficiency and often results in last minute changes to the schedule. In this paper, we present a staff preference optimization framework solved with a greedy double swap heuristic. The heuristic yields good performance in speed at solving the problem. The heuristic is simple and we will demonstrate its performance by implementing it on open source spreadsheet software.

  17. 76 FR 58510 - Notice of Meeting Schedule for 2012

    Science.gov (United States)

    2011-09-21

    .... --Property, Plant and Equipment. --Natural Resources. --Deferred Maintenance/Asset Impairment. --Technical... From the Federal Register Online via the Government Publishing Office FEDERAL ACCOUNTING STANDARDS ADVISORY BOARD Notice of Meeting Schedule for 2012 AGENCY: Federal Accounting Standards Advisory Board...

  18. 75 FR 20364 - Notice of Meeting Schedule for 2011

    Science.gov (United States)

    2010-04-19

    ... --Property, Plant and Equipment --Natural Resources --Deferred Maintenance/Asset Impairment --Technical... From the Federal Register Online via the Government Publishing Office FEDERAL ACCOUNTING STANDARDS ADVISORY BOARD Notice of Meeting Schedule for 2011 AGENCY: Federal Accounting Standards Advisory Board...

  19. Heuristic Method for Decision-Making in Common Scheduling Problems

    National Research Council Canada - National Science Library

    Edyta Kucharska

    2017-01-01

    The aim of the paper is to present a heuristic method for decision-making regarding an NP-hard scheduling problem with limitations related to tasks and the resources dependent on the current state of the process...

  20. Adaptive scheduling with postexamining user selection under nonidentical fading

    KAUST Repository

    Gaaloul, Fakhreddine

    2012-11-01

    This paper investigates an adaptive scheduling algorithm for multiuser environments with statistically independent but nonidentically distributed (i.n.d.) channel conditions. The algorithm aims to reduce feedback load by sequentially and arbitrarily examining the user channels. It also provides improved performance by realizing postexamining best user selection. The first part of the paper presents new formulations for the statistics of the signal-to-noise ratio (SNR) of the scheduled user under i.n.d. channel conditions. The second part capitalizes on the findings in the first part and presents various performance and processing complexity measures for adaptive discrete-time transmission. The results are then extended to investigate the effect of outdated channel estimates on the statistics of the scheduled user SNR, as well as some performance measures. Numerical results are provided to clarify the usefulness of the scheduling algorithm under perfect or outdated channel estimates. © 1967-2012 IEEE.