Constraint-based scheduling

NASA Technical Reports Server (NTRS)

Zweben, Monte

1991-01-01

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

Constraint-based scheduling

NASA Technical Reports Server (NTRS)

Zweben, Monte

1993-01-01

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

Space shuttle maintenance program planning document

NASA Technical Reports Server (NTRS)

Brown, D. V.

1972-01-01

A means for developing a space shuttle maintenance program which will be acceptable to the development centers, the operators (KSC and AF), and the manufacturer is presented. The general organization and decision processes for determining the essential scheduled maintenance requirements for the space shuttle orbiter are outlined. The development of initial scheduled maintenance programs is discussed. The remaining maintenance, that is non-scheduled or non-routine maintenance, is directed by the findings of the scheduled maintenance program and the normal operation of the shuttle. The remaining maintenance consists of maintenance actions to correct discrepancies noted during scheduled maintenance tasks, nonscheduled maintenance, normal operation, or condition monitoring.

Reliability-based optimization of maintenance scheduling of mechanical components under fatigue

PubMed Central

Beaurepaire, P.; Valdebenito, M.A.; Schuëller, G.I.; Jensen, H.A.

2012-01-01

This study presents the optimization of the maintenance scheduling of mechanical components under fatigue loading. The cracks of damaged structures may be detected during non-destructive inspection and subsequently repaired. Fatigue crack initiation and growth show inherent variability, and as well the outcome of inspection activities. The problem is addressed under the framework of reliability based optimization. The initiation and propagation of fatigue cracks are efficiently modeled using cohesive zone elements. The applicability of the method is demonstrated by a numerical example, which involves a plate with two holes subject to alternating stress. PMID:23564979

Maintaining consistency between planning hierarchies: Techniques and applications

NASA Technical Reports Server (NTRS)

Zoch, David R.

1987-01-01

In many planning and scheduling environments, it is desirable to be able to view and manipulate plans at different levels of abstraction, allowing the users the option of viewing and manipulating either a very detailed representation of the plan or a high-level more abstract version of the plan. Generating a detailed plan from a more abstract plan requires domain-specific planning/scheduling knowledge; the reverse process of generating a high-level plan from a detailed plan Reverse Plan Maintenance, or RPM) requires having the system remember the actions it took based on its domain-specific knowledge and its reasons for taking those actions. This reverse plan maintenance process is described as implemented in a specific planning and scheduling tool, The Mission Operations Planning Assistant (MOPA), as well as the applications of RPM to other planning and scheduling problems; emphasizing the knowledge that is needed to maintain the correspondence between the different hierarchical planning levels.

Power Grid Maintenance Scheduling Intelligence Arrangement Supporting System Based on Power Flow Forecasting

NASA Astrophysics Data System (ADS)

Xie, Chang; Wen, Jing; Liu, Wenying; Wang, Jiaming

With the development of intelligent dispatching, the intelligence level of network control center full-service urgent need to raise. As an important daily work of network control center, the application of maintenance scheduling intelligent arrangement to achieve high-quality and safety operation of power grid is very important. By analyzing the shortages of the traditional maintenance scheduling software, this paper designs a power grid maintenance scheduling intelligence arrangement supporting system based on power flow forecasting, which uses the advanced technologies in maintenance scheduling, such as artificial intelligence, online security checking, intelligent visualization techniques. It implements the online security checking of maintenance scheduling based on power flow forecasting and power flow adjusting based on visualization, in order to make the maintenance scheduling arrangement moreintelligent and visual.

Guidelines for software inspections

NASA Technical Reports Server (NTRS)

1983-01-01

Quality control inspections are software problem finding procedures which provide defect removal as well as improvements in software functionality, maintenance, quality, and development and testing methodology is discussed. The many side benefits include education, documentation, training, and scheduling.

Simulators for Maintenance Training: Some Issues, Problems and Areas for Future Research

DTIC Science & Technology

1978-07-01

trainer into a full-scale, three-dimensional simulation of one cabinet of the NIKE HIPAR system. Test points for troubleshooting were located on simulated...described was used to teach maintenance of the NIKE HIPAR system. It too was considered to be a general purpose trainer in that its basic features could be...types of maintenance simulators based on a detailed task analysis of the NIKE HIPAR system as it existed one year before it was scheduled to become

Time and truth in plans

NASA Technical Reports Server (NTRS)

Hazelton, Lyman R., Jr.

1990-01-01

Some of the logical components of a rule based planning and scheduling system are described. The researcher points out a deficiency in the conventional truth maintenance approach to this class of problems and suggests a new mechanism which overcomes the problem. This extension of the idea of justification truth maintenance may seem at first to be a small philosophical step. However, it embodies a process of basic human reasoning which is so common and automatic as to escape conscious detection without careful introspection. It is vital to any successful implementation of a rule based planning reasoner.

Optimization Models for Scheduling of Jobs

PubMed Central

Indika, S. H. Sathish; Shier, Douglas R.

2006-01-01

This work is motivated by a particular scheduling problem that is faced by logistics centers that perform aircraft maintenance and modification. Here we concentrate on a single facility (hangar) which is equipped with several work stations (bays). Specifically, a number of jobs have already been scheduled for processing at the facility; the starting times, durations, and work station assignments for these jobs are assumed to be known. We are interested in how best to schedule a number of new jobs that the facility will be processing in the near future. We first develop a mixed integer quadratic programming model (MIQP) for this problem. Since the exact solution of this MIQP formulation is time consuming, we develop a heuristic procedure, based on existing bin packing techniques. This heuristic is further enhanced by application of certain local optimality conditions. PMID:27274921

The Use of Megestrol Acetate in Some Feline Dermatological Problems

PubMed Central

Gosselin, Y.; Chalifoux, A.; Papageorges, M.

1981-01-01

Twenty-one cats were treated with megestrol acetate because they were showing clinical signs associated with one of the following problems: eosinophilic ulcer, eosinophilic plaque, neurodermatitis, endocrine alopecia and miliary dermatitis. The dosage schedule was 5 mg orally per day per cat for seven days, then 5 mg every three days for 21 days. In all cats, we noted a good improvement of the lesions as soon as treatment was started. In 25% of the patients, one treatment schedule was sufficient to control the skin disease for at least 18 months. In the remaining 75%, two treatment schedules and/or a maintenance dosage had to be established. Side effects encountered were increased appetite, personality changes and depression. PMID:7337916

Multi-objective decision-making model based on CBM for an aircraft fleet

NASA Astrophysics Data System (ADS)

Luo, Bin; Lin, Lin

2018-04-01

Modern production management patterns, in which multi-unit (e.g., a fleet of aircrafts) are managed in a holistic manner, have brought new challenges for multi-unit maintenance decision making. To schedule a good maintenance plan, not only does the individual machine maintenance have to be considered, but also the maintenance of the other individuals have to be taken into account. Since most condition-based maintenance researches for aircraft focused on solely reducing maintenance cost or maximizing the availability of single aircraft, as well as considering that seldom researches concentrated on both the two objectives: minimizing cost and maximizing the availability of a fleet (total number of available aircraft in fleet), a multi-objective decision-making model based on condition-based maintenance concentrated both on the above two objectives is established. Furthermore, in consideration of the decision maker may prefer providing the final optimal result in the form of discrete intervals instead of a set of points (non-dominated solutions) in real decision-making problem, a novel multi-objective optimization method based on support vector regression is proposed to solve the above multi-objective decision-making model. Finally, a case study regarding a fleet is conducted, with the results proving that the approach efficiently generates outcomes that meet the schedule requirements.

User interface issues in supporting human-computer integrated scheduling

NASA Technical Reports Server (NTRS)

Cooper, Lynne P.; Biefeld, Eric W.

1991-01-01

Explored here is the user interface problems encountered with the Operations Missions Planner (OMP) project at the Jet Propulsion Laboratory (JPL). OMP uses a unique iterative approach to planning that places additional requirements on the user interface, particularly to support system development and maintenance. These requirements are necessary to support the concepts of heuristically controlled search, in-progress assessment, and iterative refinement of the schedule. The techniques used to address the OMP interface needs are given.

Perspectives on U.S. Competitiveness in Science and Technology

DTIC Science & Technology

2007-01-01

nation is unlikely to receive some sudden “ wakeup ” call; rather, the problem is one that is likely to evidence itself gradually over a surprisingly...health care than on steel.3 US scheduled airlines currently outsource portions of their aircraft maintenance to China and El Salvador.4 IBM recently sold... schedules based on “duties classification.” This approach reflected the “scientific” management period by formalizing the “rank in position” principle of

Perspectives on U.S. Competitiveness in Science and Technology: Conference Proceedings

DTIC Science & Technology

2006-11-01

that the nation is unlikely to receive some sudden “ wakeup ” call; rather, the problem is one that is likely to evidence itself gradually over a...on health care than on steel.3 US scheduled airlines currently outsource portions of their aircraft maintenance to China and El Salvador.4 IBM... schedules based on “duties classification.” This approach reflected the “scientific” management period by formalizing the “rank in position

Data Base Development of Automobile and Light Truck Maintenance : Volume II. Appendix E.

DOT National Transportation Integrated Search

1978-08-01

The document contains the scheduled maintenance data sheets and total cost summaries--both scheduled and unscheduled maintenance (Life cycle cost for Dealers, life cycle cost for Service Stations, life cycle cost for Independent Repair, and scheduled...

Data Base Development of Automobile and Light Truck Maintenance : Volume III. Appendix F.

DOT National Transportation Integrated Search

1978-08-01

The document contains the scheduled maintenance data sheets and total cost summaries--both scheduled and unscheduled maintenance (Life cycle cost for Dealers, life cycle cost for Service Stations, life cycle cost for Independent Repair, and scheduled...

Probabilistic modeling of condition-based maintenance strategies and quantification of its benefits for airliners

NASA Astrophysics Data System (ADS)

Pattabhiraman, Sriram

Airplane fuselage structures are designed with the concept of damage tolerance, wherein small damage are allowed to remain on the airplane, and damage that otherwise affect the safety of the structure are repaired. The damage critical to the safety of the fuselage are repaired by scheduling maintenance at pre-determined intervals. Scheduling maintenance is an interesting trade-off between damage tolerance and cost. Tolerance of larger damage would require less frequent maintenance and hence, a lower cost, to maintain a certain level of reliability. Alternatively, condition-based maintenance techniques have been developed using on-board sensors, which track damage continuously and request maintenance only when the damage size crosses a particular threshold. This effects a tolerance of larger damage than scheduled maintenance, leading to savings in cost. This work quantifies the savings of condition-based maintenance over scheduled maintenance. The work also quantifies converting the cost savings into weight savings. Structural health monitoring will need time to be able to establish itself as a stand-alone system for maintenance, due to concerns on its diagnosis accuracy and reliability. This work also investigates the effect of synchronizing structural health monitoring system with scheduled maintenance. This work uses on-board SHM equipment skip structural airframe maintenance (a subsect of scheduled maintenance), whenever deemed unnecessary while maintain a desired level of safety of structure. The work will also predict the necessary maintenance for a fleet of airplanes, based on the current damage status of the airplanes. The work also analyses the possibility of false alarm, wherein maintenance is being requested with no critical damage on the airplane. The work use SHM as a tool to identify lemons in a fleet of airplanes. Lemons are those airplanes that would warrant more maintenance trips than the average behavior of the fleet.

Seeing Red Over Those Black Marks on Your Floors?

ERIC Educational Resources Information Center

Rittner-Heir, Robbin

1999-01-01

Describes one custodian's cost-effective approach for resolving black scuff marks on flooring and staving off their return. An eight-step cleaning program is detailed. Cautions that the largest obstacle to proper handling of floor problems lies in the lack of a proper maintenance schedule. (GR)

9 CFR 201.86 - Brand inspection: Application for authorization, registration and filing of schedules, reciprocal...

Code of Federal Regulations, 2011 CFR

2011-01-01

... authorization, registration and filing of schedules, reciprocal arrangements, and maintenance of identity of... and filing of schedules, reciprocal arrangements, and maintenance of identity of consignments. (a... and will not result in duplication of charges or services. (d) Maintenance of identity of consignments...

9 CFR 201.86 - Brand inspection: Application for authorization, registration and filing of schedules, reciprocal...

Code of Federal Regulations, 2013 CFR

2013-01-01

... authorization, registration and filing of schedules, reciprocal arrangements, and maintenance of identity of... and filing of schedules, reciprocal arrangements, and maintenance of identity of consignments. (a... and will not result in duplication of charges or services. (d) Maintenance of identity of consignments...

9 CFR 201.86 - Brand inspection: Application for authorization, registration and filing of schedules, reciprocal...

Code of Federal Regulations, 2012 CFR

2012-01-01

... authorization, registration and filing of schedules, reciprocal arrangements, and maintenance of identity of... and filing of schedules, reciprocal arrangements, and maintenance of identity of consignments. (a... and will not result in duplication of charges or services. (d) Maintenance of identity of consignments...

76 FR 67633 - Airworthiness Directives; Dassault Aviation Model Mystere-Falcon 50 Airplanes

Federal Register 2010, 2011, 2012, 2013, 2014

2011-11-02

...) of section 5-10 of the Recommended Maintenance Schedules chapter of the Aircraft Maintenance...) of section 5-10 of the Recommended Maintenance Schedules chapter of the Aircraft Maintenance... Dassault Falcon 50/ 50EX Maintenance Procedure 57-607, Non-Destructive Check of Flap Tracks 2 and 5, of...

Prognostics Methodology for Complex Systems

NASA Technical Reports Server (NTRS)

Gulati, Sandeep; Mackey, Ryan

2003-01-01

An automatic method to schedule maintenance and repair of complex systems is produced based on a computational structure called the Informed Maintenance Grid (IMG). This method provides solutions to the two fundamental problems in autonomic logistics: (1) unambiguous detection of deterioration or impending loss of function and (2) determination of the time remaining to perform maintenance or other corrective action based upon information from the system. The IMG provides a health determination over the medium-to-longterm operation of the system, from one or more days to years of study. The IMG is especially applicable to spacecraft and both piloted and autonomous aircraft, or industrial control processes.

Conception of Self-Construction Production Scheduling System

NASA Astrophysics Data System (ADS)

Xue, Hai; Zhang, Xuerui; Shimizu, Yasuhiro; Fujimura, Shigeru

With the high speed innovation of information technology, many production scheduling systems have been developed. However, a lot of customization according to individual production environment is required, and then a large investment for development and maintenance is indispensable. Therefore now the direction to construct scheduling systems should be changed. The final objective of this research aims at developing a system which is built by it extracting the scheduling technique automatically through the daily production scheduling work, so that an investment will be reduced. This extraction mechanism should be applied for various production processes for the interoperability. Using the master information extracted by the system, production scheduling operators can be supported to accelerate the production scheduling work easily and accurately without any restriction of scheduling operations. By installing this extraction mechanism, it is easy to introduce scheduling system without a lot of expense for customization. In this paper, at first a model for expressing a scheduling problem is proposed. Then the guideline to extract the scheduling information and use the extracted information is shown and some applied functions are also proposed based on it.

Laboratory services series: a programmed maintenance system

DOE Office of Scientific and Technical Information (OSTI.GOV)

Tuxbury, D.C.; Srite, B.E.

1980-01-01

The diverse facilities, operations and equipment at a major national research and development laboratory require a systematic, analytical approach to operating equipment maintenance. A computer-scheduled preventive maintenance program is described including program development, equipment identification, maintenance and inspection instructions, scheduling, personnel, and equipment history.

A particle swarm model for estimating reliability and scheduling system maintenance

NASA Astrophysics Data System (ADS)

Puzis, Rami; Shirtz, Dov; Elovici, Yuval

2016-05-01

Modifying data and information system components may introduce new errors and deteriorate the reliability of the system. Reliability can be efficiently regained with reliability centred maintenance, which requires reliability estimation for maintenance scheduling. A variant of the particle swarm model is used to estimate reliability of systems implemented according to the model view controller paradigm. Simulations based on data collected from an online system of a large financial institute are used to compare three component-level maintenance policies. Results show that appropriately scheduled component-level maintenance greatly reduces the cost of upholding an acceptable level of reliability by reducing the need in system-wide maintenance.

Prototype solar heated hot water systems and double-walled heat exchangers: A collection of quarterly reports

NASA Technical Reports Server (NTRS)

1978-01-01

The plan schedule and status of multiple objectives to be achieved in the development, manufacture, installation, and maintenance of two solar heated hot water prototype systems and two heat exchangers are reported. A computer program developed to resolve problems and evaluate system performance is described.

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

NASA Astrophysics Data System (ADS)

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

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

Navy Occupational Health Information Management System (NOHIMS). Medical Exam Scheduling Module. Program Maintenance Manual

DTIC Science & Technology

1987-06-01

NAVY OCCUPATIONAL HEALTH INFORMATION MANAGEMENT SYSTEM NOH I MS MEDICAL EXAM SCHEDULING MODULE PROGRAM MAINTENANCE MANUAL S JUNE 1987 DT11C 00... Information Management System (NOHIMS) ~ Medical Examination Scheduling (MES) Program Maintenance Manual 7. Author(s) 8. Performing Organization Rapt. No...the Navy Occupational Health Information Management System (NOHIMS). NOHIMS, whose initial version was developed at the Naval Health Research Center

Solving nuts-and-bolts nuclear problems

DOE Office of Scientific and Technical Information (OSTI.GOV)

Olmstead, A.; Schoen, J.

1979-05-01

The Operations and Maintenance Information Service (MIS), created and operated by NUS Corp., was designed to improve plant availability through the exchange of practical information between nuclear plants and a return to an emphasis on the problem-solving process. MIS meetings cover a range of plant problems and have been unique in bringing the rapid feedback of information pertinent to the day-to-day working operation of a total plant. Much of the response is by telephone contact, although the monthly newsletter, semi-annual meetings, and scheduled plant visits are also helpful.

A System for Planning Ahead

NASA Technical Reports Server (NTRS)

2002-01-01

A software system that uses artificial intelligence techniques to help with complex Space Shuttle scheduling at Kennedy Space Center is commercially available. Stottler Henke Associates, Inc.(SHAI), is marketing its automatic scheduling system, the Automated Manifest Planner (AMP), to industries that must plan and project changes many different times before the tasks are executed. The system creates optimal schedules while reducing manpower costs. Using information entered into the system by expert planners, the system automatically makes scheduling decisions based upon resource limitations and other constraints. It provides a constraint authoring system for adding other constraints to the scheduling process as needed. AMP is adaptable to assist with a variety of complex scheduling problems in manufacturing, transportation, business, architecture, and construction. AMP can benefit vehicle assembly plants, batch processing plants, semiconductor manufacturing, printing and textiles, surface and underground mining operations, and maintenance shops. For most of SHAI's commercial sales, the company obtains a service contract to customize AMP to a specific domain and then issues the customer a user license.

Monitoring Strategies in Permeable Pavement Systems to Optimize Maintenance Scheduling

EPA Science Inventory

As the surface in a permeable pavement system clogs and performance decreases, maintenance is required to preserve the design function. Currently, guidance is limited for scheduling maintenance on an as needed basis. Previous research has shown that surface clogging in a permea...

Monitoring Strategies in Permeable Pavement Systems to Optimize Maintenance Scheduling - abstract

EPA Science Inventory

As the surface in a permeable pavement system clogs and performance decreases, maintenance is required to preserve the design function. Currently, guidance is limited for scheduling maintenance on an as needed basis. Previous research has shown that surface clogging in a permea...

Psychological health maintenance on Space Station Freedom

NASA Technical Reports Server (NTRS)

Santy, Patricia A.

1990-01-01

The scheduling of crew rotations at intervals of as much as 180 days on NASA's Space Station Freedom entails that the cumulative effects of psychological, emotional, and social stressors on astronauts be monitored. The Space Station's Health Maintenance Facility (HMF) will furnish preventive, diagnostic, and therapeutic assistance for significant psychiatric and interpersonal problems. Mental health professionals must be part of the team of medical personnel charged with facilitating the physiological and phychological transition from earth to space and back. An account is presently given of the critical factors to be addressed by HMF personnel on extended-duration missions.

40 CFR 86.428-80 - Maintenance, scheduled; test vehicles.

Code of Federal Regulations, 2013 CFR

2013-07-01

... 40 Protection of Environment 19 2013-07-01 2013-07-01 false Maintenance, scheduled; test vehicles... PROGRAMS (CONTINUED) CONTROL OF EMISSIONS FROM NEW AND IN-USE HIGHWAY VEHICLES AND ENGINES Emission... vehicles. (a) Periodic maintenance on the engine, emission control system, and fuel system of test vehicles...

Reactor operations informal monthly report, May 1, 1995--May 31, 1995

DOE Office of Scientific and Technical Information (OSTI.GOV)

Hauptman, H.M.; Petro, J.N.; Jacobi, O.

1995-05-01

This document is an informal progress report for the operational performance of the Brookhaven Medical Research Reactor, and the Brookhaven High Flux Beam Reactor, for the month of May, 1995. Both machines ran well during this period, with no reportable instrumentation problems, all scheduled maintenance performed, and only one reportable occurance, involving a particle on Vest Button, Personnel Radioactive Contamination.

49 CFR 214.533 - Schedule of repairs subject to availability of parts.

Code of Federal Regulations, 2011 CFR

2011-10-01

... Maintenance Machines and Hi-Rail Vehicles § 214.533 Schedule of repairs subject to availability of parts. (a... 49 Transportation 4 2011-10-01 2011-10-01 false Schedule of repairs subject to availability of... maintenance machine or a hi-rail vehicle by the end of the next business day following the report of the...

49 CFR 214.533 - Schedule of repairs subject to availability of parts.

Code of Federal Regulations, 2010 CFR

2010-10-01

... Maintenance Machines and Hi-Rail Vehicles § 214.533 Schedule of repairs subject to availability of parts. (a... maintenance machine or a hi-rail vehicle by the end of the next business day following the report of the... maintenance machine or hi-rail vehicle within seven calendar days after receiving the necessary part. The...

Smart aircraft fastener evaluation (SAFE) system: a condition-based corrosion detection system for aging aircraft

NASA Astrophysics Data System (ADS)

Schoess, Jeffrey N.; Seifert, Greg; Paul, Clare A.

1996-05-01

The smart aircraft fastener evaluation (SAFE) system is an advanced structural health monitoring effort to detect and characterize corrosion in hidden and inaccessible locations of aircraft structures. Hidden corrosion is the number one logistics problem for the U.S. Air Force, with an estimated maintenance cost of $700M per year in 1990 dollars. The SAFE system incorporates a solid-state electrochemical microsensor and smart sensor electronics in the body of a Hi-Lok aircraft fastener to process and autonomously report corrosion status to aircraft maintenance personnel. The long-term payoff for using SAFE technology will be in predictive maintenance for aging aircraft and rotorcraft systems, fugitive emissions applications such as control valves, chemical pipeline vessels, and industrial boilers. Predictive maintenance capability, service, and repair will replace the current practice of scheduled maintenance to substantially reduce operational costs. A summary of the SAFE concept, laboratory test results, and future field test plans is presented.

Cryogenics maintenance strategy

NASA Astrophysics Data System (ADS)

Cruzat, Fabiola

2012-09-01

ALMA is an interferometer composed of 66 independent systems, with specific maintenance requirements for each subsystem. To optimize the observation time and reduce downtime maintenance, requirements are very demanding. One subsystem with high maintenance efforts is cryogenics and vacuum. To organize the maintenance, the Cryogenic and Vacuum department is using and implementing different tools. These are monitoring and problem reporting systems and CMMS. This leads to different maintenance approaches: Preventive Maintenance, Corrective Maintenance and Condition Based Maintenance. In order to coordinate activities with other departments the preventive maintenance schedule is kept as flexible as systems allow. To cope with unavoidable failures, the team has to be prepared to work under any condition with the spares on time. Computerized maintenance management system (CMMS) will help to manage inventory control for reliable spare part handling, the correct record of work orders and traceability of maintenance activities. For an optimized approach the department is currently evaluating where preventive or condition based maintenance applies to comply with the individual system demand. Considering the change from maintenance contracts to in-house maintenance will help to minimize costs and increase availability of parts. Due to increased number of system and tasks the cryo team needs to grow. Training of all staff members is mandatory, in depth knowledge must be built up by doing complex maintenance activities in the Cryo group, use of advanced computerized metrology systems.

The ATA-67 Formula for Direct Operating Cost

NASA Technical Reports Server (NTRS)

Faulkner, H. B.

1972-01-01

The ATA formulas for direct operating cost were developed for the purpose of comparing different aircraft, existing or not, on the same route or the same aircraft on different routes. Such characteristics of the airline as crew pay, maintenance procedures, and depreciation schedules are kept constant. In air transportation systems analysis the 1967 ATA formula is usually used with appropriate exceptions or modifications, such as: different maintenance labor rate, total maintenance multiplied by a factor, maintenance burden deleted, different depreciation schedule, or different spares percentages.

Software selection based on analysis and forecasting methods, practised in 1C

NASA Astrophysics Data System (ADS)

Vazhdaev, A. N.; Chernysheva, T. Y.; Lisacheva, E. I.

2015-09-01

The research focuses on the problem of a “1C: Enterprise 8” platform inboard mechanisms for data analysis and forecasting. It is important to evaluate and select proper software to develop effective strategies for customer relationship management in terms of sales, as well as implementation and further maintenance of software. Research data allows creating new forecast models to schedule further software distribution.

Problems with aging wiring in Naval aircraft

NASA Technical Reports Server (NTRS)

Campbell, Frank J.

1994-01-01

The Navy is experiencing a severe aircraft electrical wiring maintenance problem as a result of the extensive use of an aromatic polyimide insulation that is deteriorating at a rate that was unexpected when this wire was initially selected. This problem has significantly affected readiness, reliability, and safety and has greatly increased the cost of ownership of Naval aircraft. Failures in wire harnesses have exhibited arcing and burning that will propagate drastically, to the interruption of many electrical circuits from a fault initiated by the failure of deteriorating wires. There is an urgent need for a capability to schedule aircraft rewiring in an orderly manner with a logically derived determination of which aircraft have aged to the point of absolute necessity. Excessive maintenance was demonstrated to result from the accelerated aging due to the parameters of moisture, temperature, and strain that exist in the Naval Aircraft environment. Laboratory studies have demonstrated that MIL-W-81381 wire insulation when aged at high humidities followed the classical Arrhenius thermal aging relationship. In an extension of the project a multifactor formula was developed that is now capable of predicting life under varying conditions of these service parameters. An automated test system has also been developed to analyze the degree of deterioration that has occurred in wires taken from an aircraft in order to obtain an assessment of remaining life. Since it is both physically and financially impossible to replace the wiring in all the Navy's aircraft at once, this system will permit expedient scheduling so that those aircraft that are most probable to have wiring failure problems can be overhauled first.

Value of information of repair times for offshore wind farm maintenance planning

NASA Astrophysics Data System (ADS)

Seyr, Helene; Muskulus, Michael

2016-09-01

A large contribution to the total cost of energy in offshore wind farms is due to maintenance costs. In recent years research has focused therefore on lowering the maintenance costs using different approaches. Decision support models for scheduling the maintenance exist already, dealing with different factors influencing the scheduling. Our contribution deals with the uncertainty in the repair times. Given the mean repair times for different turbine components we make some assumptions regarding the underlying repair time distribution. We compare the results of a decision support model for the mean times to repair and those repair time distributions. Additionally, distributions with the same mean but different variances are compared under the same conditions. The value of lowering the uncertainty in the repair time is calculated and we find that using distributions significantly decreases the availability, when scheduling maintenance for multiple turbines in a wind park. Having detailed information about the repair time distribution may influence the results of maintenance modeling and might help identify cost factors.

Machine Maintenance Scheduling with Reliability Engineering Method and Maintenance Value Stream Mapping

NASA Astrophysics Data System (ADS)

Sembiring, N.; Nasution, A. H.

2018-02-01

Corrective maintenance i.e replacing or repairing the machine component after machine break down always done in a manufacturing company. It causes the production process must be stopped. Production time will decrease due to the maintenance team must replace or repair the damage machine component. This paper proposes a preventive maintenance’s schedule for a critical component of a critical machine of an crude palm oil and kernel company due to increase maintenance efficiency. The Reliability Engineering & Maintenance Value Stream Mapping is used as a method and a tool to analize the reliability of the component and reduce the wastage in any process by segregating value added and non value added activities.

An overview of the artificial intelligence and expert systems component of RICIS

NASA Technical Reports Server (NTRS)

Feagin, Terry

1987-01-01

Artificial Intelligence and Expert Systems are the important component of RICIS (Research Institute and Information Systems) research program. For space applications, a number of problem areas that should be able to make good use of the above tools include: resource allocation and management, control and monitoring, environmental control and life support, power distribution, communications scheduling, orbit and attitude maintenance, redundancy management, intelligent man-machine interfaces and fault detection, isolation and recovery.

Electronic Design Automation (EDA) Roadmap Taskforce Report, Design of Microprocessors

DTIC Science & Technology

1999-04-01

through on time. Hence, the study is not a crystal-ball- gazing exercise, but a rigorous, schedulable plan of action to attain the goal. NTRS97...formats so as not to impose too heavy a maintenance burden on their users Object Interfaces eliminate these problems: • A tool that binds the interface ...and User Interface - Design Tool Communication - EDA System Extension Language - EDA Standards- Based Software Development Environment - Design and

78 FR 48608 - Drawbridge Operation Regulation; Atlantic Intracoastal Waterway (AIWW), Chesapeake, VA

Federal Register 2010, 2011, 2012, 2013, 2014

2013-08-09

... maintenance of the moveable spans on the structure. The current operating schedule for the bridge is set out... deviation from the operating schedule that governs the operation of the I64 Bridge across the Atlantic... necessary to facilitate maintenance work on the moveable spans. This temporary deviation allows the...

Qudas Power Plant Turbine Restoration Project and Qudas Power Plant Expansion Project Baghdad, Iraq. Project and Sustainment Assessment

DTIC Science & Technology

2007-10-19

HGPI); Combustion Inspections (CI); and inspection and scheduled critical maintenance on all auxillary systems of the four GE Frame 9E units located...Work requirements for a functional end product. 6 services and scheduled critical maintenance on all auxillary systems of the four GE Frame

A Hybrid Memetic Framework for Coverage Optimization in Wireless Sensor Networks.

PubMed

Chen, Chia-Pang; Mukhopadhyay, Subhas Chandra; Chuang, Cheng-Long; Lin, Tzu-Shiang; Liao, Min-Sheng; Wang, Yung-Chung; Jiang, Joe-Air

2015-10-01

One of the critical concerns in wireless sensor networks (WSNs) is the continuous maintenance of sensing coverage. Many particular applications, such as battlefield intrusion detection and object tracking, require a full-coverage at any time, which is typically resolved by adding redundant sensor nodes. With abundant energy, previous studies suggested that the network lifetime can be maximized while maintaining full coverage through organizing sensor nodes into a maximum number of disjoint sets and alternately turning them on. Since the power of sensor nodes is unevenly consumed over time, and early failure of sensor nodes leads to coverage loss, WSNs require dynamic coverage maintenance. Thus, the task of permanently sustaining full coverage is particularly formulated as a hybrid of disjoint set covers and dynamic-coverage-maintenance problems, and both have been proven to be nondeterministic polynomial-complete. In this paper, a hybrid memetic framework for coverage optimization (Hy-MFCO) is presented to cope with the hybrid problem using two major components: 1) a memetic algorithm (MA)-based scheduling strategy and 2) a heuristic recursive algorithm (HRA). First, the MA-based scheduling strategy adopts a dynamic chromosome structure to create disjoint sets, and then the HRA is utilized to compensate the loss of coverage by awaking some of the hibernated nodes in local regions when a disjoint set fails to maintain full coverage. The results obtained from real-world experiments using a WSN test-bed and computer simulations indicate that the proposed Hy-MFCO is able to maximize sensing coverage while achieving energy efficiency at the same time. Moreover, the results also show that the Hy-MFCO significantly outperforms the existing methods with respect to coverage preservation and energy efficiency.

Reliability analysis of component of affination centrifugal 1 machine by using reliability engineering

NASA Astrophysics Data System (ADS)

Sembiring, N.; Ginting, E.; Darnello, T.

2017-12-01

Problems that appear in a company that produces refined sugar, the production floor has not reached the level of critical machine availability because it often suffered damage (breakdown). This results in a sudden loss of production time and production opportunities. This problem can be solved by Reliability Engineering method where the statistical approach to historical damage data is performed to see the pattern of the distribution. The method can provide a value of reliability, rate of damage, and availability level, of an machine during the maintenance time interval schedule. The result of distribution test to time inter-damage data (MTTF) flexible hose component is lognormal distribution while component of teflon cone lifthing is weibull distribution. While from distribution test to mean time of improvement (MTTR) flexible hose component is exponential distribution while component of teflon cone lifthing is weibull distribution. The actual results of the flexible hose component on the replacement schedule per 720 hours obtained reliability of 0.2451 and availability 0.9960. While on the critical components of teflon cone lifthing actual on the replacement schedule per 1944 hours obtained reliability of 0.4083 and availability 0.9927.

77 FR 12175 - Airworthiness Directives; DASSAULT AVIATION Airplanes

Federal Register 2010, 2011, 2012, 2013, 2014

2012-02-29

... specified products. The MCAI states: The Maintenance Procedure (MP) 57-607, related to non destructive check... Recommended Maintenance Schedules chapter of the Aircraft Maintenance Documentation. After the implementation... maintenance program to include ``Non-Destructive Check of Flap Tracks 2 and 5,'' Maintenance Procedure 57-607...

Teaching children with autism to use photographic activity schedules: maintenance and generalization of complex response chains.

PubMed Central

MacDuff, G S; Krantz, P J; McClannahan, L E

1993-01-01

We used a graduated guidance procedure to teach 4 boys with autism to follow photographic activity schedules to increase on-task and on-schedule behavior. The multiple baseline across participants design included baseline, teaching, maintenance, resequencing of photographs, and generalization to novel photographs phases. The results indicated that photographic activity schedules (albums depicting after-school activities) produced sustained engagement, and skills generalized to a new sequence of photographs and to new photographs. The acquisition of schedule-following skills enabled these children with severe developmental disabilities to display lengthy response chains, independently change activities, and change activities in different group home settings in the absence of immediate supervision and prompts from others. PMID:8473261

Commercial Aircraft Maintenance Experience Relating to Engine External Hardware

NASA Technical Reports Server (NTRS)

Soditus, Sharon M.

2006-01-01

Airlines are extremely sensitive to the amount of dollars spent on maintaining the external engine hardware in the field. Analysis reveals that many problems revolve around a central issue, reliability. Fuel and oil leakage due to seal failure and electrical fault messages due to wire harness failures play a major role in aircraft delays and cancellations (D&C's) and scheduled maintenance. Correcting these items on the line requires a large investment of engineering resources and manpower after the fact. The smartest and most cost effective philosophy is to build the best hardware the first time. The only way to do that is to completely understand and model the operating environment, study the field experience of similar designs and to perform extensive testing.

A framework for using ant colony optimization to schedule environmental flow management alternatives for rivers, wetlands, and floodplains

NASA Astrophysics Data System (ADS)

Szemis, J. M.; Maier, H. R.; Dandy, G. C.

2012-08-01

Rivers, wetlands, and floodplains are in need of management as they have been altered from natural conditions and are at risk of vanishing because of river development. One method to mitigate these impacts involves the scheduling of environmental flow management alternatives (EFMA); however, this is a complex task as there are generally a large number of ecological assets (e.g., wetlands) that need to be considered, each with species with competing flow requirements. Hence, this problem evolves into an optimization problem to maximize an ecological benefit within constraints imposed by human needs and the physical layout of the system. This paper presents a novel optimization framework which uses ant colony optimization to enable optimal scheduling of EFMAs, given constraints on the environmental water that is available. This optimization algorithm is selected because, unlike other currently popular algorithms, it is able to account for all aspects of the problem. The approach is validated by comparing it to a heuristic approach, and its utility is demonstrated using a case study based on the Murray River in South Australia to investigate (1) the trade-off between plant recruitment (i.e., promoting germination) and maintenance (i.e., maintaining habitat) flow requirements, (2) the trade-off between flora and fauna flow requirements, and (3) a hydrograph inversion case. The results demonstrate the usefulness and flexibility of the proposed framework as it is able to determine EFMA schedules that provide optimal or near-optimal trade-offs between the competing needs of species under a range of operating conditions and valuable insight for managers.

Multi-objective group scheduling optimization integrated with preventive maintenance

NASA Astrophysics Data System (ADS)

Liao, Wenzhu; Zhang, Xiufang; Jiang, Min

2017-11-01

This article proposes a single-machine-based integration model to meet the requirements of production scheduling and preventive maintenance in group production. To describe the production for identical/similar and different jobs, this integrated model considers the learning and forgetting effects. Based on machine degradation, the deterioration effect is also considered. Moreover, perfect maintenance and minimal repair are adopted in this integrated model. The multi-objective of minimizing total completion time and maintenance cost is taken to meet the dual requirements of delivery date and cost. Finally, a genetic algorithm is developed to solve this optimization model, and the computation results demonstrate that this integrated model is effective and reliable.

Estimation of probability of failure for damage-tolerant aerospace structures

NASA Astrophysics Data System (ADS)

Halbert, Keith

The majority of aircraft structures are designed to be damage-tolerant such that safe operation can continue in the presence of minor damage. It is necessary to schedule inspections so that minor damage can be found and repaired. It is generally not possible to perform structural inspections prior to every flight. The scheduling is traditionally accomplished through a deterministic set of methods referred to as Damage Tolerance Analysis (DTA). DTA has proven to produce safe aircraft but does not provide estimates of the probability of failure of future flights or the probability of repair of future inspections. Without these estimates maintenance costs cannot be accurately predicted. Also, estimation of failure probabilities is now a regulatory requirement for some aircraft. The set of methods concerned with the probabilistic formulation of this problem are collectively referred to as Probabilistic Damage Tolerance Analysis (PDTA). The goal of PDTA is to control the failure probability while holding maintenance costs to a reasonable level. This work focuses specifically on PDTA for fatigue cracking of metallic aircraft structures. The growth of a crack (or cracks) must be modeled using all available data and engineering knowledge. The length of a crack can be assessed only indirectly through evidence such as non-destructive inspection results, failures or lack of failures, and the observed severity of usage of the structure. The current set of industry PDTA tools are lacking in several ways: they may in some cases yield poor estimates of failure probabilities, they cannot realistically represent the variety of possible failure and maintenance scenarios, and they do not allow for model updates which incorporate observed evidence. A PDTA modeling methodology must be flexible enough to estimate accurately the failure and repair probabilities under a variety of maintenance scenarios, and be capable of incorporating observed evidence as it becomes available. This dissertation describes and develops new PDTA methodologies that directly address the deficiencies of the currently used tools. The new methods are implemented as a free, publicly licensed and open source R software package that can be downloaded from the Comprehensive R Archive Network. The tools consist of two main components. First, an explicit (and expensive) Monte Carlo approach is presented which simulates the life of an aircraft structural component flight-by-flight. This straightforward MC routine can be used to provide defensible estimates of the failure probabilities for future flights and repair probabilities for future inspections under a variety of failure and maintenance scenarios. This routine is intended to provide baseline estimates against which to compare the results of other, more efficient approaches. Second, an original approach is described which models the fatigue process and future scheduled inspections as a hidden Markov model. This model is solved using a particle-based approximation and the sequential importance sampling algorithm, which provides an efficient solution to the PDTA problem. Sequential importance sampling is an extension of importance sampling to a Markov process, allowing for efficient Bayesian updating of model parameters. This model updating capability, the benefit of which is demonstrated, is lacking in other PDTA approaches. The results of this approach are shown to agree with the results of the explicit Monte Carlo routine for a number of PDTA problems. Extensions to the typical PDTA problem, which cannot be solved using currently available tools, are presented and solved in this work. These extensions include incorporating observed evidence (such as non-destructive inspection results), more realistic treatment of possible future repairs, and the modeling of failure involving more than one crack (the so-called continuing damage problem). The described hidden Markov model / sequential importance sampling approach to PDTA has the potential to improve aerospace structural safety and reduce maintenance costs by providing a more accurate assessment of the risk of failure and the likelihood of repairs throughout the life of an aircraft.

Managing Highway Maintenance: Standards for Maintenance Work, Part 1, Unit 8, Level 2.

ERIC Educational Resources Information Center

Federal Highway Administration (DOT), Washington, DC. Offices of Research and Development.

Part of the series "Managing Highway Maintenance," the unit is about maintenance standards and is designed for superintendents and senior foremen who are responsible for scheduling and controlling routine maintenance. It describes different kinds of standards, why and how standards are developed, and how standards are to be used and…

77 FR 27115 - Drawbridge Operation Regulations; Raritan River, Perth Amboy, NJ

Federal Register 2010, 2011, 2012, 2013, 2014

2012-05-09

... the draw may remain in the closed position for four days to facilitate mechanical maintenance. Vessels... scheduled mechanical maintenance at the bridge. In order to perform the bridge maintenance the bridge must...

A Planned Preventive Maintenance Program. A Handbook for Chief Business Officers and Supervisors of Maintenance with Suggestions on Maintenance for Consideration by Presidents of Higher Institutions.

ERIC Educational Resources Information Center

Daniel, Clarence H.

This handbook explains planned preventive maintenance program, which is an operational system of maintenance designed to increase the effectiveness of the maintenance staff and the use of maintenance funds through efficient scheduling of inspections and follow-through of work to be performed. Sections are included for the chief administrative…

A strategic value management approach for energy and maintenance management in a building

NASA Astrophysics Data System (ADS)

Nawi, Mohd Nasrun Mohd; Dahlan, Nofri Yenita; Nadarajan, Santhirasegaran

2015-05-01

Fragmentation process is always been highlighted by the stakeholders in the construction industry as one of the `critical' issue that diminishing the opportunity for stakeholders that involved during the operation and maintenance stage to influence design decisions. Failure of design professionals to consider how a maintenance contractor or facility manager will construct the design thus results in higher operating cost, wastage, defects during the maintenance and operation process. Moving towards team integration is considered a significant strategy for overcoming the issue. Value Management is a style of management dedicated to guiding people and promoting innovation with the aim to improve overall building performance through structured, team-oriented exercises which make explicit, and appraise subsequent decisions, by reference to the value requirements of the clients. Accordingly, this paper discusses the fragmentation issue in more detail including the definition, causes and effects to the maintenance and operation of building and at the same time will highlighted the potential of VM integrated team approach as a strategic management approach for overcoming that issue. It also explores that the team integration strategy alleviates scheduling problems, delays and disputes during the construction process, and, hence, prevent harming the overall building performance.

Management Tools for Bus Maintenance: Current Practices and New Methods. Final Report.

ERIC Educational Resources Information Center

Foerster, James; And Others

Management of bus fleet maintenance requires systematic recordkeeping, management reporting, and work scheduling procedures. Tools for controlling and monitoring routine maintenance activities are in common use. These include defect and fluid consumption reports, work order systems, historical maintenance records, and performance and cost…

Optimal Preventive Maintenance Schedule based on Lifecycle Cost and Time-Dependent Reliability

DTIC Science & Technology

2011-11-10

Page 1 of 16 UNCLASSIFIED: Distribution Statement A. Approved for public release. 12IDM-0064 Optimal Preventive Maintenance Schedule based... 1 . INTRODUCTION Customers and product manufacturers demand continued functionality of complex equipment and processes. Degradation of material...Documentation Page Form ApprovedOMB No. 0704-0188 Public reporting burden for the collection of information is estimated to average 1 hour per response

75 FR 7411 - Schedule of Water Charges

Federal Register 2010, 2011, 2012, 2013, 2014

2010-02-19

... sale revenues, while the costs of reservoir maintenance and operations, contractual services and..., ``including debt service, operation, maintenance, replacement, reserves, and associated administrative costs... holds funds dedicated to pay the costs of project construction, operation, maintenance, and replacement...

Feasibility of extended use of an electromagnetic lithotripter beyond the manufacturer's recommended maintenance schedule.

PubMed

Chen, Tony Y H; Ponsot, Yves; Brouillette, Martin; Tétrault, Jean-Píerre; Tu, Le Mai

2007-06-01

The study evaluates the effect of chronic usage, beyond the recommended maintenance schedule, on the efficacy of electromagnetic lithotripter. To our knowledge, there is no publication investigating the effect of chronic usage on the electromagnetic lithotripter, despite the maintenance schedule established by the manufacturers. Our goal is to verify if the acoustic parameters of the shock wave changed with usage, and if this change could be associated with change in clinical efficacy. This study lasted 18 months. Every 6 months the lithotripter's efficacy was evaluated in two ways: objectively and clinically. Objective efficacy was measured using a piezoelectric hydrophone and artificial stones to capture the acoustic parameters and the crater of fragmentation, respectively. Clinical efficacy data was collected by studying the rate of successful extracorporeal shock wave lithotripsy treatment in patients with urolithiasis. The changes in clinical efficacy, acoustic parameters, and craters of fragmentation were compared and analyzed with appropriate statistical methods. Five hundred twenty five patients participated in the study. The clinical efficacy remained stable throughout the three observation periods (55.7%, 66.2% and 55.5%; p = 0.11). The focal head of the lithotripter was used three times the recommended schedule. There was no obvious change in the acoustic parameters of the shock waves, and the focal zone remained stable. The clinical efficacy of the electromagnetic lithotripter appears to be stable despite usage beyond the recommended maintenance schedule. More studies are needed to validate the safety of this practice.

Dry-running gas seals save $200,000/yr in retrofit hydrogen recycle compressor

DOE Office of Scientific and Technical Information (OSTI.GOV)

Pennacchi, R.P.; Germain, A.

1987-10-01

Texaco Chemical Company was using three drums of oil per day in the seal oil system of a hydrogen recycle compressor, resulting in maintenance and operational expenses of more than $160,000 per year. Running 24 hours/day, 365 days/yr, the 26-yr-old compressor is the heart of the benzene manufacturing process unit at the Port Arthur, Texas plant. In the event of an unscheduled shutdown, the important aromatics unit process would halt and cause production losses of thousands of dollars per day. In addition, the close monitoring and minimization of leakage are essential since the gas consists of over 75% hydrogen, withmore » methane, ethane, propane, isobutane, N-butane and pentanes. Texaco Chemical Company decided that retrofit of the hydrogen recycle compressor should be undertaken if the system could be developed to sharply reduce operations and maintenance costs, and increase efficiencies. Texaco engineers selected a dry running-type gas sealing system developed for pipeline compressors in the United States, Canada, and overseas. A tandem-type sealing system was designed to meet specific needs of a hydrogen recycle compressor. The retrofit was scheduled for August 1986 to coincide with the plant's preventative maintenance program. The seal system installation required five days. The retrofit progressed according to schedule, with no problems experienced at the first and several startups since the initial installation. Oil consumption has been eliminated, along with seal support and parasitic energy requirements. With the savings in seal oil, energy, operations and maintenance, payback period for the retrofit sealing system was just over six months. Savings are expected to continue at an annual rate of over $200,000.« less

40 CFR 63.7826 - How do I demonstrate initial compliance with the operation and maintenance requirements that...

Code of Federal Regulations, 2010 CFR

2010-07-01

... preventative maintenance schedule and, as applicable, detailed descriptions of the corrective action procedures... compliance with the operation and maintenance requirements that apply to me? 63.7826 Section 63.7826... Compliance Requirements § 63.7826 How do I demonstrate initial compliance with the operation and maintenance...

Distributed decision-making in electric power system transmission maintenance scheduling using multi-agent systems (MAS)

NASA Astrophysics Data System (ADS)

Zhang, Zhong

In this work, motivated by the need to coordinate transmission maintenance scheduling among a multiplicity of self-interested entities in restructured power industry, a distributed decision support framework based on multiagent negotiation systems (MANS) is developed. An innovative risk-based transmission maintenance optimization procedure is introduced. Several models for linking condition monitoring information to the equipment's instantaneous failure probability are presented, which enable quantitative evaluation of the effectiveness of maintenance activities in terms of system cumulative risk reduction. Methodologies of statistical processing, equipment deterioration evaluation and time-dependent failure probability calculation are also described. A novel framework capable of facilitating distributed decision-making through multiagent negotiation is developed. A multiagent negotiation model is developed and illustrated that accounts for uncertainty and enables social rationality. Some issues of multiagent negotiation convergence and scalability are discussed. The relationships between agent-based negotiation and auction systems are also identified. A four-step MAS design methodology for constructing multiagent systems for power system applications is presented. A generic multiagent negotiation system, capable of inter-agent communication and distributed decision support through inter-agent negotiations, is implemented. A multiagent system framework for facilitating the automated integration of condition monitoring information and maintenance scheduling for power transformers is developed. Simulations of multiagent negotiation-based maintenance scheduling among several independent utilities are provided. It is shown to be a viable alternative solution paradigm to the traditional centralized optimization approach in today's deregulated environment. This multiagent system framework not only facilitates the decision-making among competing power system entities, but also provides a tool to use in studying competitive industry relative to monopolistic industry.

Industrial Processes to Reduce Generation of Hazardous Waste at DoD Facilities. Phase III Report. Appendix C. Workshop Manual Centralized Vehicle Wash Racks and Scheduled Maintenance Facilities, Fort Lewis, Washington.

DTIC Science & Technology

1985-12-01

Lobster Shop - 759-2165. 4013 Ruston Way. Known for excellent seafood. Nautical The Bay Co. - 752-6661. 3327 Ruston Way. Various entrees. CI Shenanigans ...se- RCRA permit is inappropriate." Ac- forms of financial responsibility for rious potential health problem in New cording to Rogers and Darrah, under...admini- strative, monitoring, and financial standards for them. EPA will use these independently enforceable standards to issue permits to owners

Operating and maintaining your heat recovery ventilator (HRV) -- Revised edition. Home heating and cooling series, Number 8

DOE Office of Scientific and Technical Information (OSTI.GOV)

NONE

Heat recovery ventilators (HRVs) differ from other mechanical ventilation devices by their ability to exchange heat between supply and exhaust air streams, which reduces the cost of heating or cooling fresh air. This booklet discusses the need for mechanical ventilation in conventional and energy-efficient homes, an explains the components of a HRV system, how to operate and maintain the system, and how to solve operating problems. A maintenance chart and schedule and a HRV troubleshooting guide are included.

Scheduling System Assessment, and Development and Enhancement of Re-engineered Version of GPSS

NASA Technical Reports Server (NTRS)

Loganantharaj, Rasiah; Thomas, Bushrod; Passonno, Nicole

1996-01-01

The objective of this project is two-fold. First to provide an evaluation of a commercially developed version of the ground processing scheduling system (GPSS) for its applicability to the Kennedy Space Center (KSC) ground processing problem. Second, to work with the KSC GPSS development team and provide enhancement to the existing software. Systems reengineering is required to provide a sustainable system for the users and the software maintenance group. Using the LISP profile prototype code developed by the GPSS reverse reengineering groups as a building block, we have implemented the resource deconfliction portion of GPSS in common LISP using its object oriented features. The prototype corrects and extends some of the deficiencies of the current production version, plus it uses and builds on the classes from the development team's profile prototype.

14 CFR 145.3 - Definition of terms.

Code of Federal Regulations, 2011 CFR

2011-01-01

... maintenance resulting from unforeseen events; or (2) Scheduled checks that contain servicing and/or... regulations and serving as the primary contact with the FAA. (b) Article means an aircraft, airframe, aircraft... for the work of a certificated repair station that performs maintenance, preventive maintenance...

14 CFR 145.3 - Definition of terms.

Code of Federal Regulations, 2013 CFR

2013-01-01

... maintenance resulting from unforeseen events; or (2) Scheduled checks that contain servicing and/or... regulations and serving as the primary contact with the FAA. (b) Article means an aircraft, airframe, aircraft... for the work of a certificated repair station that performs maintenance, preventive maintenance...

14 CFR 145.3 - Definition of terms.

Code of Federal Regulations, 2012 CFR

2012-01-01

... maintenance resulting from unforeseen events; or (2) Scheduled checks that contain servicing and/or... regulations and serving as the primary contact with the FAA. (b) Article means an aircraft, airframe, aircraft... for the work of a certificated repair station that performs maintenance, preventive maintenance...

14 CFR 145.3 - Definition of terms.

Code of Federal Regulations, 2014 CFR

2014-01-01

... maintenance resulting from unforeseen events; or (2) Scheduled checks that contain servicing and/or... regulations and serving as the primary contact with the FAA. (b) Article means an aircraft, airframe, aircraft... for the work of a certificated repair station that performs maintenance, preventive maintenance...

14 CFR 145.3 - Definition of terms.

Code of Federal Regulations, 2010 CFR

2010-01-01

... maintenance resulting from unforeseen events; or (2) Scheduled checks that contain servicing and/or... regulations and serving as the primary contact with the FAA. (b) Article means an aircraft, airframe, aircraft... for the work of a certificated repair station that performs maintenance, preventive maintenance...

Pollution Prevention in the Land Maintenance System

DTIC Science & Technology

2000-04-01

pollutants, and greenhouse gases. Canada’s Land Maintenance System consists of first line field units, second line field units, base units and a repair...workshops. For example, extending maintenance schedules, using extended life products and using dehumidification for preservation of equipment will lower

Constrained non-linear multi-objective optimisation of preventive maintenance scheduling for offshore wind farms

NASA Astrophysics Data System (ADS)

Zhong, Shuya; Pantelous, Athanasios A.; Beer, Michael; Zhou, Jian

2018-05-01

Offshore wind farm is an emerging source of renewable energy, which has been shown to have tremendous potential in recent years. In this blooming area, a key challenge is that the preventive maintenance of offshore turbines should be scheduled reasonably to satisfy the power supply without failure. In this direction, two significant goals should be considered simultaneously as a trade-off. One is to maximise the system reliability and the other is to minimise the maintenance related cost. Thus, a non-linear multi-objective programming model is proposed including two newly defined objectives with thirteen families of constraints suitable for the preventive maintenance of offshore wind farms. In order to solve our model effectively, the nondominated sorting genetic algorithm II, especially for the multi-objective optimisation is utilised and Pareto-optimal solutions of schedules can be obtained to offer adequate support to decision-makers. Finally, an example is given to illustrate the performances of the devised model and algorithm, and explore the relationships of the two targets with the help of a contrast model.

Demonstration of decomposition and optimization in the design of experimental space systems

NASA Technical Reports Server (NTRS)

Padula, Sharon; Sandridge, Chris A.; Haftka, Raphael T.; Walsh, Joanne L.

1989-01-01

Effective design strategies for a class of systems which may be termed Experimental Space Systems (ESS) are needed. These systems, which include large space antenna and observatories, space platforms, earth satellites and deep space explorers, have special characteristics which make them particularly difficult to design. It is argued here that these same characteristics encourage the use of advanced computer-aided optimization and planning techniques. The broad goal of this research is to develop optimization strategies for the design of ESS. These strategics would account for the possibly conflicting requirements of mission life, safety, scientific payoffs, initial system cost, launch limitations and maintenance costs. The strategies must also preserve the coupling between disciplines or between subsystems. Here, the specific purpose is to describe a computer-aided planning and scheduling technique. This technique provides the designer with a way to map the flow of data between multidisciplinary analyses. The technique is important because it enables the designer to decompose the system design problem into a number of smaller subproblems. The planning and scheduling technique is demonstrated by its application to a specific preliminary design problem.

Operation and Maintenance Resources for Small Drinking Water Systems

EPA Pesticide Factsheets

These documents and tools provide information on identifying treatment technologies that remove multiple contaminants, schedules for maintenance tasks and checklists, and logs for easily recording findings.

Managing Highway Maintenance: Management Data and Maintenance Standards; Levels 1 & 2, For Training in Maintenance Standards and Crew Scheduling.

ERIC Educational Resources Information Center

Federal Highway Administration (DOT), Washington, DC. Offices of Research and Development.

Part of the series "Managing Highway Maintenance," the unit is designed for use with unit eight, level one, and unit 13, level two, and the certification tests for those units in the series. It contains typical management data and selected highway maintenance standards for the areas of: surface and shoulder; roadside and drainage; traffic…

Planification de la maintenance d'un parc de turbines-alternateurs par programmation mathematique

NASA Astrophysics Data System (ADS)

Aoudjit, Hakim

A growing number of Hydro-Quebec's hydro generators are at the end of their useful life and maintenance managers fear to face a number of overhauls exceeding what can be handled. Maintenance crews and budgets are limited and these withdrawals may take up to a full year and mobilize significant resources in addition to the loss of electricity production. In addition, increased export sales forecasts and severe production patterns are expected to speed up wear that can lead to halting many units at the same time. Currently, expert judgment is at the heart of withdrawals which rely primarily on periodic inspections and in-situ measurements and the results are sent to the maintenance planning team who coordinate all the withdrawals decisions. The degradations phenomena taking place is random in nature and the prediction capability of wear using only inspections is limited to short-term at best. A long term planning of major overhauls is sought by managers for the sake of justifying and rationalizing budgets and resources. The maintenance managers are able to provide a huge amount of data. Among them, is the hourly production of each unit for several years, the repairs history on each part of a unit as well as major withdrawals since the 1950's. In this research, we tackle the problem of long term maintenance planning for a fleet of 90 hydro generators at Hydro-Quebec over a 50 years planning horizon period. We lay a scientific and rational framework to support withdrawals decisions by using part of the available data and maintenance history while fulfilling a set of technical and economic constraints. We propose a planning approach based on a constrained optimization framework. We begin by decomposing and sorting hydro generator components to highlight the most influential parts. A failure rate model is developed to take into account the technical characteristics and unit utilization. Then, replacement and repair policies are evaluated for each of the components then strategies are derived for the whole unit. Traditional univariate policies such as the age replacement policy and the minimal repair policy are calculated. These policies are extended to build alternative bivariate maintenance policy as well as a repair strategy where the state of a component after a repair is rejuvenated by a constant coefficient. These templates form the basis for the calculation of objective function for the scheduling problem. On one hand, this issue is treated as a nonlinear problem where the objective is to minimize the average total maintenance cost per unit of time on an infinite horizon for the fleet with technical and economic constraints. A formulation is also proposed in the case of a finite time horizon. In the event of electricity production variation, and given that the usage profile is known, the influence of production scenarios is reflected on the unit's components through their failure rate. In this context, prognoses on possible resources problems are made by studying the characteristics of the generated plans. On the second hand, the withdrawals are now subjected to two decision criteria. In addition to minimizing the average total maintenance cost per unit of time on an infinite time horizon, the best achievable reliability of remaining turbo generators is sought. This problem is treated as a biobjective nonlinear optimization problem. Finally a series of problems describing multiple contexts are solved for planning renovations of 90 turbo generators units considering 3 major components in each unit and 2 types of maintenance policies for each component.

41 CFR 102-34.275 - What kind of maintenance programs must we have?

Code of Federal Regulations, 2010 CFR

2010-07-01

... 41 Public Contracts and Property Management 3 2010-07-01 2010-07-01 false What kind of maintenance programs must we have? 102-34.275 Section 102-34.275 Public Contracts and Property Management Federal... VEHICLE MANAGEMENT Scheduled Maintenance of Motor Vehicles § 102-34.275 What kind of maintenance programs...

Application Analysis of BIM Technology in Metro Rail Transit

NASA Astrophysics Data System (ADS)

Liu, Bei; Sun, Xianbin

2018-03-01

With the rapid development of urban roads, especially the construction of subway rail transit, it is an effective way to alleviate urban traffic congestion. There are limited site space, complex resource allocation, tight schedule, underground pipeline complex engineering problems. BIM technology, three-dimensional visualization, parameterization, virtual simulation and many other advantages can effectively solve these technical problems. Based on the project of Shenzhen Metro Line 9, BIM technology is innovatively researched throughout the lifecycle of BIM technology in the context of the metro rail transit project rarely used at this stage. The model information file is imported into Navisworks for four-dimensional animation simulation to determine the optimum construction scheme of the shield machine. Subway construction management application platform based on BIM and private cloud technology, the use of cameras and sensors to achieve electronic integration, dynamic monitoring of the operation and maintenance of underground facilities. Make full use of the many advantages of BIM technology to improve the engineering quality and construction efficiency of the subway rail transit project and to complete the operation and maintenance.

Installation, operation, and maintenance for the pyramidal optics solar system installed at Yacht Cover, Columbia, South Carolina

NASA Technical Reports Server (NTRS)

1980-01-01

Information concerning the installation, operation, and maintenance of the pyramidal Solar System for space heating and domestic hot water is presented. Principles of operation, sequence of installation, and procedures for the operation and maintenance of each subsystem making up the solar system are presented. Troubleshooting charts and maintenance schedules are presented.

Installation, operation, and maintenance for the pyramidal optics solar system installed at Yacht Cover, Columbia, South Carolina

NASA Astrophysics Data System (ADS)

1980-09-01

Information concerning the installation, operation, and maintenance of the pyramidal Solar System for space heating and domestic hot water is presented. Principles of operation, sequence of installation, and procedures for the operation and maintenance of each subsystem making up the solar system are presented. Troubleshooting charts and maintenance schedules are presented.

18 CFR 368.3 - Schedule of records and periods of retention.

Code of Federal Regulations, 2013 CFR

2013-04-01

... companies. (c) Paid checks and receipts for payments of specific vouchers 5 years. (d) Authorization for the... and reports of condition of property Destroy when superseded. Maintenance 13. Maintenance project and work orders: (a) Authorizations for expenditures for maintenance work to be covered by project or work...

18 CFR 368.3 - Schedule of records and periods of retention.

Code of Federal Regulations, 2014 CFR

2014-04-01

... companies. (c) Paid checks and receipts for payments of specific vouchers 5 years. (d) Authorization for the... and reports of condition of property Destroy when superseded. Maintenance 13. Maintenance project and work orders: (a) Authorizations for expenditures for maintenance work to be covered by project or work...

76 FR 73477 - Airworthiness Directives; BAE SYSTEMS (Operations) Limited Airplanes

Federal Register 2010, 2011, 2012, 2013, 2014

2011-11-29

... of the AMM [aircraft maintenance manual] to introduce a new hydraulic filter assembly life limit and...: The BAe 146/AVRO 146-RJ Aircraft Maintenance Manual (AMM) includes chapters 05-10 ``Time Limits'', 05...'' and 05-20 ``Scheduled Maintenance Checks'', some sub-chapters of which have been identified as...

18 CFR 368.3 - Schedule of records and periods of retention.

Code of Federal Regulations, 2012 CFR

2012-04-01

... companies. (c) Paid checks and receipts for payments of specific vouchers 5 years. (d) Authorization for the... and reports of condition of property Destroy when superseded. Maintenance 13. Maintenance project and work orders: (a) Authorizations for expenditures for maintenance work to be covered by project or work...

46 CFR 109.301 - Operational readiness, maintenance, and inspection of lifesaving equipment.

Code of Federal Regulations, 2012 CFR

2012-10-01

... and cleaning each fuel tank, and refilling it with fresh fuel. (2) Each davit, winch, fall and other...(e); (ii) Maintenance and repair instructions; (iii) A schedule of periodic maintenance; (iv) A... repair equipment. Spare parts and repair equipment must be provided for each lifesaving appliance and...

46 CFR 109.301 - Operational readiness, maintenance, and inspection of lifesaving equipment.

Code of Federal Regulations, 2011 CFR

2011-10-01

... and cleaning each fuel tank, and refilling it with fresh fuel. (2) Each davit, winch, fall and other...(e); (ii) Maintenance and repair instructions; (iii) A schedule of periodic maintenance; (iv) A... repair equipment. Spare parts and repair equipment must be provided for each lifesaving appliance and...

46 CFR 109.301 - Operational readiness, maintenance, and inspection of lifesaving equipment.

Code of Federal Regulations, 2014 CFR

2014-10-01

... and cleaning each fuel tank, and refilling it with fresh fuel. (2) Each davit, winch, fall and other...(e); (ii) Maintenance and repair instructions; (iii) A schedule of periodic maintenance; (iv) A... repair equipment. Spare parts and repair equipment must be provided for each lifesaving appliance and...

46 CFR 109.301 - Operational readiness, maintenance, and inspection of lifesaving equipment.

Code of Federal Regulations, 2013 CFR

2013-10-01

... and cleaning each fuel tank, and refilling it with fresh fuel. (2) Each davit, winch, fall and other...(e); (ii) Maintenance and repair instructions; (iii) A schedule of periodic maintenance; (iv) A... repair equipment. Spare parts and repair equipment must be provided for each lifesaving appliance and...

40 CFR 1065.410 - Maintenance limits for stabilized test engines.

Code of Federal Regulations, 2011 CFR

2011-07-01

...) AIR POLLUTION CONTROLS ENGINE-TESTING PROCEDURES Engine Selection, Preparation, and Maintenance § 1065... scheduled maintenance on emission data engines must be representative of what is planned to be available to... no longer use it as an emission-data engine. Also, if your test engine has a major mechanical failure...

40 CFR 1065.410 - Maintenance limits for stabilized test engines.

Code of Federal Regulations, 2010 CFR

2010-07-01

...) AIR POLLUTION CONTROLS ENGINE-TESTING PROCEDURES Engine Selection, Preparation, and Maintenance § 1065... scheduled maintenance on emission data engines must be representative of what is planned to be available to... no longer use it as an emission-data engine. Also, if your test engine has a major mechanical failure...

49 CFR Appendix A to Part 224 - Schedule of Civil Penalties1

Code of Federal Regulations, 2012 CFR

2012-10-01

... 49 Transportation 4 2012-10-01 2012-10-01 false Schedule of Civil Penalties1 A Appendix A to Part 224 Transportation Other Regulations Relating to Transportation (Continued) FEDERAL RAILROAD... Appendix A to Part 224—Schedule of Civil Penalties1 Subpart B—Application, Inspection, and Maintenance of...

75 FR 56517 - Privacy Act of 1974; System of Records

Federal Register 2010, 2011, 2012, 2013, 2014

2010-09-16

... entry and replace with ``5 U.S.C. 6120, Flexible and Compressed Work Schedules, Purposes; DoD Directive... and tour of duty at the alternative worksite; regular work schedule (8 hours a day, flexitour or compressed); telework schedule. Authority for maintenance of the system: 5 U.S.C. 6120, Flexible and...

Inactivated poliovirus vaccine and the final stages of poliovirus eradication.

PubMed

Hovi, T

2001-03-21

The use of the inactivated poliovirus vaccine (IPV) will increase before and probably also after the global eradication of the wild type poliovirus. Before eradication, the switch from the use of oral poliovirus vaccine (OPV) to IPV has been due to the better safety record of IPV. Introduction of IPV in the regular immunisation schedules is made easier by the development of several combination vaccines, including IPV. Maternal antibodies and young age, often considered problematic for early initiation of IPV schedules, did not compromise optimal maintenance of seropositivity during infancy or long-term persisting antibody levels in our studies. OPV-derived, potentially pathogenic and transmissible poliovirus strains, excreted by some individuals for years, may present a problem for a blunt stopping of all polio immunisations after eradication. Our recent results suggest that locally excreted IgA might have a role in the elimination of poliovirus infection in the intestinal tissues.

Comprehensive Anti-error Study on Power Grid Dispatching Based on Regional Regulation and Integration

NASA Astrophysics Data System (ADS)

Zhang, Yunju; Chen, Zhongyi; Guo, Ming; Lin, Shunsheng; Yan, Yinyang

2018-01-01

With the large capacity of the power system, the development trend of the large unit and the high voltage, the scheduling operation is becoming more frequent and complicated, and the probability of operation error increases. This paper aims at the problem of the lack of anti-error function, single scheduling function and low working efficiency for technical support system in regional regulation and integration, the integrated construction of the error prevention of the integrated architecture of the system of dispatching anti - error of dispatching anti - error of power network based on cloud computing has been proposed. Integrated system of error prevention of Energy Management System, EMS, and Operation Management System, OMS have been constructed either. The system architecture has good scalability and adaptability, which can improve the computational efficiency, reduce the cost of system operation and maintenance, enhance the ability of regional regulation and anti-error checking with broad development prospects.

Software for Planning Scientific Activities on Mars

NASA Technical Reports Server (NTRS)

Ai-Chang, Mitchell; Bresina, John; Jonsson, Ari; Hsu, Jennifer; Kanefsky, Bob; Morris, Paul; Rajan, Kanna; Yglesias, Jeffrey; Charest, Len; Maldague, Pierre

2003-01-01

Mixed-Initiative Activity Plan Generator (MAPGEN) is a ground-based computer program for planning and scheduling the scientific activities of instrumented exploratory robotic vehicles, within the limitations of available resources onboard the vehicle. MAPGEN is a combination of two prior software systems: (1) an activity-planning program, APGEN, developed at NASA s Jet Propulsion Laboratory and (2) the Europa planner/scheduler from NASA Ames Research Center. MAPGEN performs all of the following functions: Automatic generation of plans and schedules for scientific and engineering activities; Testing of hypotheses (or what-if analyses of various scenarios); Editing of plans; Computation and analysis of resources; and Enforcement and maintenance of constraints, including resolution of temporal and resource conflicts among planned activities. MAPGEN can be used in either of two modes: one in which the planner/scheduler is turned off and only the basic APGEN functionality is utilized, or one in which both component programs are used to obtain the full planning, scheduling, and constraint-maintenance functionality.

Survey of Condition Indicators for Condition Monitoring Systems (Open Access)

DTIC Science & Technology

2014-09-29

Hinesburg, Vermont, 05461, USA jz@renewablenrgsystems.com ABSTRACT Currently, the wind energy industry is swiftly changing its maintenance strategy...from schedule based maintenance to predictive based maintenance . Condition monitoring systems (CMS) play an important role in the predictive... maintenance cycle. As condition monitoring systems are being adopted by more and more OEM and O&M service providers from the wind energy industry, it is

Maintenance Downtime April 23, 2014

Atmospheric Science Data Center

2014-04-23

Date(s):  Wednesday, April 23, 2014 Time:  7:00 am - 5:00 pm EDT Event ... Due to scheduled maintenance Wednesday, April 23, 2014: The Data Pool, MISR order and browse tools, TES and MOPITT Search ...

Maintenance Downtime September 18, 2013

Atmospheric Science Data Center

2013-09-16

Date(s):  Wednesday, September 18, 2013 Time:  9:00 - 11:00 am EST Event Impact:  Due to scheduled maintenance Wednesday, September 18, 2013: The MISR order and browse tools, Reverb, and AMAPS will be ...

46 CFR 199.190 - Operational readiness, maintenance, and inspection of lifesaving equipment.

Code of Federal Regulations, 2012 CFR

2012-10-01

... each fuel tank must be emptied, cleaned, and refilled with fresh fuel. (2) Each davit, winch, fall, and... required under paragraph (e) of this section. (ii) Maintenance and repair instructions. (iii) A schedule of... planned maintenance program that includes the items listed in that paragraph. (c) Spare parts and repair...

46 CFR 199.190 - Operational readiness, maintenance, and inspection of lifesaving equipment.

Code of Federal Regulations, 2013 CFR

2013-10-01

... each fuel tank must be emptied, cleaned, and refilled with fresh fuel. (2) Each davit, winch, fall, and... required under paragraph (e) of this section. (ii) Maintenance and repair instructions. (iii) A schedule of... planned maintenance program that includes the items listed in that paragraph. (c) Spare parts and repair...

46 CFR 199.190 - Operational readiness, maintenance, and inspection of lifesaving equipment.

Code of Federal Regulations, 2014 CFR

2014-10-01

... each fuel tank must be emptied, cleaned, and refilled with fresh fuel. (2) Each davit, winch, fall, and... required under paragraph (e) of this section. (ii) Maintenance and repair instructions. (iii) A schedule of... planned maintenance program that includes the items listed in that paragraph. (c) Spare parts and repair...

46 CFR 199.190 - Operational readiness, maintenance, and inspection of lifesaving equipment.

Code of Federal Regulations, 2011 CFR

2011-10-01

... each fuel tank must be emptied, cleaned, and refilled with fresh fuel. (2) Each davit, winch, fall, and... required under paragraph (e) of this section. (ii) Maintenance and repair instructions. (iii) A schedule of... planned maintenance program that includes the items listed in that paragraph. (c) Spare parts and repair...

40 CFR 1054.145 - Are there interim provisions that apply only for a limited time?

Code of Federal Regulations, 2010 CFR

2010-07-01

... scheduled emission-related maintenance falls within 10 hours of a test point, delay the maintenance until the engine reaches the test point. Measure emissions before and after peforming the maintenance. Use... example, for the fuel line permeation standards starting in 2012, equipment manufacturers may order a...

Maglev guideway cost and construction schedule assessment

DOE Office of Scientific and Technical Information (OSTI.GOV)

Plotkin, D.; Kim, S.

1997-05-01

A summary of construction cost and scheduling information is presented for four maglev guideway designs on an example route from Baltimore, MD to Newark, NJ. This work results from the National Maglev Initiative (NMI), a government-industry effort from 1989 to 1994. The system design concepts used as a basis for developing cost and construction scheduling information, were submitted by four industry consortia solely for this analysis, and represent their own unpublished designs. The detailed cost and construction schedule analyses cover the main guideway only. A summary estimate was made for stations, power distribution systems, maintenance facilities, and other types ofmore » infrastructure. The results of the analyses indicate a number of design aspects which must receive further consideration by future designers. These aspects will affect the practical and economic construction and long-term maintenance of a high-speed maglev guideway.« less

Constraint Maintenance with Preferences and Underlying Flexible Solution

NASA Technical Reports Server (NTRS)

Bresina, John; Jonsson, Ari; Morris, Paul; Rajan, Kanna

2003-01-01

This paper describes an aspect of the constraint reasoning mechanism. that is part of a ground planning system slated to be used for the Mars Exploration Rovers mission, where two rovers are scheduled to land on Mars in January of 2003. The planning system combines manual planning software from JPL with an automatic planning/scheduling system from NASA Ames Research Center, and is designed to be used in a mixed-initiative mode. Among other things, this means that after a plan has been produced, the human operator can perform extensive modifications under the supervision of the automated. system. For each modification to an activity, the automated system must adjust other activities as needed to ensure that constraints continue to be satisfied. Thus, the system must accommodate change in an interactive setting. Performance is of critical importance for interactive use. This is achieved by maintaining an underlying flexible solution to the temporal constraints, while the system presents a fixed schedule to the user. Adjustments are then a matter of constraint propagation rather than completely re-solving the problem. However, this begs the important question of which fixed schedule (among the ones sanctioned by the underlying flexible solution) should be presented to the user.Our approach uses least-change and other preferences as a prism through which the user views the flexible solution.

Constraint-based integration of planning and scheduling for space-based observatory management

NASA Technical Reports Server (NTRS)

Muscettola, Nicola; Smith, Steven F.

1994-01-01

Progress toward the development of effective, practical solutions to space-based observatory scheduling problems within the HSTS scheduling framework is reported. HSTS was developed and originally applied in the context of the Hubble Space Telescope (HST) short-term observation scheduling problem. The work was motivated by the limitations of the current solution and, more generally, by the insufficiency of classical planning and scheduling approaches in this problem context. HSTS has subsequently been used to develop improved heuristic solution techniques in related scheduling domains and is currently being applied to develop a scheduling tool for the upcoming Submillimeter Wave Astronomy Satellite (SWAS) mission. The salient architectural characteristics of HSTS and their relationship to previous scheduling and AI planning research are summarized. Then, some key problem decomposition techniques underlying the integrated planning and scheduling approach to the HST problem are described; research results indicate that these techniques provide leverage in solving space-based observatory scheduling problems. Finally, more recently developed constraint-posting scheduling procedures and the current SWAS application focus are summarized.

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

NASA Astrophysics Data System (ADS)

Adhi, Antono; Santosa, Budi; Siswanto, Nurhadi

2018-04-01

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

Applying the TOC Project Management to Operation and Maintenance Scheduling of a Research Vessel

NASA Astrophysics Data System (ADS)

Manti, M. Firdausi; Fujimoto, Hideo; Chen, Lian-Yi

Marine research vessels and their systems are major assets in the marine resources development. Since the running costs for the ship are very high, it is necessary to reduce the total cost by an efficient scheduling for operation and maintenance. To reduce project period and make it efficient, we applied TOC project management method that is a project management approach developed by Dr. Eli Goldratt. It challenges traditional approaches to project management. It will become the most important improvement in the project management since the development of PERT and critical path methodologies. As a case study, we presented the marine geology research project for the purpose of operations in addition to repair on the repairing dock projects for maintenance of vessels.

Balancing antagonistic time and resource utilization constraints in over-subscribed scheduling problems

NASA Technical Reports Server (NTRS)

Smith, Stephen F.; Pathak, Dhiraj K.

1991-01-01

In this paper, we report work aimed at applying concepts of constraint-based problem structuring and multi-perspective scheduling to an over-subscribed scheduling problem. Previous research has demonstrated the utility of these concepts as a means for effectively balancing conflicting objectives in constraint-relaxable scheduling problems, and our goal here is to provide evidence of their similar potential in the context of HST observation scheduling. To this end, we define and experimentally assess the performance of two time-bounded heuristic scheduling strategies in balancing the tradeoff between resource setup time minimization and satisfaction of absolute time constraints. The first strategy considered is motivated by dispatch-based manufacturing scheduling research, and employs a problem decomposition that concentrates local search on minimizing resource idle time due to setup activities. The second is motivated by research in opportunistic scheduling and advocates a problem decomposition that focuses attention on the goal activities that have the tightest temporal constraints. Analysis of experimental results gives evidence of differential superiority on the part of each strategy in different problem solving circumstances. A composite strategy based on recognition of characteristics of the current problem solving state is then defined and tested to illustrate the potential benefits of constraint-based problem structuring and multi-perspective scheduling in over-subscribe scheduling problems.

14 CFR Appendix A to Part 91 - Category II Operations: Manual, Instruments, Equipment, and Maintenance

Code of Federal Regulations, 2010 CFR

2010-01-01

... authorization for the type aircraft checked. (3) A schedule that provides for the performance of bench checks..., Equipment, and Maintenance A Appendix A to Part 91 Aeronautics and Space FEDERAL AVIATION ADMINISTRATION... Maintenance 1. Category II Manual (a) Application for approval. An applicant for approval of a Category II...

14 CFR Appendix A to Part 91 - Category II Operations: Manual, Instruments, Equipment, and Maintenance

Code of Federal Regulations, 2013 CFR

2013-01-01

... authorization for the type aircraft checked. (3) A schedule that provides for the performance of bench checks..., Equipment, and Maintenance A Appendix A to Part 91 Aeronautics and Space FEDERAL AVIATION ADMINISTRATION... Maintenance 1. Category II Manual (a) Application for approval. An applicant for approval of a Category II...

14 CFR Appendix A to Part 91 - Category II Operations: Manual, Instruments, Equipment, and Maintenance

Code of Federal Regulations, 2012 CFR

2012-01-01

... authorization for the type aircraft checked. (3) A schedule that provides for the performance of bench checks..., Equipment, and Maintenance A Appendix A to Part 91 Aeronautics and Space FEDERAL AVIATION ADMINISTRATION... Maintenance 1. Category II Manual (a) Application for approval. An applicant for approval of a Category II...

14 CFR Appendix A to Part 91 - Category II Operations: Manual, Instruments, Equipment, and Maintenance

Code of Federal Regulations, 2014 CFR

2014-01-01

... authorization for the type aircraft checked. (3) A schedule that provides for the performance of bench checks..., Equipment, and Maintenance A Appendix A to Part 91 Aeronautics and Space FEDERAL AVIATION ADMINISTRATION... Maintenance 1. Category II Manual (a) Application for approval. An applicant for approval of a Category II...

14 CFR Appendix A to Part 91 - Category II Operations: Manual, Instruments, Equipment, and Maintenance

Code of Federal Regulations, 2011 CFR

2011-01-01

... authorization for the type aircraft checked. (3) A schedule that provides for the performance of bench checks..., Equipment, and Maintenance A Appendix A to Part 91 Aeronautics and Space FEDERAL AVIATION ADMINISTRATION... Maintenance 1. Category II Manual (a) Application for approval. An applicant for approval of a Category II...

40 CFR 1054.145 - Are there interim provisions that apply only for a limited time?

Code of Federal Regulations, 2011 CFR

2011-07-01

... scheduled emission-related maintenance falls within 10 hours of a test point, delay the maintenance until the engine reaches the test point. Measure emissions before and after peforming the maintenance. Use... data under 40 CFR 1060.235(e) for your emission family. (j) Continued use of 40 CFR part 90 test...

40 CFR 1054.145 - Are there interim provisions that apply only for a limited time?

Code of Federal Regulations, 2012 CFR

2012-07-01

... scheduled emission-related maintenance falls within 10 hours of a test point, delay the maintenance until the engine reaches the test point. Measure emissions before and after peforming the maintenance. Use... data under 40 CFR 1060.235(e) for your emission family. (j) Continued use of 40 CFR part 90 test...

Decomposability and scalability in space-based observatory scheduling

NASA Technical Reports Server (NTRS)

Muscettola, Nicola; Smith, Stephen F.

1992-01-01

In this paper, we discuss issues of problem and model decomposition within the HSTS scheduling framework. HSTS was developed and originally applied in the context of the Hubble Space Telescope (HST) scheduling problem, motivated by the limitations of the current solution and, more generally, the insufficiency of classical planning and scheduling approaches in this problem context. We first summarize the salient architectural characteristics of HSTS and their relationship to previous scheduling and AI planning research. Then, we describe some key problem decomposition techniques supported by HSTS and underlying our integrated planning and scheduling approach, and we discuss the leverage they provide in solving space-based observatory scheduling problems.

AI techniques for a space application scheduling problem

NASA Technical Reports Server (NTRS)

Thalman, N.; Sparn, T.; Jaffres, L.; Gablehouse, D.; Judd, D.; Russell, C.

1991-01-01

Scheduling is a very complex optimization problem which can be categorized as an NP-complete problem. NP-complete problems are quite diverse, as are the algorithms used in searching for an optimal solution. In most cases, the best solutions that can be derived for these combinatorial explosive problems are near-optimal solutions. Due to the complexity of the scheduling problem, artificial intelligence (AI) can aid in solving these types of problems. Some of the factors are examined which make space application scheduling problems difficult and presents a fairly new AI-based technique called tabu search as applied to a real scheduling application. the specific problem is concerned with scheduling application. The specific problem is concerned with scheduling solar and stellar observations for the SOLar-STellar Irradiance Comparison Experiment (SOLSTICE) instrument in a constrained environment which produces minimum impact on the other instruments and maximizes target observation times. The SOLSTICE instrument will gly on-board the Upper Atmosphere Research Satellite (UARS) in 1991, and a similar instrument will fly on the earth observing system (Eos).

SOFIA's Choice: Automating the Scheduling of Airborne Observations

NASA Technical Reports Server (NTRS)

Frank, Jeremy; Norvig, Peter (Technical Monitor)

1999-01-01

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

Manufacturing Technology Support (MATES). Delivery Order 0002: Business Practices Assessment (BPA) Development

DTIC Science & Technology

2008-03-01

order fulfillment visibility, Kanban deployment, inventory count can be made visually, machines and tool labeling, costs, preventive maintenance...order fulfillment, computer scheduling versus Kanban , pull versus push systems, flow time efficiencies, back room costs of scheduling, MRP costs

The 1988 Inland Waterway Review

DTIC Science & Technology

1988-11-01

Maintenance Costs ............. 91 Table 4.3 Major Rehabilitation Projects: ............................... 92 Table 4.4 Scheduled Constructed Projects in the...Maintenance Costs .......................... 100 Figure 4.7 Operations and Maintenance Costs Per Ton Mile in 1986 For Inland Waterways Suspect to Fuel Tax...application of study and construction cost -sharing. It also increased waterway fuel taxes and created the Inland Waterways Users Board. In effect, the Act

Integrated Systems Health Management as an Enabler for Condition Based Maintenance and Autonomic Logistics

DTIC Science & Technology

2015-09-17

turbines , SHM tools, maintenance scheduling, and performance of the SHM system determine the added value of the system of systems (A. Van Horenbeek...J. R., & Pintelon, L. (2013). Quantifying the added value of an imperfectly performing condition monitoring system— Application to a wind turbine ...INTEGRATED SYSTEMS HEALTH MANAGEMENT AS AN ENABLER FOR CONDITION BASED MAINTENANCE AND AUTONOMIC

41 CFR 102-34.285 - Where can we obtain help in setting up a maintenance program?

Code of Federal Regulations, 2010 CFR

2010-07-01

... PROPERTY 34-MOTOR VEHICLE MANAGEMENT Scheduled Maintenance of Motor Vehicles § 102-34.285 Where can we... 41 Public Contracts and Property Management 3 2010-07-01 2010-07-01 false Where can we obtain help in setting up a maintenance program? 102-34.285 Section 102-34.285 Public Contracts and Property...

SUMO: operation and maintenance management web tool for astronomical observatories

NASA Astrophysics Data System (ADS)

Mujica-Alvarez, Emma; Pérez-Calpena, Ana; García-Vargas, María. Luisa

2014-08-01

SUMO is an Operation and Maintenance Management web tool, which allows managing the operation and maintenance activities and resources required for the exploitation of a complex facility. SUMO main capabilities are: information repository, assets and stock control, tasks scheduler, executed tasks archive, configuration and anomalies control and notification and users management. The information needed to operate and maintain the system must be initially stored at the tool database. SUMO shall automatically schedule the periodical tasks and facilitates the searching and programming of the non-periodical tasks. Tasks planning can be visualized in different formats and dynamically edited to be adjusted to the available resources, anomalies, dates and other constrains that can arise during daily operation. SUMO shall provide warnings to the users notifying potential conflicts related to the required personal availability or the spare stock for the scheduled tasks. To conclude, SUMO has been designed as a tool to help during the operation management of a scientific facility, and in particular an astronomical observatory. This is done by controlling all operating parameters: personal, assets, spare and supply stocks, tasks and time constrains.

Noncontingent reinforcement without extinction plus differential reinforcement of alternative behavior during treatment of problem behavior.

PubMed

Fritz, Jennifer N; Jackson, Lynsey M; Stiefler, Nicole A; Wimberly, Barbara S; Richardson, Amy R

2017-07-01

The effects of noncontingent reinforcement (NCR) without extinction during treatment of problem behavior maintained by social positive reinforcement were evaluated for five individuals diagnosed with autism spectrum disorder. A continuous NCR schedule was gradually thinned to a fixed-time 5-min schedule. If problem behavior increased during NCR schedule thinning, a continuous NCR schedule was reinstated and NCR schedule thinning was repeated with differential reinforcement of alternative behavior (DRA) included. Results showed an immediate decrease in all participants' problem behavior during continuous NCR, and problem behavior maintained at low levels during NCR schedule thinning for three participants. Problem behavior increased and maintained at higher rates during NCR schedule thinning for two other participants; however, the addition of DRA to the intervention resulted in decreased problem behavior and increased mands. © 2017 Society for the Experimental Analysis of Behavior.

A Location Analysis Approach for Military Maintenance Scheduling with Geographically Dispersed Service Areas

DTIC Science & Technology

2009-01-01

activities within the patrol area. Maintenance of the Minuteman III weapon system requires maintenance and security teams travel to one or more of 150...launch facilities, all of which are geograph- ically isolated from major population centers. Travel time from F. E. Warren AFB, the main support base...the F. E. Warren AFB work center to make travel preparations, and ends after all maintenance actions are completed, or once the team arrives at one

Job shop scheduling problem with late work criterion

NASA Astrophysics Data System (ADS)

Piroozfard, Hamed; Wong, Kuan Yew

2015-05-01

Scheduling is considered as a key task in many industries, such as project based scheduling, crew scheduling, flight scheduling, machine scheduling, etc. In the machine scheduling area, the job shop scheduling problems are considered to be important and highly complex, in which they are characterized as NP-hard. The job shop scheduling problems with late work criterion and non-preemptive jobs are addressed in this paper. Late work criterion is a fairly new objective function. It is a qualitative measure and concerns with late parts of the jobs, unlike classical objective functions that are quantitative measures. In this work, simulated annealing was presented to solve the scheduling problem. In addition, operation based representation was used to encode the solution, and a neighbourhood search structure was employed to search for the new solutions. The case studies are Lawrence instances that were taken from the Operations Research Library. Computational results of this probabilistic meta-heuristic algorithm were compared with a conventional genetic algorithm, and a conclusion was made based on the algorithm and problem.

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

NASA Technical Reports Server (NTRS)

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.

Maintenance of the Hanford cone penetrometer platform during fiscal year 1999

DOE Office of Scientific and Technical Information (OSTI.GOV)

IWATATE, D.F.

This SOW describes services requested of Applied Research and Associates, Inc. (ARA), as a commercial provider of cone penetrometer equipment and services, to provide routine inspection and minimum preventive maintenance on the Hanford CP Platform (CPP) during Fiscal Year 1999. This SOW specifically pertains to the maintenance of the CPP and associated support equipment and is limited in scope to routine preventive maintenance and identification of any deficiencies. ARA is the original manufacturer of the CPP and will conduct this work following the vendor-prepared maintenance schedule.

Research on Production Scheduling System with Bottleneck Based on Multi-agent

NASA Astrophysics Data System (ADS)

Zhenqiang, Bao; Weiye, Wang; Peng, Wang; Pan, Quanke

Aimed at the imbalance problem of resource capacity in Production Scheduling System, this paper uses Production Scheduling System based on multi-agent which has been constructed, and combines the dynamic and autonomous of Agent; the bottleneck problem in the scheduling is solved dynamically. Firstly, this paper uses Bottleneck Resource Agent to find out the bottleneck resource in the production line, analyses the inherent mechanism of bottleneck, and describes the production scheduling process based on bottleneck resource. Bottleneck Decomposition Agent harmonizes the relationship of job's arrival time and transfer time in Bottleneck Resource Agent and Non-Bottleneck Resource Agents, therefore, the dynamic scheduling problem is simplified as the single machine scheduling of each resource which takes part in the scheduling. Finally, the dynamic real-time scheduling problem is effectively solved in Production Scheduling System.

Proposed Rule and Related Materials for Heavy-Duty Highway Program: Revisions for Emergency Vehicles and SCR Maintenance

EPA Pesticide Factsheets

May 23, 2012, Notice of Proposed Rulemaking with revisions related to emissions controls on diesel-powered emergency vehicles and revisions related to scheduled maintenance intervals for diesel engines and vehicles using Selective Catalytic Reduction (SCR)

41 CFR 101-39.303 - Maintenance.

Code of Federal Regulations, 2011 CFR

2011-07-01

... MANAGEMENT SYSTEMS 39.3-Use and Care of GSA Interagency Fleet Management System Vehicles § 101-39.303...) vehicles, safety and preventive maintenance inspections will be performed at regularly scheduled intervals as directed by GSA. Users of GSA IFMS vehicles shall comply with the safety and preventive...

76 FR 477 - Airworthiness Directives; Bombardier, Inc. Model CL-600-2A12 (CL-601) and CL-600-2B16 (CL-601-3A...

Federal Register 2010, 2011, 2012, 2013, 2014

2011-01-05

... to these aircraft if Bombardier Service Bulletin (SB) 601-0590 [Scheduled Maintenance Instructions... information: Challenger 601 Time Limits/Maintenance Checks, PSP 601-5, Revision 38, dated June 19, 2009. Challenger 601 Time Limits/Maintenance Checks, PSP 601A-5, Revision 34, dated June 19, 2009. Challenger 604...

Completable scheduling: An integrated approach to planning and scheduling

NASA Technical Reports Server (NTRS)

Gervasio, Melinda T.; Dejong, Gerald F.

1992-01-01

The planning problem has traditionally been treated separately from the scheduling problem. However, as more realistic domains are tackled, it becomes evident that the problem of deciding on an ordered set of tasks to achieve a set of goals cannot be treated independently of the problem of actually allocating resources to the tasks. Doing so would result in losing the robustness and flexibility needed to deal with imperfectly modeled domains. Completable scheduling is an approach which integrates the two problems by allowing an a priori planning module to defer particular planning decisions, and consequently the associated scheduling decisions, until execution time. This allows a completable scheduling system to maximize plan flexibility by allowing runtime information to be taken into consideration when making planning and scheduling decision. Furthermore, through the criteria of achievability placed on deferred decision, a completable scheduling system is able to retain much of the goal-directedness and guarantees of achievement afforded by a priori planning. The completable scheduling approach is further enhanced by the use of contingent explanation-based learning, which enables a completable scheduling system to learn general completable plans from example and improve its performance through experience. Initial experimental results show that completable scheduling outperforms classical scheduling as well as pure reactive scheduling in a simple scheduling domain.

Health Information Sources, Perceived Vaccination Benefits, and Maintenance of Childhood Vaccination Schedules.

PubMed

Hwang, Juwon; Shah, Dhavan V

2018-06-05

Parental concerns over the safety or necessity of childhood vaccination have increased over the past decades. At the same time, there has been a proliferation of vaccine-related information available through a range of health information sources. This study investigates the associations between evaluations of health information sources, parental perceptions of childhood vaccination benefits, and the maintenance of vaccination schedules for their children. Specifically, this study aims to (a) incorporate social media into the battery of health information sources and (b) differentiate households with a childhood autism diagnosis and those without, given unsubstantiated but persistent concerns about vaccine safety and autism. Analyzing a sample of U.S. households, a total of 4,174 parents who have at least one child under the age of 18 were analyzed, including 138 of parents of households with a childhood autism diagnosis. Results show that the more the parents value interpersonal communication and magazines as sources of health information, the more they perceive vaccination benefits, and the more the value they put on television, the better they keep vaccination schedules up-to-date for their children. On the other hand, social media are negatively associated with their perceptions of vaccination benefits. Although parents of children diagnosed with autism are less likely to perceive vaccination benefits, no interaction effects with evaluations of health information sources are found on parental perceptions of vaccination benefits or maintenance of schedules.

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

NASA Astrophysics Data System (ADS)

Buchner, Johannes

2011-12-01

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

Development of standardized component\\0x2010based equipment specifications and transition plan into a predictive maintenance strategy.

DOT National Transportation Integrated Search

2015-12-01

This project investigated INDOT equipment records and equipment industry standards to produce standard equipment specifications : and a predictive maintenance schedule for the more than 1100 single and tandem axle trucks in use at INDOT. The research...

Optimizing work zones for highway maintenance with floating car data (FCD) : final report.

DOT National Transportation Integrated Search

2015-12-01

One of the main tools that the Department of Transportation (DOT) of each state in the United States should have to : support their work zone activities is a sound model that produces adequate work zone schedules for roadway maintenance : and constru...

78 FR 46615 - Records Schedules; Availability and Request for Comments

Federal Register 2010, 2011, 2012, 2013, 2014

2013-08-01

... process is available on request. Schedules Pending 1. Department of Defense, Defense Contract Management... officials. 2. Department of Defense, Defense Contract Management Agency (N1- 558-10-6, 6 items, 6 temporary... related to the production and maintenance of such records. 3. Department of Defense, Defense Logistics...

78 FR 66266 - Drawbridge Operation Regulation; Atlantic Intracoastal Waterway (AIWW), Chesapeake, VA

Federal Register 2010, 2011, 2012, 2013, 2014

2013-11-05

... deviation from the operating schedule that governs the I64 Bridge across the Atlantic Intracoastal Waterway... deviation, call or email Mrs. Kashanda Booker, Bridge Administration Branch Fifth District, Coast Guard... maintenance of the moveable spans on the structure. The current operating schedule for the drawbridge is set...

Maintenance and operations tasks accomplished at DSS 12 during the antenna panel replacement downtime

NASA Technical Reports Server (NTRS)

Butcher, L.; Jonas, T.; Wood, W.

1982-01-01

The heavy schedule of tracking activities at the Echo Deep Space Station (DSS 12) prevents some time-consuming maintenance tasks from being performed. Careful coordination prior to and during a mandatory task (antenna panel replacement) made it possible to do a large number of unrelated tasks that ordinarily would have to be deferred. The maintenance and operations tasks accomplished during the downtime are described.

An Optimization Model for Scheduling Problems with Two-Dimensional Spatial Resource Constraint

NASA Technical Reports Server (NTRS)

Garcia, Christopher; Rabadi, Ghaith

2010-01-01

Traditional scheduling problems involve determining temporal assignments for a set of jobs in order to optimize some objective. Some scheduling problems also require the use of limited resources, which adds another dimension of complexity. In this paper we introduce a spatial resource-constrained scheduling problem that can arise in assembly, warehousing, cross-docking, inventory management, and other areas of logistics and supply chain management. This scheduling problem involves a twodimensional rectangular area as a limited resource. Each job, in addition to having temporal requirements, has a width and a height and utilizes a certain amount of space inside the area. We propose an optimization model for scheduling the jobs while respecting all temporal and spatial constraints.

Development of standardized component\\0x2010based equipment specifications and transition plan into a predictive maintenance strategy : final report.

DOT National Transportation Integrated Search

2015-12-01

This project investigated INDOT equipment records and equipment industry standards to produce standard equipment specifications : and a predictive maintenance schedule for the more than 1100 single and tandem axle trucks in use at INDOT. The research...

14 CFR Sec. 19-2 - Maintenance of data.

Code of Federal Regulations, 2013 CFR

2013-01-01

... Classifications Sec. 19-2 Maintenance of data. (a) Each air carrier required to file Form 41 Schedule T-100 data... classifications prescribed. Codes are prescribed for each operating element and service class. All traffic... that the enplanement/deplanement information be broken out into separate units called “on-flight market...

14 CFR Sec. 19-2 - Maintenance of data.

Code of Federal Regulations, 2014 CFR

2014-01-01

... Classifications Sec. 19-2 Maintenance of data. (a) Each air carrier required to file Form 41 Schedule T-100 data... classifications prescribed. Codes are prescribed for each operating element and service class. All traffic... that the enplanement/deplanement information be broken out into separate units called “on-flight market...

40 CFR 205.162-3 - Instructions for maintenance, use, and repair.

Code of Federal Regulations, 2013 CFR

2013-07-01

...) NOISE ABATEMENT PROGRAMS TRANSPORTATION EQUIPMENT NOISE EMISSION CONTROLS Motorcycles § 205.162-3... this purpose in mind. The instructions shall be clear and, to the extent practicable, written in non... contain a schedule for the performance of all required noise emission control maintenance. Space must be...

40 CFR 205.162-3 - Instructions for maintenance, use, and repair.

Code of Federal Regulations, 2014 CFR

2014-07-01

...) NOISE ABATEMENT PROGRAMS TRANSPORTATION EQUIPMENT NOISE EMISSION CONTROLS Motorcycles § 205.162-3... this purpose in mind. The instructions shall be clear and, to the extent practicable, written in non... contain a schedule for the performance of all required noise emission control maintenance. Space must be...

40 CFR 205.162-3 - Instructions for maintenance, use, and repair.

Code of Federal Regulations, 2012 CFR

2012-07-01

...) NOISE ABATEMENT PROGRAMS TRANSPORTATION EQUIPMENT NOISE EMISSION CONTROLS Motorcycles § 205.162-3... this purpose in mind. The instructions shall be clear and, to the extent practicable, written in non... contain a schedule for the performance of all required noise emission control maintenance. Space must be...

40 CFR 205.162-3 - Instructions for maintenance, use, and repair.

Code of Federal Regulations, 2011 CFR

2011-07-01

...) NOISE ABATEMENT PROGRAMS TRANSPORTATION EQUIPMENT NOISE EMISSION CONTROLS Motorcycles § 205.162-3... this purpose in mind. The instructions shall be clear and, to the extent practicable, written in non... contain a schedule for the performance of all required noise emission control maintenance. Space must be...

An Implicit Enumeration Algorithm with Binary-Valued Constraints.

DTIC Science & Technology

1986-03-01

problems is the National Basketball Association ( NBA -) schedul- ing problems developed by Bean (1980), as discussed in detail in the Appendix. These...fY! X F L- %n~ P ’ % -C-10 K7 K: K7 -L- -7".i - W. , W V APPENDIX The NBA Scheduling Problem §A.1 Formulation The National Basketball Association...16 2.2 4.9 40.2 15.14 §6.2.3 NBA Scheduling Problem The last set of testing problems involves the NBA scheduling problem. A detailed description of

Optimized PID control of depth of hypnosis in anesthesia.

PubMed

Padula, Fabrizio; Ionescu, Clara; Latronico, Nicola; Paltenghi, Massimiliano; Visioli, Antonio; Vivacqua, Giulio

2017-06-01

This paper addresses the use of proportional-integral-derivative controllers for regulating the depth of hypnosis in anesthesia by using propofol administration and the bispectral index as a controlled variable. In fact, introducing an automatic control system might provide significant benefits for the patient in reducing the risk for under- and over-dosing. In this study, the controller parameters are obtained through genetic algorithms by solving a min-max optimization problem. A set of 12 patient models representative of a large population variance is used to test controller robustness. The worst-case performance in the considered population is minimized considering two different scenarios: the induction case and the maintenance case. Our results indicate that including a gain scheduling strategy enables optimal performance for induction and maintenance phases, separately. Using a single tuning to address both tasks may results in a loss of performance up to 102% in the induction phase and up to 31% in the maintenance phase. Further on, it is shown that a suitably designed low-pass filter on the controller output can handle the trade-off between the performance and the noise effect in the control variable. Optimally tuned PID controllers provide a fast induction time with an acceptable overshoot and a satisfactory disturbance rejection performance during maintenance. These features make them a very good tool for comparison when other control algorithms are developed. Copyright © 2017 Elsevier B.V. All rights reserved.

Performance comparison of some evolutionary algorithms on job shop scheduling problems

NASA Astrophysics Data System (ADS)

Mishra, S. K.; Rao, C. S. P.

2016-09-01

Job Shop Scheduling as a state space search problem belonging to NP-hard category due to its complexity and combinational explosion of states. Several naturally inspire evolutionary methods have been developed to solve Job Shop Scheduling Problems. In this paper the evolutionary methods namely Particles Swarm Optimization, Artificial Intelligence, Invasive Weed Optimization, Bacterial Foraging Optimization, Music Based Harmony Search Algorithms are applied and find tuned to model and solve Job Shop Scheduling Problems. To compare about 250 Bench Mark instances have been used to evaluate the performance of these algorithms. The capabilities of each these algorithms in solving Job Shop Scheduling Problems are outlined.

Oral drug self-administration: an overview of laboratory animal studies.

PubMed

Meisch, R A

2001-06-01

Many abused drugs can be established as orally delivered reinforcers for rhesus monkeys and other animals. Benzodiazepines, barbiturates, opioids, psychomotor stimulants, dissociative anesthetics, and ethanol can come to serve as reinforcers when taken by mouth. The principal problems in establishing drugs as reinforcers by the oral route of administration are (1) aversive taste, (2) delay in onset of central nervous system effects, and (3) consumption of low volumes of drug solution. Strategies have been devised to successfully overcome these problems, and orally delivered drugs can be established as effective reinforcers. Reinforcing actions are demonstrated by consumption of greater volumes of drug solution than volumes of the water vehicle, and supporting evidence for reinforcing effects consists of the maintenance of behavior under intermittent schedules of reinforcement and the generation of orderly dose-response functions. This article presents an overview of studies of behavior reinforced by oral drug reinforcement. Factors that control oral drug intake include dose, schedule of reinforcement, food restriction, and alternative reinforcers. Many drugs, administered by the experimenter, can alter oral drug reinforcement. Relative reinforcing effects can be assessed by choice procedures and by persistence of behavior across increases in schedule size. In general, reinforcing effects increase directly with dose. Rhesus monkeys prefer combinations of reinforcing drugs to the component drugs. The taste of drug solutions may act as a conditioned reinforcer and a discriminative stimulus. Consequences of drug intake include tolerance and physiological dependence. Findings with orally self-administered drugs are similar to many findings with other positive reinforcers, including intravenously self-administered drugs.

7 CFR 1580.502 - Maintenance of records, audits and compliance.

Code of Federal Regulations, 2010 CFR

2010-01-01

... Internal Revenue Service Form 990-C, Farmers' Cooperative Association Income Tax Return; Form 1040, U.S. Individual Income Tax Return; Schedule C (Form 1040), Profit or Loss From Business; Schedule F (Form 1040... Income Tax Return; or Form 4835, Farm Rental Income and Expenses. (b) At all times during regular...

49 CFR 214.531 - Schedule of repairs; general.

Code of Federal Regulations, 2010 CFR

2010-10-01

... Hi-Rail Vehicles § 214.531 Schedule of repairs; general. Except as provided in §§ 214.527(c)(5), 214.529, and 214.533, an on-track roadway maintenance machine or hi-rail vehicle that does not meet all... or hi-rail vehicle shall be placed out of on-track service. ...

Logistics Management: Cases Studies,

DTIC Science & Technology

LOGISTICS , * MANAGEMENT PLANNING AND CONTROL), DECISION MAKING, INVENTORY CONTROL, SPARE PARTS, AIR FORCE EQUIPMENT, NAVAL AIRCRAFT, MAINTENANCE, DEPLOYMENT, SCHEDULING, SYSTEMS ENGINEERING, TEXTBOOKS

Compiling Planning into Scheduling: A Sketch

NASA Technical Reports Server (NTRS)

Bedrax-Weiss, Tania; Crawford, James M.; Smith, David E.

2004-01-01

Although there are many approaches for compiling a planning problem into a static CSP or a scheduling problem, current approaches essentially preserve the structure of the planning problem in the encoding. In this pape: we present a fundamentally different encoding that more accurately resembles a scheduling problem. We sketch the approach and argue, based on an example, that it is possible to automate the generation of such an encoding for problems with certain properties and thus produce a compiler of planning into scheduling problems. Furthermore we argue that many NASA problems exhibit these properties and that such a compiler would provide benefits to both theory and practice.

The most common problem facing by the maintenance department: A case Study between Universiti Tun Hussein Onn Malaysia (UTHM) and Universiti Teknologi Malaysia (UTM)

NASA Astrophysics Data System (ADS)

Norazam Yasin, Mohd; Mohamad Zin, Rosli; Halid Abdullah, Abd; Shafiq Mahmad, Muhammad; Fikri Hasmori, Muhammad

2017-11-01

From time to time, the maintenance works become more challenging due to construction of new building and also aging of the existing buildings. University buildings without any exception require proper maintenance services to support their function requirements and this can be considered as major responsibilities to be fulfilled by the maintenance department in the universities. Maintenance department specifically will face various kinds of problems in their operation works and thus this might influence the maintenance work operations itself. This study purposely to identify the common problem facing by the maintenance department and also to examine the current status of the maintenance department. In addition, this study would also propose any suitable approach that could be implemented to overcome the problem facing by the maintenance department. To achieve the objectives of this study, a combination of deep literature study and carrying out a survey is necessary. Literature study aimed to obtain deeper information about this study, meanwhile a survey aimed at identifying the common problem facing by the maintenance department and also to provide the information of the maintenance department’s organization. Several methods will be used in analyzing the data obtained through the survey, including Microsoft Office Excel and also using mean index formula. This study has identified three categories of problem in the maintenance department, which are management problems, human resource problem, and technical problems. Following the findings, several solutions being proposed which can be implemented as the solution to the problem facing. These suggestions have the potential to improve the maintenance department work efficiency, thus could help to increase the department productivity.

117. ARAI Shop and maintenance (ARA627) building roof and floor ...

Library of Congress Historic Buildings Survey, Historic Engineering Record, Historic Landscapes Survey

117. ARA-I Shop and maintenance (ARA-627) building roof and floor plan. Includes room finish and equipment schedule. Norman Engineering Company 961-area/SF-627-A-1. Date: January 1959. Ineel index code no. 068-0627-00-613-102759. - Idaho National Engineering Laboratory, Army Reactors Experimental Area, Scoville, Butte County, ID

Administration of Maintenance and Operations in California School Districts: A Handbook for School Administrators and Governing Boards.

ERIC Educational Resources Information Center

California State Dept. of Education, Sacramento.

This handbook provides information that administrators of maintenance and operations in California schools can use in systematically planning and scheduling school facility support services. The first unit, chapter 1, is designed to help members of school district governing boards establish board policies, regulations, and procedures. Topics…

75 FR 80471 - Takes of Marine Mammals Incidental to Specified Activities; St. George Reef Light Station...

Federal Register 2010, 2011, 2012, 2013, 2014

2010-12-22

... maintenance activities. SGRLPS proposes to transport visitors to the Station during the Sunday work window... two times per year within the proposed work window. Scheduled light maintenance activities would... light. For each emergency repair event, the SGRLPS proposes to conduct a maximum of four flights (two...

40 CFR 53.4 - Applications for reference or equivalent method determinations.

Code of Federal Regulations, 2013 CFR

2013-07-01

...) Required or recommended routine, periodic, and preventative maintenance and maintenance schedules. (J) Any... methods for PM 2.5 and PM 10-2,5 must be described in sufficient detail, based on the elements described... Table A-1 to this subpart) will be met throughout the warranty period and that the applicant accepts...

40 CFR 53.4 - Applications for reference or equivalent method determinations.

Code of Federal Regulations, 2014 CFR

2014-07-01

...) Required or recommended routine, periodic, and preventative maintenance and maintenance schedules. (J) Any... methods for PM 2.5 and PM 10-2.5 must be described in sufficient detail, based on the elements described... Table A-1 to this subpart) will be met throughout the warranty period and that the applicant accepts...

Bridging the Gap Between Planning and Scheduling

NASA Technical Reports Server (NTRS)

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

2000-01-01

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

Interactive computer aided shift scheduling.

PubMed

Gaertner, J

2001-12-01

This paper starts with a discussion of computer aided shift scheduling. After a brief review of earlier approaches, two conceptualizations of this field are introduced: First, shift scheduling as a field that ranges from extremely stable rosters at one pole to rather market-like approaches on the other pole. Unfortunately, already small alterations of a scheduling problem (e.g., the number of groups, the number of shifts) may call for rather different approaches and tools. Second, their environment shapes scheduling problems and scheduling has to be done within idiosyncratic organizational settings. This calls for the amalgamation of scheduling with other tasks (e.g., accounting) and for reflections whether better solutions might become possible by changes in the problem definition (e.g., other service levels, organizational changes). Therefore shift scheduling should be understood as a highly connected problem. Building upon these two conceptualizations, a few examples of software that ease scheduling in some areas of this field are given and future research questions are outlined.

Optimal recombination in genetic algorithms for flowshop scheduling problems

NASA Astrophysics Data System (ADS)

Kovalenko, Julia

2016-10-01

The optimal recombination problem consists in finding the best possible offspring as a result of a recombination operator in a genetic algorithm, given two parent solutions. We prove NP-hardness of the optimal recombination for various variants of the flowshop scheduling problem with makespan criterion and criterion of maximum lateness. An algorithm for solving the optimal recombination problem for permutation flowshop problems is built, using enumeration of prefect matchings in a special bipartite graph. The algorithm is adopted for the classical flowshop scheduling problem and for the no-wait flowshop problem. It is shown that the optimal recombination problem for the permutation flowshop scheduling problem is solvable in polynomial time for almost all pairs of parent solutions as the number of jobs tends to infinity.

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

NASA Technical Reports Server (NTRS)

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.

Comparison of an alternative schedule of extended care contacts to a self-directed control: a randomized trial of weight loss maintenance.

PubMed

Dutton, Gareth R; Gowey, Marissa A; Tan, Fei; Zhou, Dali; Ard, Jamy; Perri, Michael G; Lewis, Cora E

2017-08-15

Behavioral interventions for obesity produce clinically meaningful weight loss, but weight regain following treatment is common. Extended care programs attenuate weight regain and improve weight loss maintenance. However, less is known about the most effective ways to deliver extended care, including contact schedules. We compared the 12-month weight regain of an extended care program utilizing a non-conventional, clustered campaign treatment schedule and a self-directed program among individuals who previously achieved ≥5% weight reductions. Participants (N = 108; mean age = 51.6 years; mean weight = 92.6 kg; 52% African American; 95% female) who achieved ≥5% weight loss during an initial 16-week behavioral obesity treatment were randomized into a 2-arm, 12-month extended care trial. A clustered campaign condition included 12 group-based visits delivered in three, 4-week clusters. A self-directed condition included provision of the same printed intervention materials but no additional treatment visits. The study was conducted in a U.S. academic medical center from 2011 to 2015. Prior to randomization, participants lost an average of -7.55 ± 3.04 kg. Participants randomized to the 12-month clustered campaign program regained significantly less weight (0.35 ± 4.62 kg) than self-directed participants (2.40 ± 3.99 kg), which represented a significant between-group difference of 2.28 kg (p = 0.0154) after covariate adjustments. This corresponded to maintaining 87% and 64% of lost weight in the clustered campaign and self-directed conditions, respectively, which was a significant between-group difference of 29% maintenance of lost weight after covariate adjustments, p = 0.0396. In this initial test of a clustered campaign treatment schedule, this novel approach effectively promoted 12-month maintenance of lost weight. Future trials should directly compare the clustered campaigns with conventional (e.g., monthly) extended care schedules. Clinicaltrials.gov NCT02487121 . Registered 06/26/2015 (retrospectively registered).

Applications of dynamic scheduling technique to space related problems: Some case studies

NASA Astrophysics Data System (ADS)

Nakasuka, Shinichi; Ninomiya, Tetsujiro

1994-10-01

The paper discusses the applications of 'Dynamic Scheduling' technique, which has been invented for the scheduling of Flexible Manufacturing System, to two space related scheduling problems: operation scheduling of a future space transportation system, and resource allocation in a space system with limited resources such as space station or space shuttle.

Influence of titration schedule and maintenance dose on the tolerability of adjunctive eslicarbazepine acetate: An integrated analysis of three randomized placebo-controlled trials.

PubMed

Krauss, Gregory; Biton, Victor; Harvey, Jay H; Elger, Christian; Trinka, Eugen; Soares da Silva, Patrício; Gama, Helena; Cheng, Hailong; Grinnell, Todd; Blum, David

2018-01-01

To examine the influence of titration schedule and maintenance dose on the incidence and type of treatment-emergent adverse events (TEAEs) associated with adjunctive eslicarbazepine acetate (ESL). Data from three randomized, double-blind, placebo-controlled trials were analyzed. Patients with refractory partial-onset seizures were randomized to maintenance doses of ESL 400, 800, or 1200mg QD (dosing was initiated at 400 or 800mg QD) or placebo. The incidence of TEAEs was analyzed during the double-blind period (2-week titration phase; 12-week maintenance phase), according to the randomized maintenance dose and the titration schedule. 1447 patients were included in the analysis. During the first week of treatment, 62% of patients taking ESL 800mg QD had ≥1 TEAE, vs 35% of those taking 400mg QD and 32% of the placebo group; dizziness, somnolence, nausea, and headache were numerically more frequent in patients taking ESL 800mg than those taking ESL 400mg QD. During the double-blind period, the incidences of common TEAEs were lower in patients who initiated ESL at 400mg vs 800mg QD. For the 800 and 1200mg QD maintenance doses, rates of TEAEs leading to discontinuation were lower in patients who began treatment with 400mg than in those who began taking ESL 800mg QD. Initiation of ESL at 800mg QD is feasible. However, initiating treatment with ESL 400mg QD for 1 or 2 weeks is recommended, being associated with a lower incidence of TEAEs, and related discontinuations. For some patients, treatment may be initiated at 800mg QD, if the need for more immediate seizure reduction outweighs concerns about increased risk of adverse reactions during initiation. Copyright © 2017 The Authors. Published by Elsevier B.V. All rights reserved.

The impact of roster changes on absenteeism and incident frequency in an Australian coal mine

PubMed Central

Baker, A; Heiler, K; Ferguson, S

2003-01-01

Background: The occupational health and safety implications associated with compressed and extended work periods have not been fully explored in the mining sector. Aims: To examine the impact on employee health and safety of changes to the roster system in an Australian coal mine. Methods: Absenteeism and incident frequency rate data were collected over a 33 month period that covered three different roster schedules. Period 1 covered the original 8-hour/7-day roster. Period 2 covered a 12-month period under a 12-hour/7-day schedule, and period 3 covered a 12-month period during which a roster that scheduled shifts only on weekdays, with uncapped overtime on weekends and days off (12-hour/5-day) was in place. Data were collected and analysed from the maintenance, mining, and coal preparation plant (CPP) sectors. Results: The only significant change in absenteeism rates was an increase in the maintenance sector in the third data collection period. Absenteeism rates in the mining and CPP sectors were not different between data collection periods. The increase in the maintenance sector may be owing to: (1) a greater requirement for maintenance employees to perform overtime as a result of the roster change compared to other employee groups; or (2) greater monotony associated with extended work periods for maintenance employees compared to others. After the first roster change, accident incident frequency decreased in the CPP sector but not in the other sectors. There was no effect on incident frequency after the second roster change in any sector. Conclusions: The current study did not find significant negative effects of a 12-hour pattern, when compared to an 8-hour system. However, when unregulated and excessive overtime was introduced as part of the 12-hour/5-day roster, absenteeism rates were increased in the maintenance sector. The combination of excessive work hours and lack of consultation with employees regarding the second change may have contributed to the overall negative effects. PMID:12499456

Solving a real-world problem using an evolving heuristically driven schedule builder.

PubMed

Hart, E; Ross, P; Nelson, J

1998-01-01

This work addresses the real-life scheduling problem of a Scottish company that must produce daily schedules for the catching and transportation of large numbers of live chickens. The problem is complex and highly constrained. We show that it can be successfully solved by division into two subproblems and solving each using a separate genetic algorithm (GA). We address the problem of whether this produces locally optimal solutions and how to overcome this. We extend the traditional approach of evolving a "permutation + schedule builder" by concentrating on evolving the schedule builder itself. This results in a unique schedule builder being built for each daily scheduling problem, each individually tailored to deal with the particular features of that problem. This results in a robust, fast, and flexible system that can cope with most of the circumstances imaginable at the factory. We also compare the performance of a GA approach to several other evolutionary methods and show that population-based methods are superior to both hill-climbing and simulated annealing in the quality of solutions produced. Population-based methods also have the distinct advantage of producing multiple, equally fit solutions, which is of particular importance when considering the practical aspects of the problem.

Testing Task Schedulers on Linux System

NASA Astrophysics Data System (ADS)

Jelenković, Leonardo; Groš, Stjepan; Jakobović, Domagoj

Testing task schedulers on Linux operating system proves to be a challenging task. There are two main problems. The first one is to identify which properties of the scheduler to test. The second problem is how to perform it, e.g., which API to use that is sufficiently precise and in the same time supported on most platforms. This paper discusses the problems in realizing test framework for testing task schedulers and presents one potential solution. Observed behavior of the scheduler is the one used for “normal” task scheduling (SCHED_OTHER), unlike one used for real-time tasks (SCHED_FIFO, SCHED_RR).

The Composition of the Master Schedule

NASA Technical Reports Server (NTRS)

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

2010-01-01

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

Discrete Bat Algorithm for Optimal Problem of Permutation Flow Shop Scheduling

PubMed Central

Luo, Qifang; Zhou, Yongquan; Xie, Jian; Ma, Mingzhi; Li, Liangliang

2014-01-01

A discrete bat algorithm (DBA) is proposed for optimal permutation flow shop scheduling problem (PFSP). Firstly, the discrete bat algorithm is constructed based on the idea of basic bat algorithm, which divide whole scheduling problem into many subscheduling problems and then NEH heuristic be introduced to solve subscheduling problem. Secondly, some subsequences are operated with certain probability in the pulse emission and loudness phases. An intensive virtual population neighborhood search is integrated into the discrete bat algorithm to further improve the performance. Finally, the experimental results show the suitability and efficiency of the present discrete bat algorithm for optimal permutation flow shop scheduling problem. PMID:25243220

Discrete bat algorithm for optimal problem of permutation flow shop scheduling.

PubMed

Luo, Qifang; Zhou, Yongquan; Xie, Jian; Ma, Mingzhi; Li, Liangliang

2014-01-01

A discrete bat algorithm (DBA) is proposed for optimal permutation flow shop scheduling problem (PFSP). Firstly, the discrete bat algorithm is constructed based on the idea of basic bat algorithm, which divide whole scheduling problem into many subscheduling problems and then NEH heuristic be introduced to solve subscheduling problem. Secondly, some subsequences are operated with certain probability in the pulse emission and loudness phases. An intensive virtual population neighborhood search is integrated into the discrete bat algorithm to further improve the performance. Finally, the experimental results show the suitability and efficiency of the present discrete bat algorithm for optimal permutation flow shop scheduling problem.

Energy management system optimization for on-site facility staff - a case history of the New York State Office of Mental Health

DOE Office of Scientific and Technical Information (OSTI.GOV)

Bagdon, M.J.; Martin, P.J.

1997-06-01

In 1994, Novus Engineering and EME Group began a project for the New York State Office of Mental Health (OMH) to maximize the use and benefit of energy management systems (EMS) installed at various large psychiatric hospitals throughout New York State. The project, which was funded and managed by the Dormitory Authority of the State of New York (DASNY), had three major objectives: (1) Maximize Energy Savings - Novus staff quickly learned that EMS systems as set up by contractors are far from optimal for generating energy savings. This part of the program revealed numerous opportunities for increased energy savings,more » such as: fine tuning proportional/integral/derivative (PID) loops to eliminate valve and damper hunting; adjusting temperature reset schedules to reduce energy consumption and provide more uniform temperature conditions throughout the facilities; and modifying equipment schedules. (2) Develop Monitoring Protocols - Large EMS systems are so complex that they require a systematic approach to daily, monthly and seasonal monitoring of building system conditions in order to locate system problems before they turn into trouble calls or equipment failures. In order to assist local facility staff in their monitoring efforts, Novus prepared user-friendly handbooks on each EMS. These included monitoring protocols tailored to each facility. (3) Provide Staff Training - When a new EMS is installed at a facility, it is frequently the maintenance staffs first exposure to a complex computerized system. Without proper training in what to look for, staff use of the EMS is generally very limited. With proper training, staff can be taught to take a pro-active approach to identify and solve problems before they get out of hand. The staff then realize that the EMS is a powerful preventative maintenance tool that can be used to make their work more effective and efficient. Case histories are presented.« less

A Comparison of Techniques for Scheduling Fleets of Earth-Observing Satellites

NASA Technical Reports Server (NTRS)

Globus, Al; Crawford, James; Lohn, Jason; Pryor, Anna

2003-01-01

Earth observing satellite (EOS) scheduling is a complex real-world domain representative of a broad class of over-subscription scheduling problems. Over-subscription problems are those where requests for a facility exceed its capacity. These problems arise in a wide variety of NASA and terrestrial domains and are .XI important class of scheduling problems because such facilities often represent large capital investments. We have run experiments comparing multiple variants of the genetic algorithm, hill climbing, simulated annealing, squeaky wheel optimization and iterated sampling on two variants of a realistically-sized model of the EOS scheduling problem. These are implemented as permutation-based methods; methods that search in the space of priority orderings of observation requests and evaluate each permutation by using it to drive a greedy scheduler. Simulated annealing performs best and random mutation operators outperform our squeaky (more intelligent) operator. Furthermore, taking smaller steps towards the end of the search improves performance.

Aspects of job scheduling

NASA Technical Reports Server (NTRS)

Phillips, K.

1976-01-01

A mathematical model for job scheduling in a specified context is presented. The model uses both linear programming and combinatorial methods. While designed with a view toward optimization of scheduling of facility and plant operations at the Deep Space Communications Complex, the context is sufficiently general to be widely applicable. The general scheduling problem including options for scheduling objectives is discussed and fundamental parameters identified. Mathematical algorithms for partitioning problems germane to scheduling are presented.

Effective chemotherapy of heterogeneous and drug-resistant early colon cancers by intermittent dose schedules: a computer simulation study.

PubMed

Axelrod, David E; Vedula, Sudeepti; Obaniyi, James

2017-05-01

The effectiveness of cancer chemotherapy is limited by intra-tumor heterogeneity, the emergence of spontaneous and induced drug-resistant mutant subclones, and the maximum dose to which normal tissues can be exposed without adverse side effects. The goal of this project was to determine if intermittent schedules of the maximum dose that allows colon crypt maintenance could overcome these limitations, specifically by eliminating mixtures of drug-resistant mutants from heterogeneous early colon adenomas while maintaining colon crypt function. A computer model of cell dynamics in human colon crypts was calibrated with measurements of human biopsy specimens. The model allowed simulation of continuous and intermittent dose schedules of a cytotoxic chemotherapeutic drug, as well as the drug's effect on the elimination of mutant cells and the maintenance of crypt function. Colon crypts can tolerate a tenfold greater intermittent dose than constant dose. This allows elimination of a mixture of relatively drug-sensitive and drug-resistant mutant subclones from heterogeneous colon crypts. Mutants can be eliminated whether they arise spontaneously or are induced by the cytotoxic drug. An intermittent dose, at the maximum that allows colon crypt maintenance, can be effective in eliminating a heterogeneous mixture of mutant subclones before they fill the crypt and form an adenoma.

14 CFR 121.343 - Flight data recorders.

Code of Federal Regulations, 2011 CFR

2011-01-01

... recorder must be installed at the next heavy maintenance check after May 26, 1994, but no later than May 26, 1995. A heavy maintenance check is considered to be any time an aircraft is scheduled to be out of..., 1995, compliance date for all aircraft on that list. (3) After May 26, 1994, any aircraft that is...

14 CFR 121.343 - Flight data recorders.

Code of Federal Regulations, 2012 CFR

2012-01-01

... recorder must be installed at the next heavy maintenance check after May 26, 1994, but no later than May 26, 1995. A heavy maintenance check is considered to be any time an aircraft is scheduled to be out of..., 1995, compliance date for all aircraft on that list. (3) After May 26, 1994, any aircraft that is...

14 CFR 121.343 - Flight data recorders.

Code of Federal Regulations, 2013 CFR

2013-01-01

... recorder must be installed at the next heavy maintenance check after May 26, 1994, but no later than May 26, 1995. A heavy maintenance check is considered to be any time an aircraft is scheduled to be out of..., 1995, compliance date for all aircraft on that list. (3) After May 26, 1994, any aircraft that is...

14 CFR 121.343 - Flight data recorders.

Code of Federal Regulations, 2010 CFR

2010-01-01

... recorder must be installed at the next heavy maintenance check after May 26, 1994, but no later than May 26, 1995. A heavy maintenance check is considered to be any time an aircraft is scheduled to be out of..., 1995, compliance date for all aircraft on that list. (3) After May 26, 1994, any aircraft that is...

14 CFR 121.343 - Flight data recorders.

Code of Federal Regulations, 2014 CFR

2014-01-01

... recorder must be installed at the next heavy maintenance check after May 26, 1994, but no later than May 26, 1995. A heavy maintenance check is considered to be any time an aircraft is scheduled to be out of..., 1995, compliance date for all aircraft on that list. (3) After May 26, 1994, any aircraft that is...

40 CFR 53.4 - Applications for reference or equivalent method determinations.

Code of Federal Regulations, 2012 CFR

2012-07-01

...) Required or recommended routine, periodic, and preventative maintenance and maintenance schedules. (J) Any... methods for PM2.5 and PM10−2.5 must be described in sufficient detail, based on the elements described in... Table A-1 to this subpart) will be met throughout the warranty period and that the applicant accepts...

40 CFR 53.4 - Applications for reference or equivalent method determinations.

Code of Federal Regulations, 2011 CFR

2011-07-01

...) Required or recommended routine, periodic, and preventative maintenance and maintenance schedules. (J) Any... methods for PM2.5 and PM10−2.5 must be described in sufficient detail, based on the elements described in... Table A-1 to this subpart) will be met throughout the warranty period and that the applicant accepts...

User requirements for a patient scheduling system

NASA Technical Reports Server (NTRS)

Zimmerman, W.

1979-01-01

A rehabilitation institute's needs and wants from a scheduling system were established by (1) studying the existing scheduling system and the variables that affect patient scheduling, (2) conducting a human-factors study to establish the human interfaces that affect patients' meeting prescribed therapy schedules, and (3) developing and administering a questionnaire to the staff which pertains to the various interface problems in order to identify staff requirements to minimize scheduling problems and other factors that may limit the effectiveness of any new scheduling system.

How to maintain chain drives

DOE Office of Scientific and Technical Information (OSTI.GOV)

Wright, J.L.

1992-06-18

Properly selected and maintained chain drives can be expected to give thousands of hours of reliable service. Selection is usually done just once. This paper reports on good maintenance which must be done regularly to keep the drive operating. An effective maintenance program for roller chain should include correct type and adequate amounts of lubrication, replacement of worn chains and sprockets, and elimination of drive interferences. It is important to set u a lubrication and inspection/correction schedule to ensure that all required maintenance is carried out.

Diagnostics of heavy mining equipment during the scheduled preventive maintenance

NASA Astrophysics Data System (ADS)

Drygin, M. Yu; Kuryshkin, N. P.

2018-01-01

Intensification of production, economic globalization and dramatic downgrade of the workers’ professional skills lead to unacceptable technical state of heavy mining equipment. Equipment maintenance outage reaches 84 % of the total downtime, of which emergency maintenance takes up to 36 % of time, that excesses 429 hours per year fr one excavator. It is shown that yearly diagnostics using methods of non-destructive check allows to reduce emergency downtime by 47 %, and 55 % of revealed defects can be eliminated without breaking the technological cycle of the equipment.

Evaluation of scheduling techniques for payload activity planning

NASA Technical Reports Server (NTRS)

Bullington, Stanley F.

1991-01-01

Two tasks related to payload activity planning and scheduling were performed. The first task involved making a comparison of space mission activity scheduling problems with production scheduling problems. The second task consisted of a statistical analysis of the output of runs of the Experiment Scheduling Program (ESP). Details of the work which was performed on these two tasks are presented.

Artificial intelligence approaches to astronomical observation scheduling

NASA Technical Reports Server (NTRS)

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.

Planning and Scheduling for Fleets of Earth Observing Satellites

NASA Technical Reports Server (NTRS)

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

2001-01-01

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

Resurgence: The Unintended Maintenance of Problem Behavior

ERIC Educational Resources Information Center

Ringdahl, Joel E.; St. Peter, Claire

2017-01-01

Researchers, teachers, practitioners, and parents are often concerned with how to program for and achieve the maintenance of appropriate behavior. The unintended maintenance of problem behavior is less often evaluated. This article describes a behavioral phenomenon, resurgence, that may result in the unintended maintenance of problem behavior.…

Deep Space Network Scheduling Using Evolutionary Computational Methods

NASA Technical Reports Server (NTRS)

Guillaume, Alexandre; Lee, Seugnwon; Wang, Yeou-Fang; Terrile, Richard J.

2007-01-01

The paper presents the specific approach taken to formulate the problem in terms of gene encoding, fitness function, and genetic operations. The genome is encoded such that a subset of the scheduling constraints is automatically satisfied. Several fitness functions are formulated to emphasize different aspects of the scheduling problem. The optimal solutions of the different fitness functions demonstrate the trade-off of the scheduling problem and provide insight into a conflict resolution process.

Enhanced Specification and Verification for Timed Planning

DTIC Science & Technology

2009-02-28

Scheduling Problem The job-shop scheduling problem ( JSSP ) is a generic resource allocation problem in which common resources (“machines”) are required...interleaving of all processes Pi with the non-delay and mutual exclusion constraints: JSSP =̂ |||0<i6n Pi Where mutual-exclusion( JSSP ) For every complete...execution of JSSP (which terminates), its associated sched- ule S is a feasible schedule. An optimal schedule is a trace of JSSP with the minimum ending

Improving Resource Selection and Scheduling Using Predictions. Chapter 1

NASA Technical Reports Server (NTRS)

Smith, Warren

2003-01-01

The introduction of computational grids has resulted in several new problems in the area of scheduling that can be addressed using predictions. The first problem is selecting where to run an application on the many resources available in a grid. Our approach to help address this problem is to provide predictions of when an application would start to execute if submitted to specific scheduled computer systems. The second problem is gaining simultaneous access to multiple computer systems so that distributed applications can be executed. We help address this problem by investigating how to support advance reservations in local scheduling systems. Our approaches to both of these problems are based on predictions for the execution time of applications on space- shared parallel computers. As a side effect of this work, we also discuss how predictions of application run times can be used to improve scheduling performance.

A manpower scheduling heuristic for aircraft maintenance application

NASA Astrophysics Data System (ADS)

Sze, San-Nah; Sze, Jeeu-Fong; Chiew, Kang-Leng

2012-09-01

This research studies a manpower scheduling for aircraft maintenance, focusing on in-flight food loading operation. A group of loading teams with flexible shifts is required to deliver and upload packaged meals from the ground kitchen to aircrafts in multiple trips. All aircrafts must be served within predefined time windows. The scheduling process takes into account of various constraints such as meal break allocation, multi-trip traveling and food exposure time limit. Considering the aircrafts movement and predefined maximum working hours for each loading team, the main objective of this study is to form an efficient roster by assigning a minimum number of loading teams to the aircrafts. We proposed an insertion based heuristic to generate the solutions in a short period of time for large instances. This proposed algorithm is implemented in various stages for constructing trips due to the presence of numerous constraints. The robustness and efficiency of the algorithm is demonstrated in computational results. The results show that the insertion heuristic more efficiently outperforms the company's current practice.

Experiments with a decision-theoretic scheduler

NASA Technical Reports Server (NTRS)

Hansson, Othar; Holt, Gerhard; Mayer, Andrew

1992-01-01

This paper describes DTS, a decision-theoretic scheduler designed to employ state-of-the-art probabilistic inference technology to speed the search for efficient solutions to constraint-satisfaction problems. Our approach involves assessing the performance of heuristic control strategies that are normally hard-coded into scheduling systems, and using probabilistic inference to aggregate this information in light of features of a given problem. BPS, the Bayesian Problem-Solver, introduced a similar approach to solving single-agent and adversarial graph search problems, yielding orders-of-magnitude improvement over traditional techniques. Initial efforts suggest that similar improvements will be realizable when applied to typical constraint-satisfaction scheduling problems.

Producing Satisfactory Solutions to Scheduling Problems: An Iterative Constraint Relaxation Approach

NASA Technical Reports Server (NTRS)

Chien, S.; Gratch, J.

1994-01-01

One drawback to using constraint-propagation in planning and scheduling systems is that when a problem has an unsatisfiable set of constraints such algorithms typically only show that no solution exists. While, technically correct, in practical situations, it is desirable in these cases to produce a satisficing solution that satisfies the most important constraints (typically defined in terms of maximizing a utility function). This paper describes an iterative constraint relaxation approach in which the scheduler uses heuristics to progressively relax problem constraints until the problem becomes satisfiable. We present empirical results of applying these techniques to the problem of scheduling spacecraft communications for JPL/NASA antenna resources.

Evaluation of dose reduction versus standard dosing for maintenance of remission in patients with spondyloarthritis and clinical remission with anti-TNF (REDES-TNF): study protocol for a randomized controlled trial.

PubMed

Pontes, Caridad; Gratacós, Jordi; Torres, Ferran; Avendaño, Cristina; Sanz, Jesús; Vallano, Antoni; Juanola, Xavier; de Miguel, Eugenio; Sanmartí, Raimon; Calvo, Gonzalo

2015-08-20

Dose reduction schedules of tumor necrosis factor antagonists (anti-TNF) as maintenance therapy in patients with spondyloarthritis are used empirically in clinical practice, despite the lack of clinical trials providing evidence for this practice. To address this issue the Spanish Society of Rheumatology (SER) and Spanish Society of Clinical Pharmacology (SEFC) designed a 3-year multicenter, randomized, open-label, controlled clinical trial (2 years for inclusion and 1 year of follow-up). The study is expected to include 190 patients with axial spondyloarthritis on stable maintenance treatment (≥4 months) with any anti-TNF agent at doses recommended in the summary of product characteristics. Patients will be randomized to either a dose reduction arm or maintenance of the dosing regimen as per the official labelling recommendations. Randomization will be stratified according to the anti-TNF agent received before study inclusion. Patient follow-up, visit schedule, and examinations will be maintained as per normal clinical practice recommendations according to SER guidelines. The study aims to test the hypothesis of noninferiority of the dose reduction strategy compared with standard treatment. The first patients were recruited in July 2012, and study completion is scheduled for the end of April 2015. The REDES-TNF study is a pragmatic clinical trial that aims to provide evidence to support a medical decision now made empirically. The study results may help inform clinical decisions relevant to both patients and healthcare decision makers. EudraCT 2011-005871-18 (21 December 2011).

The NOνA Module Factory Quality Assurance System

NASA Astrophysics Data System (ADS)

Smith, Alex; the NOνA Collaboration

The NOνA experiment will measure neutrino oscillations using a long-baseline beam, a ∼220-ton near detector and a ∼14-kiloton far detector. Production of ∼12500 modules to build these detectors is an industrial scale operation requiring careful quality assurance to meet the stringent technical specifications. Unlike a typical industrial operation, this project will use primarily a part time labor force of ∼200 University of Minnesota undergraduate students managed by a small team of full time employees. The quality assurance system is involved in nearly every aspect of the production: assembly, scheduling, training, payroll, materials, machine maintenance, test data, and safety compliance. The quality assurance data collected during the assembly process allows us to quickly identify and correct any problems that arise.

Pan Am gets big savings at no cost

DOE Office of Scientific and Technical Information (OSTI.GOV)

Tanz, D.

Pan American World Airways' contract with an energy management control systems distributor enabled the company's terminal and maintenance facilities at JFK airport in New York to shift from housekeeping to major savings without additional cost. Energy savings from a pneumatic control system were split almost equally between Pan Am and Thomas S. Brown Associates (TSBA) Inc., and further savings are expected from a planned computer-controlled system. A full-time energy manager, able to give top priority to energy-consumption problems, was considered crucial to the program's success. Early efforts in light-level reduction and equipment scheduling required extensive persuasion and policing, but successfulmore » energy savings allowed the manager to progress to the more-extensive plants with TSBA.« less

A New Lagrangian Relaxation Method Considering Previous Hour Scheduling for Unit Commitment Problem

NASA Astrophysics Data System (ADS)

Khorasani, H.; Rashidinejad, M.; Purakbari-Kasmaie, M.; Abdollahi, A.

2009-08-01

Generation scheduling is a crucial challenge in power systems especially under new environment of liberalization of electricity industry. A new Lagrangian relaxation method for unit commitment (UC) has been presented for solving generation scheduling problem. This paper focuses on the economical aspect of UC problem, while the previous hour scheduling as a very important issue is studied. In this paper generation scheduling of present hour has been conducted by considering the previous hour scheduling. The impacts of hot/cold start-up cost have been taken in to account in this paper. Case studies and numerical analysis presents significant outcomes while it demonstrates the effectiveness of the proposed method.

Production scheduling with ant colony optimization

NASA Astrophysics Data System (ADS)

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.

Effect of persistent trace compounds in landfill gas on engine performance during energy recovery: a case study.

PubMed

Sevimoğlu, Orhan; Tansel, Berrin

2013-01-01

Performances of gas engines operated with landfill gas (LFG) are affected by the impurities in the LFG, reducing the economic viability of energy recovery. The purpose of this study was to characterize the trace compounds in the LFG at the Odayeri Landfill, Istanbul, Turkey which is used for energy recovery. Composite gas samples were collected and analyzed for trace compounds (hydrocarbons, siloxanes, and volatile halogenated hydrocarbons) over a 3-year period. Trace compounds entering the gas engines, their impact on the engine performance were evaluated. The operational problems included deposit formation in the combustion chamber, turbocharger, and intercooler of engine before the scheduled maintenance times. High levels of hydrogen sulfide, as well as chlorinated and fluorinated compounds cause corrosion of the engine parts and decrease life of the engine oils. Persistence of siloxanes results in deposit formation, increasing engine maintenance costs. Pretreatment of LFG is necessary to protect the engines at the waste-to-energy facilities with persistence levels of siloxanes and volatile halogenated hydrocarbons. Copyright © 2012 Elsevier Ltd. All rights reserved.

STV fueling options

NASA Technical Reports Server (NTRS)

Flemming, Ken

1991-01-01

Lunar vehicles that will be space based and reusable will require resupply of propellants in orbit. Approximately 75 pct. of the total mass delivered to low earth orbit will be propellants. Consequently, the propellant management techniques selected for Space Exploration Initiative (SEI) orbital operations will have a major influence on the overall SEI architecture. Five proposed propellant management facility (PMF) concepts were analyzed and compared in order to determine the best method of resupplying reusable, space based Lunar Transfer Vehicles (LTVs). The processing time needed at the Space Station to prepare LTV for its next lunar mission was estimated for each of the PMF concepts. The estimated times required to assemble and maintain the different PMF concepts were also compared. The results of the maintenance analysis were similar, with co-orbiting depots needing 100 to 350 pct. more annual maintenance. The first few external tanks mating operations at KSC encountered many problems that could cause serious lunar mission schedule delays. The use of drop tanks on lunar vehicles increases by a factor of four the number of critical propellant interface disturbances.

Compliance and its role in successful treatment of an advanced periodontal case: review of the literature and a case report.

PubMed

Soolari, Ahmad

2002-05-01

Periodontal disease is a chronic disease that is perceived by many patients to be nonthreatening. Periodontal therapy has been shown to be less effective if a regular periodontal maintenance schedule is not followed after completion of active therapy. Periodontal maintenance is an integral part of successful periodontal therapy.

Sensibility study in a flexible job shop scheduling problem

NASA Astrophysics Data System (ADS)

Curralo, Ana; Pereira, Ana I.; Barbosa, José; Leitão, Paulo

2013-10-01

This paper proposes the impact assessment of the jobs order in the optimal time of operations in a Flexible Job Shop Scheduling Problem. In this work a real assembly cell was studied: the AIP-PRIMECA cell at the Université de Valenciennes et du Hainaut-Cambrésis, in France, which is considered as a Flexible Job Shop problem. The problem consists in finding the machines operations schedule, taking into account the precedence constraints. The main objective is to minimize the batch makespan, i.e. the finish time of the last operation completed in the schedule. Shortly, the present study consists in evaluating if the jobs order affects the optimal time of the operations schedule. The genetic algorithm was used to solve the optimization problem. As a conclusion, it's assessed that the jobs order influence the optimal time.

Coordinating space telescope operations in an integrated planning and scheduling architecture

NASA Technical Reports Server (NTRS)

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

1992-01-01

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

Preliminary Evaluation of BIM-based Approaches for Schedule Delay Analysis

NASA Astrophysics Data System (ADS)

Chou, Hui-Yu; Yang, Jyh-Bin

2017-10-01

The problem of schedule delay commonly occurs in construction projects. The quality of delay analysis depends on the availability of schedule-related information and delay evidence. More information used in delay analysis usually produces more accurate and fair analytical results. How to use innovative techniques to improve the quality of schedule delay analysis results have received much attention recently. As Building Information Modeling (BIM) technique has been quickly developed, using BIM and 4D simulation techniques have been proposed and implemented. Obvious benefits have been achieved especially in identifying and solving construction consequence problems in advance of construction. This study preforms an intensive literature review to discuss the problems encountered in schedule delay analysis and the possibility of using BIM as a tool in developing a BIM-based approach for schedule delay analysis. This study believes that most of the identified problems can be dealt with by BIM technique. Research results could be a fundamental of developing new approaches for resolving schedule delay disputes.

Further Evaluation of the Use of Multiple Schedules for Behavior Maintained by Negative Reinforcement.

PubMed

Campos, Claudia; Leon, Yanerys; Sleiman, Andressa; Urcuyo, Beatriz

2017-03-01

One potential limitation of functional communication training (FCT) is that after the functional communication response (FCR) is taught, the response may be emitted at high rates or inappropriate times. Thus, schedule thinning is often necessary. Previous research has demonstrated that multiple schedules can facilitate schedule thinning by establishing discriminative control of the communication response while maintaining low rates of problem behavior. To date, most applied research evaluating the clinical utility of multiple schedules has done so in the context of behavior maintained by positive reinforcement (e.g., attention or tangible items). This study examined the use of a multiple schedule with alternating Fixed Ratio (FR 1)/extinction (EXT) components for two individuals with developmental disabilities who emitted escape-maintained problem behavior. Although problem behavior remained low during all FCT and multiple schedule phases, the use of the multiple schedule alone did not result in discriminated manding.

Check-off logs for routine equipment maintenance.

PubMed

Brewster, M A; Carver, P H; Randolph, B

1995-12-01

The regulatory requirement for appropriate routine instrument maintenance documentation is approached by laboratories in numerous ways. Standard operating procedures (SOPs) may refer to maintenance listed in instrument manuals, may indicate "periodic" performance of an action, or may indicate specific tasks to be performed at certain frequencies. The Quality Assurance Unit (QAU) task of assuring the performance of these indicated maintenance tasks can be extremely laborious if these records are merged with other analysis records. Further, the lack of written maintenance schedules often leads to omission of infrequently performed tasks. We recommend creation of routine maintenance check-off logs for instruments with tasks grouped by frequency of expected performance. Usage of such logs should result in better laboratory compliance with SOPs and the compliance can be readily monitored by QAU or by regulatory agencies.

WEST ELEVATION OF USAIR MAINTENANCE HANGAR AT GREATER BUFFALO INTERNATIONAL ...

Library of Congress Historic Buildings Survey, Historic Engineering Record, Historic Landscapes Survey

WEST ELEVATION OF USAIR MAINTENANCE HANGAR AT GREATER BUFFALO INTERNATIONAL AIRPORT. A BOEING 737-200 HAS BEEN TOWED IN FOR AN OVERNIGHT (BALANCE) CHECK. THE TAIL DOCK STANDS ARE IN POSITION AT THE REAR OF THE AIRCRAFT TO FACILITATE INSPECTION. MAINTENANCE CREWS PERFORM NIGHTLY SERVICE ON UP TO 6 AIRCRAFT. THE NORMAL SEQUENCE OF 12 ROUTINE CHECKS COVERS SEVEN BASIC AREAS: INTERIOR, EXTERIOR, WINGS, LANDING GEAR, TAIL, AUXILIARY POWER UNIT (APU), AND ENGINES. THE WORK FORCE CONSISTS OF 5 INSPECTORS, 3 LEAD MECHANICS, AND 24 MECHANICS; NIGHTLY SCHEDULES ARE COORDINATED BY A PLANNER. - Greater Buffalo International Airport, Maintenance Hangar, Buffalo, Erie County, NY

Fractional Programming for Communication Systems—Part II: Uplink Scheduling via Matching

NASA Astrophysics Data System (ADS)

Shen, Kaiming; Yu, Wei

2018-05-01

This two-part paper develops novel methodologies for using fractional programming (FP) techniques to design and optimize communication systems. Part I of this paper proposes a new quadratic transform for FP and treats its application for continuous optimization problems. In this Part II of the paper, we study discrete problems, such as those involving user scheduling, which are considerably more difficult to solve. Unlike the continuous problems, discrete or mixed discrete-continuous problems normally cannot be recast as convex problems. In contrast to the common heuristic of relaxing the discrete variables, this work reformulates the original problem in an FP form amenable to distributed combinatorial optimization. The paper illustrates this methodology by tackling the important and challenging problem of uplink coordinated multi-cell user scheduling in wireless cellular systems. Uplink scheduling is more challenging than downlink scheduling, because uplink user scheduling decisions significantly affect the interference pattern in nearby cells. Further, the discrete scheduling variable needs to be optimized jointly with continuous variables such as transmit power levels and beamformers. The main idea of the proposed FP approach is to decouple the interaction among the interfering links, thereby permitting a distributed and joint optimization of the discrete and continuous variables with provable convergence. The paper shows that the well-known weighted minimum mean-square-error (WMMSE) algorithm can also be derived from a particular use of FP; but our proposed FP-based method significantly outperforms WMMSE when discrete user scheduling variables are involved, both in term of run-time efficiency and optimizing results.

An investigation of the use of temporal decomposition in space mission scheduling

NASA Technical Reports Server (NTRS)

Bullington, Stanley E.; Narayanan, Venkat

1994-01-01

This research involves an examination of techniques for solving scheduling problems in long-duration space missions. The mission timeline is broken up into several time segments, which are then scheduled incrementally. Three methods are presented for identifying the activities that are to be attempted within these segments. The first method is a mathematical model, which is presented primarily to illustrate the structure of the temporal decomposition problem. Since the mathematical model is bound to be computationally prohibitive for realistic problems, two heuristic assignment procedures are also presented. The first heuristic method is based on dispatching rules for activity selection, and the second heuristic assigns performances of a model evenly over timeline segments. These heuristics are tested using a sample Space Station mission and a Spacelab mission. The results are compared with those obtained by scheduling the missions without any problem decomposition. The applicability of this approach to large-scale mission scheduling problems is also discussed.

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

NASA Technical Reports Server (NTRS)

Richards, Stephen F.

1991-01-01

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

Value centric approaches to the design, operations and maintenance of wind turbines

NASA Astrophysics Data System (ADS)

Khadabadi, Madhur Aravind

Wind turbine maintenance is emerging as an unexpectedly high component of turbine operating cost, and there is an increasing interest in managing this cost. This thesis presents an alternative view of maintenance as a value-driver, and develops an optimization algorithm to evaluate the value delivered by different maintenance techniques. I view maintenance as an operation that moves the turbine to an improved state in which it can generate more power and, thus, earn more revenue. To implement this approach, I model the stochastic deterioration of the turbine in two dimensions: the deterioration rate, and the extent of deterioration, and then use maintenance to improve the state of the turbine. The value of the turbine is the difference between the revenue from to the power generation and the costs incurred in operation and maintenance. With a focus on blade deterioration, I evaluate the value delivered by implementing two different maintenance schemes, predictive maintenance and scheduled maintenance. An example of predictive maintenance technique is the use of Condition Monitoring Systems to precisely detect deterioration. I model Condition Monitoring System (CMS) of different degrees of fidelity, where a higher fidelity CMS would allow the blade state to be determined with a higher precision. The same model is then applied for the scheduled maintenance technique. The improved state information obtained from these techniques is then used to derive an optimal maintenance strategy. The difference between the value of the turbine with and without the inspection type can be interpreted as the value of the inspection. The results indicate that a higher fidelity (and more expensive) inspection method does not necessarily yield the highest value, and, that there is an optimal level of fidelity that results in maximum value. The results also aim to inform the operator of the impact of regional parameters such as wind speed, variance and maintenance costs to the optimal maintenance strategy. The contributions of this work are twofold. First, I present a practical approach to wind turbine valuation that takes operating and market conditions into account. This work should therefore be useful to wind farm operators, investors and decision makers. Second, I show how the value of a maintenance scheme can be explicitly assessed for different conditions.

Automated telescope scheduling

NASA Technical Reports Server (NTRS)

Johnston, Mark D.

1988-01-01

With the ever increasing level of automation of astronomical telescopes the benefits and feasibility of automated planning and scheduling are becoming more apparent. Improved efficiency and increased overall telescope utilization are the most obvious goals. Automated scheduling at some level has been done for several satellite observatories, but the requirements on these systems were much less stringent than on modern ground or satellite observatories. The scheduling problem is particularly acute for Hubble Space Telescope: virtually all observations must be planned in excruciating detail weeks to months in advance. Space Telescope Science Institute has recently made significant progress on the scheduling problem by exploiting state-of-the-art artificial intelligence software technology. What is especially interesting is that this effort has already yielded software that is well suited to scheduling groundbased telescopes, including the problem of optimizing the coordinated scheduling of more than one telescope.

Reinforcement learning in scheduling

NASA Technical Reports Server (NTRS)

Dietterich, Tom G.; Ok, Dokyeong; Zhang, Wei; Tadepalli, Prasad

1994-01-01

The goal of this research is to apply reinforcement learning methods to real-world problems like scheduling. In this preliminary paper, we show that learning to solve scheduling problems such as the Space Shuttle Payload Processing and the Automatic Guided Vehicle (AGV) scheduling can be usefully studied in the reinforcement learning framework. We discuss some of the special challenges posed by the scheduling domain to these methods and propose some possible solutions we plan to implement.

Genetic algorithm parameters tuning for resource-constrained project scheduling problem

NASA Astrophysics Data System (ADS)

Tian, Xingke; Yuan, Shengrui

2018-04-01

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

Application of decentralized cooperative problem solving in dynamic flexible scheduling

NASA Astrophysics Data System (ADS)

Guan, Zai-Lin; Lei, Ming; Wu, Bo; Wu, Ya; Yang, Shuzi

1995-08-01

The object of this study is to discuss an intelligent solution to the problem of task-allocation in shop floor scheduling. For this purpose, the technique of distributed artificial intelligence (DAI) is applied. Intelligent agents (IAs) are used to realize decentralized cooperation, and negotiation is realized by using message passing based on the contract net model. Multiple agents, such as manager agents, workcell agents, and workstation agents, make game-like decisions based on multiple criteria evaluations. This procedure of decentralized cooperative problem solving makes local scheduling possible. And by integrating such multiple local schedules, dynamic flexible scheduling for the whole shop floor production can be realized.

Aircraft Scheduled Structural Maintenance Programs: Current Philosophies and Methods in the United States and their Applicability to the Royal Australian Air Force

DTIC Science & Technology

1988-09-01

maintenance programs. They use "a dedicated age exploration technique and actuarial analyses (31:847)" to Justify any changes to programs. RAAF. The...A066593). 8. Coffin, M.D. and C.F. Tiffany. "New Air Force Requirements for Structural Safety, Durability and Life Management," AIAA/ ASME /SAE 16th

Genetic algorithm to solve the problems of lectures and practicums scheduling

NASA Astrophysics Data System (ADS)

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

2018-02-01

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

Decision-theoretic control of EUVE telescope scheduling

NASA Technical Reports Server (NTRS)

Hansson, Othar; Mayer, Andrew

1993-01-01

This paper describes a decision theoretic scheduler (DTS) designed to employ state-of-the-art probabilistic inference technology to speed the search for efficient solutions to constraint-satisfaction problems. Our approach involves assessing the performance of heuristic control strategies that are normally hard-coded into scheduling systems and using probabilistic inference to aggregate this information in light of the features of a given problem. The Bayesian Problem-Solver (BPS) introduced a similar approach to solving single agent and adversarial graph search patterns yielding orders-of-magnitude improvement over traditional techniques. Initial efforts suggest that similar improvements will be realizable when applied to typical constraint-satisfaction scheduling problems.

Design tool for multiprocessor scheduling and evaluation of iterative dataflow algorithms

NASA Technical Reports Server (NTRS)

Jones, Robert L., III

1995-01-01

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

ASDC RSS Feeds

Atmospheric Science Data Center

2013-03-08

... Features ASDC's RSS feed with highlights about Earth Science Data at NASA Langley Research Center ASDC Scheduled ... about maintenance   About RSS What is RSS? RSS (Really Simple Syndication, or Rich Site Summary) ...

Transmission overhaul estimates for partial and full replacement at repair

NASA Technical Reports Server (NTRS)

Savage, M.; Lewicki, D. G.

1991-01-01

Timely transmission overhauls increase in-flight service reliability greater than the calculated design reliabilities of the individual aircraft transmission components. Although necessary for aircraft safety, transmission overhauls contribute significantly to aircraft expense. Predictions of a transmission's maintenance needs at the design stage should enable the development of more cost effective and reliable transmissions in the future. The frequency is estimated of overhaul along with the number of transmissions or components needed to support the overhaul schedule. Two methods based on the two parameter Weibull statistical distribution for component life are used to estimate the time between transmission overhauls. These methods predict transmission lives for maintenance schedules which repair the transmission with a complete system replacement or repair only failed components of the transmission. An example illustrates the methods.

DSN Resource Scheduling

NASA Technical Reports Server (NTRS)

Wang, Yeou-Fang; Baldwin, John

2007-01-01

TIGRAS is client-side software, which provides tracking-station equipment planning, allocation, and scheduling services to the DSMS (Deep Space Mission System). TIGRAS provides functions for schedulers to coordinate the DSN (Deep Space Network) antenna usage time and to resolve the resource usage conflicts among tracking passes, antenna calibrations, maintenance, and system testing activities. TIGRAS provides a fully integrated multi-pane graphical user interface for all scheduling operations. This is a great improvement over the legacy VAX VMS command line user interface. TIGRAS has the capability to handle all DSN resource scheduling aspects from long-range to real time. TIGRAS assists NASA mission operations for DSN tracking of station equipment resource request processes from long-range load forecasts (ten years or longer), to midrange, short-range, and real-time (less than one week) emergency tracking plan changes. TIGRAS can be operated by NASA mission operations worldwide to make schedule requests for the DSN station equipment.

Improving Intercontinental Ballistic Missile Maintenance Scheduling Through the Use of Location Analysis Methodologies

DTIC Science & Technology

2006-03-01

Requirements for the Degree of Master of Science in Logistics Management Dale L. Overholts II, BS Capt, USAF March 2006 APPROVED...distance (e. g . , travel time or cost, demand satisfaction) is fundamental to such problems” (Current et al, 2002:86). The set covering location... the total number of scheduled launch facilities, can be found in Appendix F. Appendix G provides detailed information regarding the impacts of

Designing a fuzzy scheduler for hard real-time systems

NASA Technical Reports Server (NTRS)

Yen, John; Lee, Jonathan; Pfluger, Nathan; Natarajan, Swami

1992-01-01

In hard real-time systems, tasks have to be performed not only correctly, but also in a timely fashion. If timing constraints are not met, there might be severe consequences. Task scheduling is the most important problem in designing a hard real-time system, because the scheduling algorithm ensures that tasks meet their deadlines. However, the inherent nature of uncertainty in dynamic hard real-time systems increases the problems inherent in scheduling. In an effort to alleviate these problems, we have developed a fuzzy scheduler to facilitate searching for a feasible schedule. A set of fuzzy rules are proposed to guide the search. The situation we are trying to address is the performance of the system when no feasible solution can be found, and therefore, certain tasks will not be executed. We wish to limit the number of important tasks that are not scheduled.

DTS: Building custom, intelligent schedulers

NASA Technical Reports Server (NTRS)

Hansson, Othar; Mayer, Andrew

1994-01-01

DTS is a decision-theoretic scheduler, built on top of a flexible toolkit -- this paper focuses on how the toolkit might be reused in future NASA mission schedulers. The toolkit includes a user-customizable scheduling interface, and a 'Just-For-You' optimization engine. The customizable interface is built on two metaphors: objects and dynamic graphs. Objects help to structure problem specifications and related data, while dynamic graphs simplify the specification of graphical schedule editors (such as Gantt charts). The interface can be used with any 'back-end' scheduler, through dynamically-loaded code, interprocess communication, or a shared database. The 'Just-For-You' optimization engine includes user-specific utility functions, automatically compiled heuristic evaluations, and a postprocessing facility for enforcing scheduling policies. The optimization engine is based on BPS, the Bayesian Problem-Solver (1,2), which introduced a similar approach to solving single-agent and adversarial graph search problems.

Improving Hospital-wide Patient Scheduling Decisions by Clinical Pathway Mining.

PubMed

Gartner, Daniel; Arnolds, Ines V; Nickel, Stefan

2015-01-01

Recent research has highlighted the need for solving hospital-wide patient scheduling problems. Inpatient scheduling, patient activities have to be scheduled on scarce hospital resources such that temporal relations between activities (e.g. for recovery times) are ensured. Common objectives are, among others, the minimization of the length of stay (LOS). In this paper, we consider a hospital-wide patient scheduling problem with LOS minimization based on uncertain clinical pathways. We approach the problem in three stages: First, we learn most likely clinical pathways using a sequential pattern mining approach. Second, we provide a mathematical model for patient scheduling and finally, we combine the two approaches. In an experimental study carried out using real-world data, we show that our approach outperforms baseline approaches on two metrics.

A new parallel DNA algorithm to solve the task scheduling problem based on inspired computational model.

PubMed

Wang, Zhaocai; Ji, Zuwen; Wang, Xiaoming; Wu, Tunhua; Huang, Wei

2017-12-01

As a promising approach to solve the computationally intractable problem, the method based on DNA computing is an emerging research area including mathematics, computer science and molecular biology. The task scheduling problem, as a well-known NP-complete problem, arranges n jobs to m individuals and finds the minimum execution time of last finished individual. In this paper, we use a biologically inspired computational model and describe a new parallel algorithm to solve the task scheduling problem by basic DNA molecular operations. In turn, we skillfully design flexible length DNA strands to represent elements of the allocation matrix, take appropriate biological experiment operations and get solutions of the task scheduling problem in proper length range with less than O(n 2 ) time complexity. Copyright © 2017. Published by Elsevier B.V.

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

NASA Astrophysics Data System (ADS)

Li, Guoliang; Xing, Lining; Chen, Yingwu

2017-11-01

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

FASTER - A tool for DSN forecasting and scheduling

NASA Technical Reports Server (NTRS)

Werntz, David; Loyola, Steven; Zendejas, Silvino

1993-01-01

FASTER (Forecasting And Scheduling Tool for Earth-based Resources) is a suite of tools designed for forecasting and scheduling JPL's Deep Space Network (DSN). The DSN is a set of antennas and other associated resources that must be scheduled for satellite communications, astronomy, maintenance, and testing. FASTER consists of MS-Windows based programs that replace two existing programs (RALPH and PC4CAST). FASTER was designed to be more flexible, maintainable, and user friendly. FASTER makes heavy use of commercial software to allow for customization by users. FASTER implements scheduling as a two pass process: the first pass calculates a predictive profile of resource utilization; the second pass uses this information to calculate a cost function used in a dynamic programming optimization step. This information allows the scheduler to 'look ahead' at activities that are not as yet scheduled. FASTER has succeeded in allowing wider access to data and tools, reducing the amount of effort expended and increasing the quality of analysis.

Machines that Manage.

ERIC Educational Resources Information Center

Kennedy, Mike

2003-01-01

Describes how facilities-management systems use technology to help schools and universities operate their buildings more efficiently, reduce energy consumption, manage inventory more accurately, keep track of supplies and maintenance schedules, and save money. (EV)

More Bang for the Buck: Integrating Green Infrastructure into Existing Public Works Projects

EPA Pesticide Factsheets

shares lessons learned from municipal and county officials experienced in coordinating green infrastructure applications with scheduled street maintenance, park improvements, and projects on public sites.

Crew interface specifications preparation for in-flight maintenance and stowage functions

NASA Technical Reports Server (NTRS)

Parker, F. W.; Carlton, B. E.

1972-01-01

The findings and data products developed during the Phase 2 crew interface specification study are presented. Five new NASA general specifications were prepared: operations location coding system for crew interfaces; loose equipment and stowage management requirements; loose equipment and stowage data base information requirements; spacecraft loose equipment stowage drawing requirements; and inflight stowage management data requirements. Additional data was developed defining inflight maintenance processes and related data concepts for inflight troubleshooting, remove/repair/replace and scheduled maintenance activities. The process of maintenance task and equipment definition during spacecraft design and development was also defined and related data concepts were identified for futher development into formal NASA specifications during future follow-on study phases of the contract.

Flight control electronics reliability/maintenance study

NASA Technical Reports Server (NTRS)

Dade, W. W.; Edwards, R. H.; Katt, G. T.; Mcclellan, K. L.; Shomber, H. A.

1977-01-01

Collection and analysis of data are reported that concern the reliability and maintenance experience of flight control system electronics currently in use on passenger carrying jet aircraft. Two airlines B-747 airplane fleets were analyzed to assess the component reliability, system functional reliability, and achieved availability of the CAT II configuration flight control system. Also assessed were the costs generated by this system in the categories of spare equipment, schedule irregularity, and line and shop maintenance. The results indicate that although there is a marked difference in the geographic location and route pattern between the airlines studied, there is a close similarity in the reliability and the maintenance costs associated with the flight control electronics.

Discrete harmony search algorithm for scheduling and rescheduling the reprocessing problems in remanufacturing: a case study

NASA Astrophysics Data System (ADS)

Gao, Kaizhou; Wang, Ling; Luo, Jianping; Jiang, Hua; Sadollah, Ali; Pan, Quanke

2018-06-01

In this article, scheduling and rescheduling problems with increasing processing time and new job insertion are studied for reprocessing problems in the remanufacturing process. To handle the unpredictability of reprocessing time, an experience-based strategy is used. Rescheduling strategies are applied for considering the effect of increasing reprocessing time and the new subassembly insertion. To optimize the scheduling and rescheduling objective, a discrete harmony search (DHS) algorithm is proposed. To speed up the convergence rate, a local search method is designed. The DHS is applied to two real-life cases for minimizing the maximum completion time and the mean of earliness and tardiness (E/T). These two objectives are also considered together as a bi-objective problem. Computational optimization results and comparisons show that the proposed DHS is able to solve the scheduling and rescheduling problems effectively and productively. Using the proposed approach, satisfactory optimization results can be achieved for scheduling and rescheduling on a real-life shop floor.

Solving multi-objective job shop scheduling problems using a non-dominated sorting genetic algorithm

NASA Astrophysics Data System (ADS)

Piroozfard, Hamed; Wong, Kuan Yew

2015-05-01

The efforts of finding optimal schedules for the job shop scheduling problems are highly important for many real-world industrial applications. In this paper, a multi-objective based job shop scheduling problem by simultaneously minimizing makespan and tardiness is taken into account. The problem is considered to be more complex due to the multiple business criteria that must be satisfied. To solve the problem more efficiently and to obtain a set of non-dominated solutions, a meta-heuristic based non-dominated sorting genetic algorithm is presented. In addition, task based representation is used for solution encoding, and tournament selection that is based on rank and crowding distance is applied for offspring selection. Swapping and insertion mutations are employed to increase diversity of population and to perform intensive search. To evaluate the modified non-dominated sorting genetic algorithm, a set of modified benchmarking job shop problems obtained from the OR-Library is used, and the results are considered based on the number of non-dominated solutions and quality of schedules obtained by the algorithm.

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

NASA Technical Reports Server (NTRS)

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.

Spike: Artificial intelligence scheduling for Hubble space telescope

NASA Technical Reports Server (NTRS)

Johnston, Mark; Miller, Glenn; Sponsler, Jeff; Vick, Shon; Jackson, Robert

1990-01-01

Efficient utilization of spacecraft resources is essential, but the accompanying scheduling problems are often computationally intractable and are difficult to approximate because of the presence of numerous interacting constraints. Artificial intelligence techniques were applied to the scheduling of the NASA/ESA Hubble Space Telescope (HST). This presents a particularly challenging problem since a yearlong observing program can contain some tens of thousands of exposures which are subject to a large number of scientific, operational, spacecraft, and environmental constraints. New techniques were developed for machine reasoning about scheduling constraints and goals, especially in cases where uncertainty is an important scheduling consideration and where resolving conflicts among conflicting preferences is essential. These technique were utilized in a set of workstation based scheduling tools (Spike) for HST. Graphical displays of activities, constraints, and schedules are an important feature of the system. High level scheduling strategies using both rule based and neural network approaches were developed. While the specific constraints implemented are those most relevant to HST, the framework developed is far more general and could easily handle other kinds of scheduling problems. The concept and implementation of the Spike system are described along with some experiments in adapting Spike to other spacecraft scheduling domains.

Scheduler Design Criteria: Requirements and Considerations

NASA Technical Reports Server (NTRS)

Lee, Hanbong

2016-01-01

This presentation covers fundamental requirements and considerations for developing schedulers in airport operations. We first introduce performance and functional requirements for airport surface schedulers. Among various optimization problems in airport operations, we focus on airport surface scheduling problem, including runway and taxiway operations. We then describe a basic methodology for airport surface scheduling such as node-link network model and scheduling algorithms previously developed. Next, we explain how to design a mathematical formulation in more details, which consists of objectives, decision variables, and constraints. Lastly, we review other considerations, including optimization tools, computational performance, and performance metrics for evaluation.

What work schedule characteristics constitute a problem to the individual? A representative study of Swedish shift workers.

PubMed

Åkerstedt, Torbjörn; Kecklund, Göran

2017-03-01

The purpose was to investigate which detailed characteristics of shift schedules that are seen as problems to those exposed. A representative national sample of non-day workers (N = 2031) in Sweden was asked whether they had each of a number of particular work schedule characteristics and, if yes, to what extent this constituted a "big problem in life". It was also inquired whether the individual's work schedules had negative consequences for fatigue, sleep and social life. The characteristic with the highest percentage reporting a big problem was "short notice (<1 month) of a new work schedule" (30.5%), <11 h off between shifts (27.8%), and split duty (>1.5 h break at mid-shift, 27.2%). Overtime (>10 h/week), night work, morning work, day/night shifts showed lower prevalences of being a "big problem". Women indicated more problems in general. Short notice was mainly related to negative social effects, while <11 h off between shifts was related to disturbed sleep, fatigue and social difficulties. It was concluded that schedules involving unpredictable working hours (short notice), short daily rest between shifts, and split duty shifts constitute big problems. The results challenge current views of what aspects of shift work need improvement, and negative social consequences seem more important than those related to health. Copyright © 2016 Elsevier Ltd. All rights reserved.

Service-Oriented Node Scheduling Scheme for Wireless Sensor Networks Using Markov Random Field Model

PubMed Central

Cheng, Hongju; Su, Zhihuang; Lloret, Jaime; Chen, Guolong

2014-01-01

Future wireless sensor networks are expected to provide various sensing services and energy efficiency is one of the most important criterions. The node scheduling strategy aims to increase network lifetime by selecting a set of sensor nodes to provide the required sensing services in a periodic manner. In this paper, we are concerned with the service-oriented node scheduling problem to provide multiple sensing services while maximizing the network lifetime. We firstly introduce how to model the data correlation for different services by using Markov Random Field (MRF) model. Secondly, we formulate the service-oriented node scheduling issue into three different problems, namely, the multi-service data denoising problem which aims at minimizing the noise level of sensed data, the representative node selection problem concerning with selecting a number of active nodes while determining the services they provide, and the multi-service node scheduling problem which aims at maximizing the network lifetime. Thirdly, we propose a Multi-service Data Denoising (MDD) algorithm, a novel multi-service Representative node Selection and service Determination (RSD) algorithm, and a novel MRF-based Multi-service Node Scheduling (MMNS) scheme to solve the above three problems respectively. Finally, extensive experiments demonstrate that the proposed scheme efficiently extends the network lifetime. PMID:25384005

A bicriteria heuristic for an elective surgery scheduling problem.

PubMed

Marques, Inês; Captivo, M Eugénia; Vaz Pato, Margarida

2015-09-01

Resource rationalization and reduction of waiting lists for surgery are two main guidelines for hospital units outlined in the Portuguese National Health Plan. This work is dedicated to an elective surgery scheduling problem arising in a Lisbon public hospital. In order to increase the surgical suite's efficiency and to reduce the waiting lists for surgery, two objectives are considered: maximize surgical suite occupation and maximize the number of surgeries scheduled. This elective surgery scheduling problem consists of assigning an intervention date, an operating room and a starting time for elective surgeries selected from the hospital waiting list. Accordingly, a bicriteria surgery scheduling problem arising in the hospital under study is presented. To search for efficient solutions of the bicriteria optimization problem, the minimization of a weighted Chebyshev distance to a reference point is used. A constructive and improvement heuristic procedure specially designed to address the objectives of the problem is developed and results of computational experiments obtained with empirical data from the hospital are presented. This study shows that by using the bicriteria approach presented here it is possible to build surgical plans with very good performance levels. This method can be used within an interactive approach with the decision maker. It can also be easily adapted to other hospitals with similar scheduling conditions.

Performance evaluation of different types of particle representation procedures of Particle Swarm Optimization in Job-shop Scheduling Problems

NASA Astrophysics Data System (ADS)

Izah Anuar, Nurul; Saptari, Adi

2016-02-01

This paper addresses the types of particle representation (encoding) procedures in a population-based stochastic optimization technique in solving scheduling problems known in the job-shop manufacturing environment. It intends to evaluate and compare the performance of different particle representation procedures in Particle Swarm Optimization (PSO) in the case of solving Job-shop Scheduling Problems (JSP). Particle representation procedures refer to the mapping between the particle position in PSO and the scheduling solution in JSP. It is an important step to be carried out so that each particle in PSO can represent a schedule in JSP. Three procedures such as Operation and Particle Position Sequence (OPPS), random keys representation and random-key encoding scheme are used in this study. These procedures have been tested on FT06 and FT10 benchmark problems available in the OR-Library, where the objective function is to minimize the makespan by the use of MATLAB software. Based on the experimental results, it is discovered that OPPS gives the best performance in solving both benchmark problems. The contribution of this paper is the fact that it demonstrates to the practitioners involved in complex scheduling problems that different particle representation procedures can have significant effects on the performance of PSO in solving JSP.

Automatic Generation of Heuristics for Scheduling

NASA Technical Reports Server (NTRS)

Morris, Robert A.; Bresina, John L.; Rodgers, Stuart M.

1997-01-01

This paper presents a technique, called GenH, that automatically generates search heuristics for scheduling problems. The impetus for developing this technique is the growing consensus that heuristics encode advice that is, at best, useful in solving most, or typical, problem instances, and, at worst, useful in solving only a narrowly defined set of instances. In either case, heuristic problem solvers, to be broadly applicable, should have a means of automatically adjusting to the idiosyncrasies of each problem instance. GenH generates a search heuristic for a given problem instance by hill-climbing in the space of possible multi-attribute heuristics, where the evaluation of a candidate heuristic is based on the quality of the solution found under its guidance. We present empirical results obtained by applying GenH to the real world problem of telescope observation scheduling. These results demonstrate that GenH is a simple and effective way of improving the performance of an heuristic scheduler.

24 CFR 886.105 - Content of application; Disclosure.

Code of Federal Regulations, 2011 CFR

2011-04-01

...) For projects having a history of financial default, financial difficulties or deferred maintenance, a plan and a schedule for remedying such defaulted or deferred obligations; (e) Total number of units by...

24 CFR 886.105 - Content of application; Disclosure.

Code of Federal Regulations, 2014 CFR

2014-04-01

...) For projects having a history of financial default, financial difficulties or deferred maintenance, a plan and a schedule for remedying such defaulted or deferred obligations; (e) Total number of units by...

24 CFR 886.105 - Content of application; Disclosure.

Code of Federal Regulations, 2013 CFR

2013-04-01

...) For projects having a history of financial default, financial difficulties or deferred maintenance, a plan and a schedule for remedying such defaulted or deferred obligations; (e) Total number of units by...

24 CFR 886.105 - Content of application; Disclosure.

Code of Federal Regulations, 2012 CFR

2012-04-01

...) For projects having a history of financial default, financial difficulties or deferred maintenance, a plan and a schedule for remedying such defaulted or deferred obligations; (e) Total number of units by...

Optimizing an F-16 Squadron Weekly Pilot Schedule for the Turkish Air Force

DTIC Science & Technology

2010-03-01

disrupted schedules are rescheduled , minimizing the total number of changes with respect to the previous schedule’s objective function. Output...producing rosters for a nursing staff in a large general hospital (Dowsland, 1998) and afterwards Aickelin and Dowsland use an Indirect Genetic...algorithm to improve the solutions of the nurse scheduling problem which is similar to the fighter squadron pilot scheduling problem (Aickelin and

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

NASA Technical Reports Server (NTRS)

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

1975-01-01

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

A Genetic Algorithm for Flow Shop Scheduling with Assembly Operations to Minimize Makespan

NASA Astrophysics Data System (ADS)

Bhongade, A. S.; Khodke, P. M.

2014-04-01

Manufacturing systems, in which, several parts are processed through machining workstations and later assembled to form final products, is common. Though scheduling of such problems are solved using heuristics, available solution approaches can provide solution for only moderate sized problems due to large computation time required. In this work, scheduling approach is developed for such flow-shop manufacturing system having machining workstations followed by assembly workstations. The initial schedule is generated using Disjunctive method and genetic algorithm (GA) is applied further for generating schedule for large sized problems. GA is found to give near optimal solution based on the deviation of makespan from lower bound. The lower bound of makespan of such problem is estimated and percent deviation of makespan from lower bounds is used as a performance measure to evaluate the schedules. Computational experiments are conducted on problems developed using fractional factorial orthogonal array, varying the number of parts per product, number of products, and number of workstations (ranging upto 1,520 number of operations). A statistical analysis indicated the significance of all the three factors considered. It is concluded that GA method can obtain optimal makespan.

Permutation flow-shop scheduling problem to optimize a quadratic objective function

NASA Astrophysics Data System (ADS)

Ren, Tao; Zhao, Peng; Zhang, Da; Liu, Bingqian; Yuan, Huawei; Bai, Danyu

2017-09-01

A flow-shop scheduling model enables appropriate sequencing for each job and for processing on a set of machines in compliance with identical processing orders. The objective is to achieve a feasible schedule for optimizing a given criterion. Permutation is a special setting of the model in which the processing order of the jobs on the machines is identical for each subsequent step of processing. This article addresses the permutation flow-shop scheduling problem to minimize the criterion of total weighted quadratic completion time. With a probability hypothesis, the asymptotic optimality of the weighted shortest processing time schedule under a consistency condition (WSPT-CC) is proven for sufficiently large-scale problems. However, the worst case performance ratio of the WSPT-CC schedule is the square of the number of machines in certain situations. A discrete differential evolution algorithm, where a new crossover method with multiple-point insertion is used to improve the final outcome, is presented to obtain high-quality solutions for moderate-scale problems. A sequence-independent lower bound is designed for pruning in a branch-and-bound algorithm for small-scale problems. A set of random experiments demonstrates the performance of the lower bound and the effectiveness of the proposed algorithms.

Hybrid Pareto artificial bee colony algorithm for multi-objective single machine group scheduling problem with sequence-dependent setup times and learning effects.

PubMed

Yue, Lei; Guan, Zailin; Saif, Ullah; Zhang, Fei; Wang, Hao

2016-01-01

Group scheduling is significant for efficient and cost effective production system. However, there exist setup times between the groups, which require to decrease it by sequencing groups in an efficient way. Current research is focused on a sequence dependent group scheduling problem with an aim to minimize the makespan in addition to minimize the total weighted tardiness simultaneously. In most of the production scheduling problems, the processing time of jobs is assumed as fixed. However, the actual processing time of jobs may be reduced due to "learning effect". The integration of sequence dependent group scheduling problem with learning effects has been rarely considered in literature. Therefore, current research considers a single machine group scheduling problem with sequence dependent setup times and learning effects simultaneously. A novel hybrid Pareto artificial bee colony algorithm (HPABC) with some steps of genetic algorithm is proposed for current problem to get Pareto solutions. Furthermore, five different sizes of test problems (small, small medium, medium, large medium, large) are tested using proposed HPABC. Taguchi method is used to tune the effective parameters of the proposed HPABC for each problem category. The performance of HPABC is compared with three famous multi objective optimization algorithms, improved strength Pareto evolutionary algorithm (SPEA2), non-dominated sorting genetic algorithm II (NSGAII) and particle swarm optimization algorithm (PSO). Results indicate that HPABC outperforms SPEA2, NSGAII and PSO and gives better Pareto optimal solutions in terms of diversity and quality for almost all the instances of the different sizes of problems.

Research on wind power grid-connected operation and dispatching strategies of Liaoning power grid

NASA Astrophysics Data System (ADS)

Han, Qiu; Qu, Zhi; Zhou, Zhi; He, Xiaoyang; Li, Tie; Jin, Xiaoming; Li, Jinze; Ling, Zhaowei

2018-02-01

As a kind of clean energy, wind power has gained rapid development in recent years. Liaoning Province has abundant wind resources and the total installed capacity of wind power is in the forefront. With the large-scale wind power grid-connected operation, the contradiction between wind power utilization and peak load regulation of power grid has been more prominent. To this point, starting with the power structure and power grid installation situation of Liaoning power grid, the distribution and the space-time output characteristics of wind farm, the prediction accuracy, the curtailment and the off-grid situation of wind power are analyzed. Based on the deep analysis of the seasonal characteristics of power network load, the composition and distribution of main load are presented. Aiming at the problem between the acceptance of wind power and power grid adjustment, the scheduling strategies are given, including unit maintenance scheduling, spinning reserve, energy storage equipment settings by the analysis of the operation characteristics and the response time of thermal power units and hydroelectric units, which can meet the demand of wind power acceptance and provide a solution to improve the level of power grid dispatching.

Integrated resource scheduling in a distributed scheduling environment

NASA Technical Reports Server (NTRS)

Zoch, David; Hall, Gardiner

1988-01-01

The Space Station era presents a highly-complex multi-mission planning and scheduling environment exercised over a highly distributed system. In order to automate the scheduling process, customers require a mechanism for communicating their scheduling requirements to NASA. A request language that a remotely-located customer can use to specify his scheduling requirements to a NASA scheduler, thus automating the customer-scheduler interface, is described. This notation, Flexible Envelope-Request Notation (FERN), allows the user to completely specify his scheduling requirements such as resource usage, temporal constraints, and scheduling preferences and options. The FERN also contains mechanisms for representing schedule and resource availability information, which are used in the inter-scheduler inconsistency resolution process. Additionally, a scheduler is described that can accept these requests, process them, generate schedules, and return schedule and resource availability information to the requester. The Request-Oriented Scheduling Engine (ROSE) was designed to function either as an independent scheduler or as a scheduling element in a network of schedulers. When used in a network of schedulers, each ROSE communicates schedule and resource usage information to other schedulers via the FERN notation, enabling inconsistencies to be resolved between schedulers. Individual ROSE schedules are created by viewing the problem as a constraint satisfaction problem with a heuristically guided search strategy.

40 CFR 86.428-80 - Maintenance, scheduled; test vehicles.

Code of Federal Regulations, 2011 CFR

2011-07-01

... necessary. For example, piston and cylinder replacement caused by piston seizure which results in the vehicle being inoperative; or in the case of two-stroke engines, decarbonization, the need for which is...

40 CFR 86.428-80 - Maintenance, scheduled; test vehicles.

Code of Federal Regulations, 2012 CFR

2012-07-01

... necessary. For example, piston and cylinder replacement caused by piston seizure which results in the vehicle being inoperative; or in the case of two-stroke engines, decarbonization, the need for which is...

40 CFR 86.428-80 - Maintenance, scheduled; test vehicles.

Code of Federal Regulations, 2010 CFR

2010-07-01

... necessary. For example, piston and cylinder replacement caused by piston seizure which results in the vehicle being inoperative; or in the case of two-stroke engines, decarbonization, the need for which is...

40 CFR 86.428-80 - Maintenance, scheduled; test vehicles.

Code of Federal Regulations, 2014 CFR

2014-07-01

... necessary. For example, piston and cylinder replacement caused by piston seizure which results in the vehicle being inoperative; or in the case of two-stroke engines, decarbonization, the need for which is...

Methodology for Automated Detection of Degradation and Faults in Packaged Air Conditioners and Heat Pumps Using Only Two Sensors

DOE Office of Scientific and Technical Information (OSTI.GOV)

2016-02-10

The software was created in the process of developing a system known as the Smart Monitoring and Diagnostic System (SMDS) for packaged air conditioners and heat pumps used on commercial buildings (known as RTUs). The SMDS provides automated remote monitoring and detection of performance degradation and faults in these RTUs and could increase the awareness by building owners and maintenance providers of the condition of the equipment, the cost of operating it in degraded condition, and the quality of maintenance and repair service when it is performed. The SMDS provides these capabilities and would enable conditioned-based maintenance rather than themore » reactive and schedule-based preventive maintenance commonly used today, when maintenance of RTUs is done at all. Improved maintenance would help ensure persistent peak operating efficiencies, reducing energy consumption by an estimated 10% to 30%.« less

Decomposition of timed automata for solving scheduling problems

NASA Astrophysics Data System (ADS)

Nishi, Tatsushi; Wakatake, Masato

2014-03-01

A decomposition algorithm for scheduling problems based on timed automata (TA) model is proposed. The problem is represented as an optimal state transition problem for TA. The model comprises of the parallel composition of submodels such as jobs and resources. The procedure of the proposed methodology can be divided into two steps. The first step is to decompose the TA model into several submodels by using decomposable condition. The second step is to combine individual solution of subproblems for the decomposed submodels by the penalty function method. A feasible solution for the entire model is derived through the iterated computation of solving the subproblem for each submodel. The proposed methodology is applied to solve flowshop and jobshop scheduling problems. Computational experiments demonstrate the effectiveness of the proposed algorithm compared with a conventional TA scheduling algorithm without decomposition.

A controlled genetic algorithm by fuzzy logic and belief functions for job-shop scheduling.

PubMed

Hajri, S; Liouane, N; Hammadi, S; Borne, P

2000-01-01

Most scheduling problems are highly complex combinatorial problems. However, stochastic methods such as genetic algorithm yield good solutions. In this paper, we present a controlled genetic algorithm (CGA) based on fuzzy logic and belief functions to solve job-shop scheduling problems. For better performance, we propose an efficient representational scheme, heuristic rules for creating the initial population, and a new methodology for mixing and computing genetic operator probabilities.

Scheduling in the Face of Uncertain Resource Consumption and Utility

NASA Technical Reports Server (NTRS)

Frank, Jeremy; Dearden, Richard

2003-01-01

We discuss the problem of scheduling tasks that consume uncertain amounts of a resource with known capacity and where the tasks have uncertain utility. In these circumstances, we would like to find schedules that exceed a lower bound on the expected utility when executed. We show that the problems are NP- complete, and present some results that characterize the behavior of some simple heuristics over a variety of problem classes.

Scheduling Earth Observing Fleets Using Evolutionary Algorithms: Problem Description and Approach

NASA Technical Reports Server (NTRS)

Globus, Al; Crawford, James; Lohn, Jason; Morris, Robert; Clancy, Daniel (Technical Monitor)

2002-01-01

We describe work in progress concerning multi-instrument, multi-satellite scheduling. Most, although not all, Earth observing instruments currently in orbit are unique. In the relatively near future, however, we expect to see fleets of Earth observing spacecraft, many carrying nearly identical instruments. This presents a substantially new scheduling challenge. Inspired by successful commercial applications of evolutionary algorithms in scheduling domains, this paper presents work in progress regarding the use of evolutionary algorithms to solve a set of Earth observing related model problems. Both the model problems and the software are described. Since the larger problems will require substantial computation and evolutionary algorithms are embarrassingly parallel, we discuss our parallelization techniques using dedicated and cycle-scavenged workstations.

Contingency rescheduling of spacecraft operations

NASA Technical Reports Server (NTRS)

Britt, Daniel L.; Geoffroy, Amy L.; Gohring, John R.

1988-01-01

Spacecraft activity scheduling was a focus of attention in artificial intelligence recently. Several scheduling systems were devised which more-or-less successfully address various aspects of the activity scheduling problem, though most of these are not yet mature, with the notable expection of NASA's ESP. Few current scheduling systems, however, make any attempt to deal fully with the problem of modifying a schedule in near-real-time in the event of contingencies which may arise during schedule execution. These contingencies can include resources becoming unavailable unpredictably, a change in spacecraft conditions or environment, or the need to perform an activity not scheduled. In these cases it becomes necessary to repair an existing schedule, disrupting ongoing operations as little as possible. Normal scheduling is just a part of that which must be accomplished during contingency rescheduling. A prototype system named MAESTRO was developed for spacecraft activity scheduling. MAESTRO is briefly described with a focus on recent work in the area of real-time contingency handling. Included is a discussion of some of the complexities of the scheduling problem and how they affect contingency rescheduling, such as temporal constraints between activities, activities which may be interrupted and continued in any of several ways, and different ways to choose a resource complement which will allow continuation of an activity. Various heuristics used in MAESTRO for contingency rescheduling is discussed, as are operational concerns such as interaction of the scheduler with spacecraft subsystems controllers.

Using Multiple Schedules During Functional Communication Training to Promote Rapid Transfer of Treatment Effects

PubMed Central

Fisher, Wayne W.; Greer, Brian D.; Fuhrman, Ashley M.; Querim, Angie C.

2016-01-01

Multiple schedules with signaled periods of reinforcement and extinction have been used to thin reinforcement schedules during functional communication training (FCT) to make the intervention more practical for parents and teachers. We evaluated whether these signals would also facilitate rapid transfer of treatment effects from one setting to the next and from one therapist to the next. With two children, we conducted FCT in the context of mixed (baseline) and multiple (treatment) schedules introduced across settings or therapists using a multiple baseline design. Results indicated that when the multiple schedules were introduced, the functional communication response came under rapid discriminative control, and problem behavior remained at near-zero rates. We extended these findings with another individual by using a more traditional baseline in which problem behavior produced reinforcement. Results replicated those of the previous participants and showed rapid reductions in problem behavior when multiple schedules were implemented across settings. PMID:26384141

A Simulation Based Approach to Optimize Berth Throughput Under Uncertainty at Marine Container Terminals

NASA Technical Reports Server (NTRS)

Golias, Mihalis M.

2011-01-01

Berth scheduling is a critical function at marine container terminals and determining the best berth schedule depends on several factors including the type and function of the port, size of the port, location, nearby competition, and type of contractual agreement between the terminal and the carriers. In this paper we formulate the berth scheduling problem as a bi-objective mixed-integer problem with the objective to maximize customer satisfaction and reliability of the berth schedule under the assumption that vessel handling times are stochastic parameters following a discrete and known probability distribution. A combination of an exact algorithm, a Genetic Algorithms based heuristic and a simulation post-Pareto analysis is proposed as the solution approach to the resulting problem. Based on a number of experiments it is concluded that the proposed berth scheduling policy outperforms the berth scheduling policy where reliability is not considered.

Using multiple schedules during functional communication training to promote rapid transfer of treatment effects.

PubMed

Fisher, Wayne W; Greer, Brian D; Fuhrman, Ashley M; Querim, Angie C

2015-12-01

Multiple schedules with signaled periods of reinforcement and extinction have been used to thin reinforcement schedules during functional communication training (FCT) to make the intervention more practical for parents and teachers. We evaluated whether these signals would also facilitate rapid transfer of treatment effects across settings and therapists. With 2 children, we conducted FCT in the context of mixed (baseline) and multiple (treatment) schedules introduced across settings or therapists using a multiple baseline design. Results indicated that when the multiple schedules were introduced, the functional communication response came under rapid discriminative control, and problem behavior remained at near-zero rates. We extended these findings with another individual by using a more traditional baseline in which problem behavior produced reinforcement. Results replicated those of the previous participants and showed rapid reductions in problem behavior when multiple schedules were implemented across settings. © Society for the Experimental Analysis of Behavior.

Capability of the Maximax&Maximin selection operator in the evolutionary algorithm for a nurse scheduling problem

NASA Astrophysics Data System (ADS)

Ramli, Razamin; Tein, Lim Huai

2016-08-01

A good work schedule can improve hospital operations by providing better coverage with appropriate staffing levels in managing nurse personnel. Hence, constructing the best nurse work schedule is the appropriate effort. In doing so, an improved selection operator in the Evolutionary Algorithm (EA) strategy for a nurse scheduling problem (NSP) is proposed. The smart and efficient scheduling procedures were considered. Computation of the performance of each potential solution or schedule was done through fitness evaluation. The best so far solution was obtained via special Maximax&Maximin (MM) parent selection operator embedded in the EA, which fulfilled all constraints considered in the NSP.

Scheduling multirobot operations in manufacturing by truncated Petri nets

NASA Astrophysics Data System (ADS)

Chen, Qin; Luh, J. Y.

1995-08-01

Scheduling of operational sequences in manufacturing processes is one of the important problems in automation. Methods of applying Petri nets to model and analyze the problem with constraints on precedence relations, multiple resources allocation, etc. have been available in literature. Searching for an optimum schedule can be implemented by combining the branch-and-bound technique with the execution of the timed Petri net. The process usually produces a large Petri net which is practically not manageable. This disadvantage, however, can be handled by a truncation technique which divides the original large Petri net into several smaller size subnets. The complexity involved in the analysis of each subnet individually is greatly reduced. However, when the locally optimum schedules of the resulting subnets are combined together, it may not yield an overall optimum schedule for the original Petri net. To circumvent this problem, algorithms are developed based on the concepts of Petri net execution and modified branch-and-bound process. The developed technique is applied to a multi-robot task scheduling problem of the manufacturing work cell.

Earthbound applications for NASA's physician workstation

NASA Technical Reports Server (NTRS)

Grams, R.; Yu, F. S.; Li, B.; Iddings, E.; Fiorentino, R.; Shao, S.; Wang, L.; Broughton, H.

1993-01-01

The dream of a space probe to Mars or an astronaut colony on the moon persists. Despite years of setbacks and delays, NASA continues to lay the foundation for a new frontier in space. The necessity of a self contained health maintenance facility is an integral part of this stellar venture. As a subsystem of this health maintenance facility, the physician or astronaut workstation was envisioned as the vehicle of interface between the computer resources of the space station and the care provider. Our efforts to define and build this interface have resulted in a series of programs which can now be tested and refined using earth-based applications. The modules which have dual-use application from the NASA workstation include: patient scheduling and master patient index, pharmacy, laboratory, medical library, problem list/progress notes, and digital medical records. Our current plan is to develop these tools as objects that can be assembled in a variety of configurations. This will allow the technology to be used by the private sector where each doctor can select the starting point of his outpatient office system and add modules as he makes progress in system integration and training.

Lunar Surface Systems Supportability Technology Development Roadmap

NASA Technical Reports Server (NTRS)

Oeftering, Richard C.; Struk, Peter M.; Green, Jennifer L.; Chau, Savio N.; Curell, Philip C.; Dempsey, Cathy A.; Patterson, Linda P.; Robbins, William; Steele, Michael A.; DAnnunzio, Anthony;

Scheduling in the Face of Uncertain Resource Consumption and Utility

NASA Technical Reports Server (NTRS)

Koga, Dennis (Technical Monitor); Frank, Jeremy; Dearden, Richard

2003-01-01

We discuss the problem of scheduling tasks that consume a resource with known capacity and where the tasks have varying utility. We consider problems in which the resource consumption and utility of each activity is described by probability distributions. In these circumstances, we would like to find schedules that exceed a lower bound on the expected utility when executed. We first show that while some of these problems are NP-complete, others are only NP-Hard. We then describe various heuristic search algorithms to solve these problems and their drawbacks. Finally, we present empirical results that characterize the behavior of these heuristics over a variety of problem classes.

A novel discrete PSO algorithm for solving job shop scheduling problem to minimize makespan

NASA Astrophysics Data System (ADS)

Rameshkumar, K.; Rajendran, C.

2018-02-01

In this work, a discrete version of PSO algorithm is proposed to minimize the makespan of a job-shop. A novel schedule builder has been utilized to generate active schedules. The discrete PSO is tested using well known benchmark problems available in the literature. The solution produced by the proposed algorithms is compared with best known solution published in the literature and also compared with hybrid particle swarm algorithm and variable neighborhood search PSO algorithm. The solution construction methodology adopted in this study is found to be effective in producing good quality solutions for the various benchmark job-shop scheduling problems.

The air transportation industry birthplace of reliability-centered maintenance

DOE Office of Scientific and Technical Information (OSTI.GOV)

Matteson, T.D.

1996-08-01

The 1980s and 1970s provided a timely opportunity for examining and radically changing the process called {open_quotes}preventive maintenance{close_quotes} as it is applied to the aircraft used for scheduled air transportation. The Federal Aviation Administration and four major airlines, United, American, Pan American and Trans World, were the {open_quotes}principals{close_quotes} in that process. While United`s work with the FAA on the Boeing 737 had opened the door a crack, the Boeing 747 presented a major opportunity to radically improve the process for maintenance program design. That program was guided by the results of United`s analyses of failure data from operations of severalmore » fleets, each larger than 100 aircraft, and the concurrent experience of American, Pan American and Trans World. That knowledge provided the insights necessary to support an entirely different approach to maintenance program design. As a result, while United`s existing maintenance program required scheduled overhaul of 339 items on each DC-8, it required overhaul of only 8 items on the B-7471 Although the initial thrust of that work focused on components of active systems, there was concurrent work focused on items whose principal function was to carry the loads associated with operations. That program focused on the classification of structurally-significant items and their classification as {open_quotes}safe life{close_quotes} or {open_quotes}damage tolerant{close_quote} to determine what periodic replacements or repeated inspections were required. That work came to the attention of the Department of Defense which supported preparation of the book-length report by F. Stanley Nowlan and Howard F. Heap at United Airlines entitled {open_quote}Reliability-Centered maintenance{close_quotes}.« less

Discrete Optimization Model for Vehicle Routing Problem with Scheduling Side Cosntraints

NASA Astrophysics Data System (ADS)

Juliandri, Dedy; Mawengkang, Herman; Bu'ulolo, F.

2018-01-01

Vehicle Routing Problem (VRP) is an important element of many logistic systems which involve routing and scheduling of vehicles from a depot to a set of customers node. This is a hard combinatorial optimization problem with the objective to find an optimal set of routes used by a fleet of vehicles to serve the demands a set of customers It is required that these vehicles return to the depot after serving customers’ demand. The problem incorporates time windows, fleet and driver scheduling, pick-up and delivery in the planning horizon. The goal is to determine the scheduling of fleet and driver and routing policies of the vehicles. The objective is to minimize the overall costs of all routes over the planning horizon. We model the problem as a linear mixed integer program. We develop a combination of heuristics and exact method for solving the model.

Application of six sigma and AHP in analysis of variable lead time calibration process instrumentation

NASA Astrophysics Data System (ADS)

Rimantho, Dino; Rahman, Tomy Abdul; Cahyadi, Bambang; Tina Hernawati, S.

2017-02-01

Calibration of instrumentation equipment in the pharmaceutical industry is an important activity to determine the true value of a measurement. Preliminary studies indicated that occur lead-time calibration resulted in disruption of production and laboratory activities. This study aimed to analyze the causes of lead-time calibration. Several methods used in this study such as, Six Sigma in order to determine the capability process of the calibration instrumentation of equipment. Furthermore, the method of brainstorming, Pareto diagrams, and Fishbone diagrams were used to identify and analyze the problems. Then, the method of Hierarchy Analytical Process (AHP) was used to create a hierarchical structure and prioritize problems. The results showed that the value of DPMO around 40769.23 which was equivalent to the level of sigma in calibration equipment approximately 3,24σ. This indicated the need for improvements in the calibration process. Furthermore, the determination of problem-solving strategies Lead Time Calibration such as, shortens the schedule preventive maintenance, increase the number of instrument Calibrators, and train personnel. Test results on the consistency of the whole matrix of pairwise comparisons and consistency test showed the value of hierarchy the CR below 0.1.

Open shop scheduling problem to minimize total weighted completion time

NASA Astrophysics Data System (ADS)

Bai, Danyu; Zhang, Zhihai; Zhang, Qiang; Tang, Mengqian

2017-01-01

A given number of jobs in an open shop scheduling environment must each be processed for given amounts of time on each of a given set of machines in an arbitrary sequence. This study aims to achieve a schedule that minimizes total weighted completion time. Owing to the strong NP-hardness of the problem, the weighted shortest processing time block (WSPTB) heuristic is presented to obtain approximate solutions for large-scale problems. Performance analysis proves the asymptotic optimality of the WSPTB heuristic in the sense of probability limits. The largest weight block rule is provided to seek optimal schedules in polynomial time for a special case. A hybrid discrete differential evolution algorithm is designed to obtain high-quality solutions for moderate-scale problems. Simulation experiments demonstrate the effectiveness of the proposed algorithms.

Multi-Objective Algorithm for Blood Supply via Unmanned Aerial Vehicles to the Wounded in an Emergency Situation

PubMed Central

Wen, Tingxi; Zhang, Zhongnan; Wong, Kelvin K. L.

2016-01-01

Unmanned aerial vehicle (UAV) has been widely used in many industries. In the medical environment, especially in some emergency situations, UAVs play an important role such as the supply of medicines and blood with speed and efficiency. In this paper, we study the problem of multi-objective blood supply by UAVs in such emergency situations. This is a complex problem that includes maintenance of the supply blood’s temperature model during transportation, the UAVs’ scheduling and routes’ planning in case of multiple sites requesting blood, and limited carrying capacity. Most importantly, we need to study the blood’s temperature change due to the external environment, the heating agent (or refrigerant) and time factor during transportation, and propose an optimal method for calculating the mixing proportion of blood and appendage in different circumstances and delivery conditions. Then, by introducing the idea of transportation appendage into the traditional Capacitated Vehicle Routing Problem (CVRP), this new problem is proposed according to the factors of distance and weight. Algorithmically, we use the combination of decomposition-based multi-objective evolutionary algorithm and local search method to perform a series of experiments on the CVRP public dataset. By comparing our technique with the traditional ones, our algorithm can obtain better optimization results and time performance. PMID:27163361

Multi-Objective Algorithm for Blood Supply via Unmanned Aerial Vehicles to the Wounded in an Emergency Situation.

PubMed

Wen, Tingxi; Zhang, Zhongnan; Wong, Kelvin K L

2016-01-01

Unmanned aerial vehicle (UAV) has been widely used in many industries. In the medical environment, especially in some emergency situations, UAVs play an important role such as the supply of medicines and blood with speed and efficiency. In this paper, we study the problem of multi-objective blood supply by UAVs in such emergency situations. This is a complex problem that includes maintenance of the supply blood's temperature model during transportation, the UAVs' scheduling and routes' planning in case of multiple sites requesting blood, and limited carrying capacity. Most importantly, we need to study the blood's temperature change due to the external environment, the heating agent (or refrigerant) and time factor during transportation, and propose an optimal method for calculating the mixing proportion of blood and appendage in different circumstances and delivery conditions. Then, by introducing the idea of transportation appendage into the traditional Capacitated Vehicle Routing Problem (CVRP), this new problem is proposed according to the factors of distance and weight. Algorithmically, we use the combination of decomposition-based multi-objective evolutionary algorithm and local search method to perform a series of experiments on the CVRP public dataset. By comparing our technique with the traditional ones, our algorithm can obtain better optimization results and time performance.

Empirical results on scheduling and dynamic backtracking

NASA Technical Reports Server (NTRS)

Boddy, Mark S.; Goldman, Robert P.

1994-01-01

At the Honeywell Technology Center (HTC), we have been working on a scheduling problem related to commercial avionics. This application is large, complex, and hard to solve. To be a little more concrete: 'large' means almost 20,000 activities, 'complex' means several activity types, periodic behavior, and assorted types of temporal constraints, and 'hard to solve' means that we have been unable to eliminate backtracking through the use of search heuristics. At this point, we can generate solutions, where solutions exist, or report failure and sometimes why the system failed. To the best of our knowledge, this is among the largest and most complex scheduling problems to have been solved as a constraint satisfaction problem, at least that has appeared in the published literature. This abstract is a preliminary report on what we have done and how. In the next section, we present our approach to treating scheduling as a constraint satisfaction problem. The following sections present the application in more detail and describe how we solve scheduling problems in the application domain. The implemented system makes use of Ginsberg's Dynamic Backtracking algorithm, with some minor extensions to improve its utility for scheduling. We describe those extensions and the performance of the resulting system. The paper concludes with some general remarks, open questions and plans for future work.

Sensitivity and bias under conditions of equal and unequal academic task difficulty.

PubMed

Reed, Derek D; Martens, Brian K

2008-01-01

We conducted an experimental analysis of children's relative problem-completion rates across two workstations under conditions of equal (Experiment 1) and unequal (Experiment 2) problem difficulty. Results were described using the generalized matching equation and were evaluated for degree of schedule versus stimulus control. Experiment 1 involved a symmetrical choice arrangement in which the children could earn points exchangeable for rewards contingent on correct math problem completion. Points were delivered according to signaled variable-interval schedules at each workstation. For 2 children, relative rates of problem completion appeared to have been controlled by the schedule requirements in effect and matched relative rates of reinforcement, with sensitivity values near 1 and bias values near 0. Experiment 2 involved increasing the difficulty of math problems at one of the workstations. Sensitivity values for all 3 participants were near 1, but a substantial increase in bias toward the easier math problems was observed. This bias was possibly associated with responding at the more difficult workstation coming under stimulus control rather than schedule control.

Analysis of Feeder Bus Network Design and Scheduling Problems

PubMed Central

Almasi, Mohammad Hadi; Karim, Mohamed Rehan

2014-01-01

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

A genetic algorithm-based approach to flexible flow-line scheduling with variable lot sizes.

PubMed

Lee, I; Sikora, R; Shaw, M J

1997-01-01

Genetic algorithms (GAs) have been used widely for such combinatorial optimization problems as the traveling salesman problem (TSP), the quadratic assignment problem (QAP), and job shop scheduling. In all of these problems there is usually a well defined representation which GA's use to solve the problem. We present a novel approach for solving two related problems-lot sizing and sequencing-concurrently using GAs. The essence of our approach lies in the concept of using a unified representation for the information about both the lot sizes and the sequence and enabling GAs to evolve the chromosome by replacing primitive genes with good building blocks. In addition, a simulated annealing procedure is incorporated to further improve the performance. We evaluate the performance of applying the above approach to flexible flow line scheduling with variable lot sizes for an actual manufacturing facility, comparing it to such alternative approaches as pair wise exchange improvement, tabu search, and simulated annealing procedures. The results show the efficacy of this approach for flexible flow line scheduling.

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

NASA Astrophysics Data System (ADS)

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

2015-12-01

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

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

DOE Office of Scientific and Technical Information (OSTI.GOV)

Carlsson, Mats; Johansson, Mikael; Larson, Jeffrey

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

Performance of Extended Local Clustering Organization (LCO) for Large Scale Job-Shop Scheduling Problem (JSP)

NASA Astrophysics Data System (ADS)

Konno, Yohko; Suzuki, Keiji

This paper describes an approach to development of a solution algorithm of a general-purpose for large scale problems using “Local Clustering Organization (LCO)” as a new solution for Job-shop scheduling problem (JSP). Using a performance effective large scale scheduling in the study of usual LCO, a solving JSP keep stability induced better solution is examined. In this study for an improvement of a performance of a solution for JSP, processes to a optimization by LCO is examined, and a scheduling solution-structure is extended to a new solution-structure based on machine-division. A solving method introduced into effective local clustering for the solution-structure is proposed as an extended LCO. An extended LCO has an algorithm which improves scheduling evaluation efficiently by clustering of parallel search which extends over plural machines. A result verified by an application of extended LCO on various scale of problems proved to conduce to minimizing make-span and improving on the stable performance.

Optimization of Airport Surface Traffic: A Case-Study of Incheon International Airport

NASA Technical Reports Server (NTRS)

Eun, Yeonju; Jeon, Daekeun; Lee, Hanbong; Jung, Yoon C.; Zhu, Zhifan; Jeong, Myeongsook; Kim, Hyounkong; Oh, Eunmi; Hong, Sungkwon

2017-01-01

This study aims to develop a controllers decision support tool for departure and surface management of ICN. Airport surface traffic optimization for Incheon International Airport (ICN) in South Korea was studied based on the operational characteristics of ICN and airspace of Korea. For surface traffic optimization, a multiple runway scheduling problem and a taxi scheduling problem were formulated into two Mixed Integer Linear Programming (MILP) optimization models. The Miles-In-Trail (MIT) separation constraint at the departure fix shared by the departure flights from multiple runways and the runway crossing constraints due to the taxi route configuration specific to ICN were incorporated into the runway scheduling and taxiway scheduling problems, respectively. Since the MILP-based optimization model for the multiple runway scheduling problem may be computationally intensive, computation times and delay costs of different solving methods were compared for a practical implementation. This research was a collaboration between Korea Aerospace Research Institute (KARI) and National Aeronautics and Space Administration (NASA).

Optimization of Airport Surface Traffic: A Case-Study of Incheon International Airport

NASA Technical Reports Server (NTRS)

Eun, Yeonju; Jeon, Daekeun; Lee, Hanbong; Jung, Yoon Chul; Zhu, Zhifan; Jeong, Myeong-Sook; Kim, Hyoun Kyoung; Oh, Eunmi; Hong, Sungkwon

2017-01-01

This study aims to develop a controllers' decision support tool for departure and surface management of ICN. Airport surface traffic optimization for Incheon International Airport (ICN) in South Korea was studied based on the operational characteristics of ICN and airspace of Korea. For surface traffic optimization, a multiple runway scheduling problem and a taxi scheduling problem were formulated into two Mixed Integer Linear Programming (MILP) optimization models. The Miles-In-Trail (MIT) separation constraint at the departure fix shared by the departure flights from multiple runways and the runway crossing constraints due to the taxi route configuration specific to ICN were incorporated into the runway scheduling and taxiway scheduling problems, respectively. Since the MILP-based optimization model for the multiple runway scheduling problem may be computationally intensive, computation times and delay costs of different solving methods were compared for a practical implementation. This research was a collaboration between Korea Aerospace Research Institute (KARI) and National Aeronautics and Space Administration (NASA).

Multi-Objective Scheduling for the Cluster II Constellation

NASA Technical Reports Server (NTRS)

Johnston, Mark D.; Giuliano, Mark

2011-01-01

This paper describes the application of the MUSE multiobjecctive scheduling framework to the Cluster II WBD scheduling domain. Cluster II is an ESA four-spacecraft constellation designed to study the plasma environment of the Earth and it's magnetosphere. One of the instruments on each of the four spacecraft is the Wide Band Data (WBD) plasma wave experiment. We have applied the MUSE evolutionary algorithm to the scheduling problem represented by this instrument, and the result has been adopted and utilized by the WBD schedulers for nearly a year. This paper describes the WBD scheduling problem, its representation in MUSE, and some of the visualization elements that provide insight into objective value tradeoffs.

Force Management Methods Task II. Volume III. Attack/Fighter/Trainer Aircraft Evaluation of Potential Improved Methods

DTIC Science & Technology

1980-11-01

structural manager. The designation "ASIMISH is used in the subsequent discussions to avoid the impression that a new organization must be created to...mission changes on the structural integrity of the airframe. New maintenance action schedules are created to conform with the operational realities of... created to further divide this information. In fact, the ASIP maintenance action parameters and data for the A-7D ( and other airplanes) is being

7 CFR 654.15 - Operation and maintenance.

Code of Federal Regulations, 2014 CFR

2014-01-01

... installed as set forth in the watershed or RC&D measure plan. (d) Compliance with the time frames and O&M... the schedule for withdrawal of water in water impounding structures as specified in the watershed or...

7 CFR 654.15 - Operation and maintenance.

Code of Federal Regulations, 2010 CFR

2010-01-01

... installed as set forth in the watershed or RC&D measure plan. (d) Compliance with the time frames and O&M... the schedule for withdrawal of water in water impounding structures as specified in the watershed or...

On metaheuristic "failure modes": a case study in Tabu search for job-shop scheduling.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Watson, Jean-Paul

2005-06-01

In this paper, we analyze the relationship between pool maintenance schemes, long-term memory mechanisms, and search space structure, with the goal of placing metaheuristic design on a more concrete foundation.

What to Do until the Microprocesser Arrives.

ERIC Educational Resources Information Center

Barzilla, Frank

1983-01-01

Advises administrators how to develop an energy master plan and how to reduce the usage of heating, ventilating, and air conditioning (HVAC) systems by means of a time clock, thermostat, and a scheduled preventive maintenance program. (MLF)

Evapotranspiration-based irrigation scheduling of lettuce and broccoli

USDA-ARS?s Scientific Manuscript database

Estimation of crop evapotranspiration supports efficient irrigation water management, which in turn supports water conservation, mitigation of groundwater depletion/degradation, energy savings, and crop quality maintenance. Past research in California has revealed strong relationships between fract...

A Busy School Year for Spacecraft.

ERIC Educational Resources Information Center

Riddle, Bob

2001-01-01

Discusses the five upcoming shuttle missions, two Russian missions to the International Space Station, a scheduled visit to the Hubble Space Telescope for maintenance, and other events in the solar system. Includes a list of monthly events. (YDS)

Plant Operation: Exterior Maintenance, Work Hours

ERIC Educational Resources Information Center

Nation's Schools and Colleges, 1975

1975-01-01

A pitched roof built over a flat roof prevented leaking at a Vermont school. The University of New Hampshire paint shop has a flexible scheduling system that allows employees to choose their work hours each day. (Author/MLF)

Plant maintenance and advanced reactors, 2005

DOE Office of Scientific and Technical Information (OSTI.GOV)

Agnihotri, Newal

2005-09-15

The focus of the September-October issue is on plant maintenance and advanced reactors. Major articles/reports in this issue include: First U.S. EPRs in 2015, by Ray Ganthner, Framatome ANP; Pursuing several opportunities, by William E. (Ed) Cummins, Westinghouse Electric Company; Vigorous plans to develop advanced reactors, by Yuliang Sun, Tsinghua University, China; Multiple designs, small and large, by Kumiaki Moriya, Hitachi Ltd., Japan; Sealed and embedded for safety and security, by Handa Norihiko, Toshiba Corporation, Japan; Scheduled online in 2010, by Johan Slabber, PMBR (Pty) Ltd., South Africa; Multi-application reactors, by Nikolay G. Kodochigov, OKBM, Russia; Six projects under budgetmore » and on schedule, by David F. Togerson, AECL, Canada; Creating a positive image, by Scott Peterson, Nuclear Energy Institute (NEI); Advanced plans for nuclear power's renaissance, by John Cleveland, International Atomic Energy Agency, Austria; and, Plant profile: last five outages in less than 20 days, by Beth Rapczynski, Exelon Nuclear.« less

Controls, health assessment, and conditional monitoring for large, reusable, liquid rocket engines

NASA Technical Reports Server (NTRS)

Cikanek, H. A., III

1986-01-01

Past and future progress in the performance of control systems for large, liquid rocket engines typified such as current state-of-the-art, the Shuttle Main Engine (SSME), is discussed. Details of the first decade of efforts, which culminates in the F-1 and J-2 Saturn engines control systems, are traced, noting problem modes and improvements which were implemented to realize the SSME. Future control system designs, to accommodate the requirements of operation of engines for a heavy lift launch vehicle, an orbital transfer vehicle and the aerospace plane, are summarized. Generic design upgrades needed include an expanded range of fault detection, maintenance as-needed instead of as-scheduled, reduced human involvement in engine operations, and increased control of internal engine states. Current NASA technology development programs aimed at meeting the future control system requirements are described.

Exact and Metaheuristic Approaches for a Bi-Objective School Bus Scheduling Problem.

PubMed

Chen, Xiaopan; Kong, Yunfeng; Dang, Lanxue; Hou, Yane; Ye, Xinyue

2015-01-01

As a class of hard combinatorial optimization problems, the school bus routing problem has received considerable attention in the last decades. For a multi-school system, given the bus trips for each school, the school bus scheduling problem aims at optimizing bus schedules to serve all the trips within the school time windows. In this paper, we propose two approaches for solving the bi-objective school bus scheduling problem: an exact method of mixed integer programming (MIP) and a metaheuristic method which combines simulated annealing with local search. We develop MIP formulations for homogenous and heterogeneous fleet problems respectively and solve the models by MIP solver CPLEX. The bus type-based formulation for heterogeneous fleet problem reduces the model complexity in terms of the number of decision variables and constraints. The metaheuristic method is a two-stage framework for minimizing the number of buses to be used as well as the total travel distance of buses. We evaluate the proposed MIP and the metaheuristic method on two benchmark datasets, showing that on both instances, our metaheuristic method significantly outperforms the respective state-of-the-art methods.

The application of artificial intelligence to astronomical scheduling problems

NASA Technical Reports Server (NTRS)

Johnston, Mark D.

1992-01-01

Efficient utilization of expensive space- and ground-based observatories is an important goal for the astronomical community; the cost of modern observing facilities is enormous, and the available observing time is much less than the demand from astronomers around the world. The complexity and variety of scheduling constraints and goals has led several groups to investigate how artificial intelligence (AI) techniques might help solve these kinds of problems. The earliest and most successful of these projects was started at Space Telescope Science Institute in 1987 and has led to the development of the Spike scheduling system to support the scheduling of Hubble Space Telescope (HST). The aim of Spike at STScI is to allocate observations to timescales of days to a week observing all scheduling constraints and maximizing preferences that help ensure that observations are made at optimal times. Spike has been in use operationally for HST since shortly after the observatory was launched in Apr. 1990. Although developed specifically for HST scheduling, Spike was carefully designed to provide a general framework for similar (activity-based) scheduling problems. In particular, the tasks to be scheduled are defined in the system in general terms, and no assumptions about the scheduling timescale are built in. The mechanisms for describing, combining, and propagating temporal and other constraints and preferences are quite general. The success of this approach has been demonstrated by the application of Spike to the scheduling of other satellite observatories: changes to the system are required only in the specific constraints that apply, and not in the framework itself. In particular, the Spike framework is sufficiently flexible to handle both long-term and short-term scheduling, on timescales of years down to minutes or less. This talk will discuss recent progress made in scheduling search techniques, the lessons learned from early HST operations, the application of Spike to other problem domains, and plans for the future evolution of the system.

Non-Evolutionary Algorithms for Scheduling Dependent Tasks in Distributed Heterogeneous Computing Environments

DOE Office of Scientific and Technical Information (OSTI.GOV)

Wayne F. Boyer; Gurdeep S. Hura

2005-09-01

The Problem of obtaining an optimal matching and scheduling of interdependent tasks in distributed heterogeneous computing (DHC) environments is well known to be an NP-hard problem. In a DHC system, task execution time is dependent on the machine to which it is assigned and task precedence constraints are represented by a directed acyclic graph. Recent research in evolutionary techniques has shown that genetic algorithms usually obtain more efficient schedules that other known algorithms. We propose a non-evolutionary random scheduling (RS) algorithm for efficient matching and scheduling of inter-dependent tasks in a DHC system. RS is a succession of randomized taskmore » orderings and a heuristic mapping from task order to schedule. Randomized task ordering is effectively a topological sort where the outcome may be any possible task order for which the task precedent constraints are maintained. A detailed comparison to existing evolutionary techniques (GA and PSGA) shows the proposed algorithm is less complex than evolutionary techniques, computes schedules in less time, requires less memory and fewer tuning parameters. Simulation results show that the average schedules produced by RS are approximately as efficient as PSGA schedules for all cases studied and clearly more efficient than PSGA for certain cases. The standard formulation for the scheduling problem addressed in this paper is Rm|prec|Cmax.,« less

Scheduling Future Water Supply Investments Under Uncertainty

NASA Astrophysics Data System (ADS)

Huskova, I.; Matrosov, E. S.; Harou, J. J.; Kasprzyk, J. R.; Reed, P. M.

2014-12-01

Uncertain hydrological impacts of climate change, population growth and institutional changes pose a major challenge to planning of water supply systems. Planners seek optimal portfolios of supply and demand management schemes but also when to activate assets whilst considering many system goals and plausible futures. Incorporation of scheduling into the planning under uncertainty problem strongly increases its complexity. We investigate some approaches to scheduling with many-objective heuristic search. We apply a multi-scenario many-objective scheduling approach to the Thames River basin water supply system planning problem in the UK. Decisions include which new supply and demand schemes to implement, at what capacity and when. The impact of different system uncertainties on scheme implementation schedules are explored, i.e. how the choice of future scenarios affects the search process and its outcomes. The activation of schemes is influenced by the occurrence of extreme hydrological events in the ensemble of plausible scenarios and other factors. The approach and results are compared with a previous study where only the portfolio problem is addressed (without scheduling).

Blood Glucose Levels and Problem Behavior

ERIC Educational Resources Information Center

Valdovinos, Maria G.; Weyand, David

2006-01-01

The relationship between varying blood glucose levels and problem behavior during daily scheduled activities was examined. The effects that varying blood glucose levels had on problem behavior during daily scheduled activities were examined. Prior research has shown that differing blood glucose levels can affect behavior and mood. Results of this…

Planning as a Precursor to Scheduling for Space Station Payload Operations

NASA Technical Reports Server (NTRS)

Howell, Eric; Maxwell, Theresa

1995-01-01

Contemporary schedulers attempt to solve the problem of best fitting a set of activities into an available timeframe while still satisfying the necessary constraints. This approach produces results which are optimized for the region of time the scheduler is able to process, satisfying the near term goals of the operation. In general the scheduler is not able to reason about the activities which precede or follow the window into which it is inputs to scheduling so that the intermediate placing activities. This creates a problem for operations which are composed of many activities spanning long durations (which exceed the scheduler's reasoning horizon) such as the continuous operations environment for payload operations on the Space Station. Not only must the near term scheduling objectives be met, but somehow the results of near term scheduling must be made to support the attainment of long term goals.

Spike: AI scheduling for Hubble Space Telescope after 18 months of orbital operations

NASA Technical Reports Server (NTRS)

Johnston, Mark D.

1992-01-01

This paper is a progress report on the Spike scheduling system, developed by the Space Telescope Science Institute for long-term scheduling of Hubble Space Telescope (HST) observations. Spike is an activity-based scheduler which exploits artificial intelligence (AI) techniques for constraint representation and for scheduling search. The system has been in operational use since shortly after HST launch in April 1990. Spike was adopted for several other satellite scheduling problems; of particular interest was the demonstration that the Spike framework is sufficiently flexible to handle both long-term and short-term scheduling, on timescales of years down to minutes or less. We describe the recent progress made in scheduling search techniques, the lessons learned from early HST operations, and the application of Spike to other problem domains. We also describe plans for the future evolution of the system.

Detection of structural deterioration and associated airline maintenance problems

NASA Technical Reports Server (NTRS)

Henniker, H. D.; Mitchell, R. G.

1972-01-01

Airline operations involving the detection of structural deterioration and associated maintenance problems are discussed. The standard approach to the maintenance and inspection of aircraft components and systems is described. The frequency of inspections and the application of preventive maintenance practices are examined. The types of failure which airline transport aircraft encounter and the steps taken to prevent catastrophic failure are reported.

Solving the flexible job shop problem by hybrid metaheuristics-based multiagent model

NASA Astrophysics Data System (ADS)

Nouri, Houssem Eddine; Belkahla Driss, Olfa; Ghédira, Khaled

2018-03-01

The flexible job shop scheduling problem (FJSP) is a generalization of the classical job shop scheduling problem that allows to process operations on one machine out of a set of alternative machines. The FJSP is an NP-hard problem consisting of two sub-problems, which are the assignment and the scheduling problems. In this paper, we propose how to solve the FJSP by hybrid metaheuristics-based clustered holonic multiagent model. First, a neighborhood-based genetic algorithm (NGA) is applied by a scheduler agent for a global exploration of the search space. Second, a local search technique is used by a set of cluster agents to guide the research in promising regions of the search space and to improve the quality of the NGA final population. The efficiency of our approach is explained by the flexible selection of the promising parts of the search space by the clustering operator after the genetic algorithm process, and by applying the intensification technique of the tabu search allowing to restart the search from a set of elite solutions to attain new dominant scheduling solutions. Computational results are presented using four sets of well-known benchmark literature instances. New upper bounds are found, showing the effectiveness of the presented approach.

Guide to Operating and Maintaining EnergySmart Schools

DOE Office of Scientific and Technical Information (OSTI.GOV)

None

Through a commitment to high performance, school districts are discovering that smart energy choices can create lasting benefits for students, communities, and the environment. For example, an energy efficient school district with 4,000 students can save as much as $160,000 a year in energy costs. Over 10 years, those savings can reach $1.6 million, translating into the ability to hire more teachers, purchase more textbooks and computers, or invest in additional high performance facilities. Beyond these bottomline benefits, schools can better foster student health, decrease absenteeism, and serve as centers of community life. The U.S. Department of Energy's EnergySmart Schoolsmore » Program promotes a 30 percent improvement in existing school energy use. It also encourages the building of new schools that exceed code (ASHRAE 90.11999) by 50 percent or more. The program provides resources like this Guide to Operating and Maintaining EnergySmart Schools to assist school decisionmakers in planning, financing, operating, and maintaining energy efficient, high performance schools. It also offers education and training for building industry professionals. Operations and maintenance refer to all scheduled and unscheduled actions for preventing equipment failure or decline with the goal of increasing efficiency, reliability, and safety. A preventative maintenance program is the organized and planned performance of maintenance activities in order to prevent system or production problems or failures from occurring. In contrast, deferred maintenance or reactive maintenance (also called diagnostic or corrective maintenance) is conducted to address an existing problem. This guide is a primary resource for developing and implementing a districtor schoolwide operations and maintenance (O&M) program that focuses on energy efficiency. The EnergySmart Schools Solutions companion CD contains additional supporting information for design, renovation, and retrofit projects. The objective of this guide is to provide organizational and technical information for integrating energy and high performance facility management into existing O&M practices. The guide allows users to adapt and implement suggested O&M strategies to address specific energy efficiency goals. It recognizes and expands on existing tools and resources that are widely used throughout the high performance school industry. External resources are referenced throughout the guide and are also listed within the EnergySmart Schools O&M Resource List (Appendix J). While this guide emphasizes the impact of the energy efficiency component of O&M, it encourages taking a holistic approach to maintaining a high-performance school. This includes considering various environmental factors where energy plays an indirect or direct role. For example, indoor air quality, site selection, building orientation, and water efficiency should be considered. Resources to support these overlapping aspects will be cited throughout the guide.« less

The Microcomputer and School Transportation.

ERIC Educational Resources Information Center

Dembowski, Frederick L.

1984-01-01

Microcomputers have many cost- and time-saving uses in school transportation management. Applications include routing and scheduling, demographic analysis, fleet maintenance, and personnel and contract management. Word processing is especially promising for storing and updating documents like specifications. Enrollment forecasting and inventory…

Periodic Heterogeneous Vehicle Routing Problem With Driver Scheduling

NASA Astrophysics Data System (ADS)

Mardiana Panggabean, Ellis; Mawengkang, Herman; Azis, Zainal; Filia Sari, Rina

2018-01-01

The paper develops a model for the optimal management of logistic delivery of a given commodity. The company has different type of vehicles with different capacity to deliver the commodity for customers. The problem is then called Periodic Heterogeneous Vehicle Routing Problem (PHVRP). The goal is to schedule the deliveries according to feasible combinations of delivery days and to determine the scheduling of fleet and driver and routing policies of the vehicles. The objective is to minimize the sum of the costs of all routes over the planning horizon. We propose a combined approach of heuristic algorithm and exact method to solve the problem.

Estimates of the absolute error and a scheme for an approximate solution to scheduling problems

NASA Astrophysics Data System (ADS)

Lazarev, A. A.

2009-02-01

An approach is proposed for estimating absolute errors and finding approximate solutions to classical NP-hard scheduling problems of minimizing the maximum lateness for one or many machines and makespan is minimized. The concept of a metric (distance) between instances of the problem is introduced. The idea behind the approach is, given the problem instance, to construct another instance for which an optimal or approximate solution can be found at the minimum distance from the initial instance in the metric introduced. Instead of solving the original problem (instance), a set of approximating polynomially/pseudopolynomially solvable problems (instances) are considered, an instance at the minimum distance from the given one is chosen, and the resulting schedule is then applied to the original instance.

Military Base Realignments and Closures. DOD Needs to Update Savings Estimates and Continue to Address Challenges in Consolidating Supply-Related Functions at Depot Maintenance Locations

DTIC Science & Technology

2009-07-01

Comments from the Department of Defense 33 Appendix IV GAO Contact and Staff Acknowledgments 36 Related GAO Products 37 Tables Table...work of the U.S. government and is not subject to copyright protection in the United States. The published product may be reproduced and distributed in...disrupting maintenance production schedules due to personnel transfers since the employees are already experienced in performing these jobs. DLA Has

Enhanced Software for Scheduling Space-Shuttle Processing

NASA Technical Reports Server (NTRS)

Barretta, Joseph A.; Johnson, Earl P.; Bierman, Rocky R.; Blanco, Juan; Boaz, Kathleen; Stotz, Lisa A.; Clark, Michael; Lebovitz, George; Lotti, Kenneth J.; Moody, James M.;

In situ monitoring of the integrity of bonded repair patches on aircraft and civil infrastructures

NASA Astrophysics Data System (ADS)

Kumar, Amrita; Roach, Dennis; Beard, Shawn; Qing, Xinlin; Hannum, Robert

2006-03-01

Monitoring the continued health of aircraft subsystems and identifying problems before they affect airworthiness has been a long-term goal of the aviation industry. Because in-service conditions and failure modes experienced by structures are generally complex and unknown, conservative calendar-based or usage-based scheduled maintenance practices are overly time-consuming, labor-intensive and expensive. Metal structures such as helicopters and other transportation systems are likely to develop fatigue cracks under cyclic loads and corrosive service environments. Early detection of cracks is a key element to prevent catastrophic failure and prolong structural life. Furthermore, as structures age, maintenance service frequency and costs increase while performance and availability decrease. Current non-destructive inspection (NDI) techniques that can potentially be used for this purpose typically involve complex, time-intensive procedures, which are labor-intensive and expensive. Most techniques require access to the damaged area on at least one side, and sometimes on both sides. This can be very difficult for monitoring of certain inaccessible regions. In those cases, inspection may require removal of access panels or even structural disassembly. Once access has been obtained, automated inspection techniques likely will not be practical due to the bulk of the required equipment. Results obtained from these techniques may also be sensitive to the sweep speed, tool orientation, and downward pressure. This can be especially problematic for hand-held inspection tools where none of these parameters is mechanically controlled. As a result, data can vary drastically from one inspection to the next, from one technician to the next, and even from one sweep to the next. Structural health monitoring (SHM) offers the promise of a paradigm shift from schedule-driven maintenance to condition-based maintenance (CBM) of assets. Sensors embedded permanently in aircraft safety critical structures that can monitor damage can provide for improved reliability and streamlining of aircraft maintenance. Early detection of damage such as fatigue crack initiation can improve personnel safety and prolong service life. This paper presents the testing of an acousto-ultrasonic piezoelectric sensor based structural health monitoring system for real-time monitoring of fatigue cracks and disbonds in bonded repairs. The system utilizes a network of distributed miniature piezoelectric sensors/actuators embedded on a thin dielectric carrier film, to query, monitor and evaluate the condition of a structure. The sensor layers are extremely flexible and can be integrated with any type of metal or composite structure. Diagnostic signals obtained from a structure during structural monitoring are processed by a portable diagnostic unit. With appropriate diagnostic software, the signals can be analyzed to ascertain the integrity of the structure being monitored. Details on the system, its integration and examples of detection of fatigue crack and disbond growth and quantification for bonded repairs will be presented here.

Working Notes from the 1992 AAAI Spring Symposium on Practical Approaches to Scheduling and Planning

NASA Technical Reports Server (NTRS)

Drummond, Mark; Fox, Mark; Tate, Austin; Zweben, Monte

1992-01-01

The symposium presented issues involved in the development of scheduling systems that can deal with resource and time limitations. To qualify, a system must be implemented and tested to some degree on non-trivial problems (ideally, on real-world problems). However, a system need not be fully deployed to qualify. Systems that schedule actions in terms of metric time constraints typically represent and reason about an external numeric clock or calendar and can be contrasted with those systems that represent time purely symbolically. The following topics are discussed: integrating planning and scheduling; integrating symbolic goals and numerical utilities; managing uncertainty; incremental rescheduling; managing limited computation time; anytime scheduling and planning algorithms, systems; dependency analysis and schedule reuse; management of schedule and plan execution; and incorporation of discrete event techniques.

Job Scheduling in a Heterogeneous Grid Environment

NASA Technical Reports Server (NTRS)

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.

Uncertainty management by relaxation of conflicting constraints in production process scheduling

NASA Technical Reports Server (NTRS)

Dorn, Juergen; Slany, Wolfgang; Stary, Christian

1992-01-01

Mathematical-analytical methods as used in Operations Research approaches are often insufficient for scheduling problems. This is due to three reasons: the combinatorial complexity of the search space, conflicting objectives for production optimization, and the uncertainty in the production process. Knowledge-based techniques, especially approximate reasoning and constraint relaxation, are promising ways to overcome these problems. A case study from an industrial CIM environment, namely high-grade steel production, is presented to demonstrate how knowledge-based scheduling with the desired capabilities could work. By using fuzzy set theory, the applied knowledge representation technique covers the uncertainty inherent in the problem domain. Based on this knowledge representation, a classification of jobs according to their importance is defined which is then used for the straightforward generation of a schedule. A control strategy which comprises organizational, spatial, temporal, and chemical constraints is introduced. The strategy supports the dynamic relaxation of conflicting constraints in order to improve tentative schedules.

Simulated annealing with probabilistic analysis for solving traveling salesman problems

NASA Astrophysics Data System (ADS)

Hong, Pei-Yee; Lim, Yai-Fung; Ramli, Razamin; Khalid, Ruzelan

2013-09-01

Simulated Annealing (SA) is a widely used meta-heuristic that was inspired from the annealing process of recrystallization of metals. Therefore, the efficiency of SA is highly affected by the annealing schedule. As a result, in this paper, we presented an empirical work to provide a comparable annealing schedule to solve symmetric traveling salesman problems (TSP). Randomized complete block design is also used in this study. The results show that different parameters do affect the efficiency of SA and thus, we propose the best found annealing schedule based on the Post Hoc test. SA was tested on seven selected benchmarked problems of symmetric TSP with the proposed annealing schedule. The performance of SA was evaluated empirically alongside with benchmark solutions and simple analysis to validate the quality of solutions. Computational results show that the proposed annealing schedule provides a good quality of solution.

Guidance and Control Software,

DTIC Science & Technology

1980-05-01

commitments of function, cost, and schedule . The phrase "software engineering" was intended to contrast with the phrase "computer science" the latter aims...the software problems of cost, delivery schedule , and quality were gradually being recognized at the highest management levels. Thus, in a project... schedule dates. Although the analysis of software problems indicated that the entire software development process (figure 1) needed new methods, only

High performance techniques for space mission scheduling

NASA Technical Reports Server (NTRS)

Smith, Stephen F.

1994-01-01

In this paper, we summarize current research at Carnegie Mellon University aimed at development of high performance techniques and tools for space mission scheduling. Similar to prior research in opportunistic scheduling, our approach assumes the use of dynamic analysis of problem constraints as a basis for heuristic focusing of problem solving search. This methodology, however, is grounded in representational assumptions more akin to those adopted in recent temporal planning research, and in a problem solving framework which similarly emphasizes constraint posting in an explicitly maintained solution constraint network. These more general representational assumptions are necessitated by the predominance of state-dependent constraints in space mission planning domains, and the consequent need to integrate resource allocation and plan synthesis processes. First, we review the space mission problems we have considered to date and indicate the results obtained in these application domains. Next, we summarize recent work in constraint posting scheduling procedures, which offer the promise of better future solutions to this class of problems.

A Novel Strategy Using Factor Graphs and the Sum-Product Algorithm for Satellite Broadcast Scheduling Problems

NASA Astrophysics Data System (ADS)

Chen, Jung-Chieh

This paper presents a low complexity algorithmic framework for finding a broadcasting schedule in a low-altitude satellite system, i. e., the satellite broadcast scheduling (SBS) problem, based on the recent modeling and computational methodology of factor graphs. Inspired by the huge success of the low density parity check (LDPC) codes in the field of error control coding, in this paper, we transform the SBS problem into an LDPC-like problem through a factor graph instead of using the conventional neural network approaches to solve the SBS problem. Based on a factor graph framework, the soft-information, describing the probability that each satellite will broadcast information to a terminal at a specific time slot, is exchanged among the local processing in the proposed framework via the sum-product algorithm to iteratively optimize the satellite broadcasting schedule. Numerical results show that the proposed approach not only can obtain optimal solution but also enjoys the low complexity suitable for integral-circuit implementation.

Assessing new patient access to mental health providers in HMO networks.

PubMed

Barry, Colleen L; Venkatesh, Mohini; Busch, Susan H

2008-12-01

This study examined access to mental health providers in health maintenance organization (HMO) networks. A telephone survey was conducted with a stratified random sample of mental health providers listed as being in a network for at lease one of six HMOs operating in Connecticut (response rate=72%; N=366). Data were collected between December 2006 and March 2007. Measures included the accuracy of network listings, acceptance rates of new patients, and reasons for not accepting new patients. Acceptance of new patients was defined as scheduling an appointment within two weeks from the time of the initial contact. Logistic regression was used to examine acceptance rates of new patients while controlling for type of provider (social worker, nurse, psychologist, or psychiatrist) and practice characteristics. Findings indicate that 17% of sampled HMO network listings were inaccurate. Among the providers with an accurate listing, 73% were accepting new HMO patients and 76% were accepting new self-pay patients. These aggregate acceptance rates of new patients mask differences among providers, with psychiatrists significantly less likely than other providers to accept new patients (55% of psychiatrists were accepting new patients). The most common reason for not accepting new patients was the lack of available appointments. Results indicate that access to mental health providers in HMO networks varied by type of provider. For HMO enrollees seeking treatment for mental health problems from a provider with a master's degree in social work (M.S.W. degree), network access was not a major problem. Scheduling an appointment with a psychiatrist, particularly a psychiatrist treating children only, was more difficult.

A modify ant colony optimization for the grid jobs scheduling problem with QoS requirements

NASA Astrophysics Data System (ADS)

Pu, Xun; Lu, XianLiang

2011-10-01

Job scheduling with customers' quality of service (QoS) requirement is challenging in grid environment. In this paper, we present a modify Ant colony optimization (MACO) for the Job scheduling problem in grid. Instead of using the conventional construction approach to construct feasible schedules, the proposed algorithm employs a decomposition method to satisfy the customer's deadline and cost requirements. Besides, a new mechanism of service instances state updating is embedded to improve the convergence of MACO. Experiments demonstrate the effectiveness of the proposed algorithm.

The role of artificial intelligence techniques in scheduling systems

NASA Technical Reports Server (NTRS)

Geoffroy, Amy L.; Britt, Daniel L.; Gohring, John R.

1990-01-01

Artificial Intelligence (AI) techniques provide good solutions for many of the problems which are characteristic of scheduling applications. However, scheduling is a large, complex heterogeneous problem. Different applications will require different solutions. Any individual application will require the use of a variety of techniques, including both AI and conventional software methods. The operational context of the scheduling system will also play a large role in design considerations. The key is to identify those places where a specific AI technique is in fact the preferable solution, and to integrate that technique into the overall architecture.

A new distributed systems scheduling algorithm: a swarm intelligence approach

NASA Astrophysics Data System (ADS)

Haghi Kashani, Mostafa; Sarvizadeh, Raheleh; Jameii, Mahdi

2011-12-01

The scheduling problem in distributed systems is known as an NP-complete problem, and methods based on heuristic or metaheuristic search have been proposed to obtain optimal and suboptimal solutions. The task scheduling is a key factor for distributed systems to gain better performance. In this paper, an efficient method based on memetic algorithm is developed to solve the problem of distributed systems scheduling. With regard to load balancing efficiently, Artificial Bee Colony (ABC) has been applied as local search in the proposed memetic algorithm. The proposed method has been compared to existing memetic-Based approach in which Learning Automata method has been used as local search. The results demonstrated that the proposed method outperform the above mentioned method in terms of communication cost.

Solution and reasoning reuse in space planning and scheduling applications

NASA Technical Reports Server (NTRS)

Verfaillie, Gerard; Schiex, Thomas

1994-01-01

In the space domain, as in other domains, the CSP (Constraint Satisfaction Problems) techniques are increasingly used to represent and solve planning and scheduling problems. But these techniques have been developed to solve CSP's which are composed of fixed sets of variables and constraints, whereas many planning and scheduling problems are dynamic. It is therefore important to develop methods which allow a new solution to be rapidly found, as close as possible to the previous one, when some variables or constraints are added or removed. After presenting some existing approaches, this paper proposes a simple and efficient method, which has been developed on the basis of the dynamic backtracking algorithm. This method allows previous solution and reasoning to be reused in the framework of a CSP which is close to the previous one. Some experimental results on general random CSPs and on operation scheduling problems for remote sensing satellites are given.

Toward interactive scheduling systems for managing medical resources.

PubMed

Oddi, A; Cesta, A

2000-10-01

Managers of medico-hospital facilities are facing two general problems when allocating resources to activities: (1) to find an agreement between several and contrasting requirements; (2) to manage dynamic and uncertain situations when constraints suddenly change over time due to medical needs. This paper describes the results of a research aimed at applying constraint-based scheduling techniques to the management of medical resources. A mixed-initiative problem solving approach is adopted in which a user and a decision support system interact to incrementally achieve a satisfactory solution to the problem. A running prototype is described called Interactive Scheduler which offers a set of functionalities for a mixed-initiative interaction to cope with the medical resource management. Interactive Scheduler is endowed with a representation schema used for describing the medical environment, a set of algorithms that address the specific problems of the domain, and an innovative interaction module that offers functionalities for the dialogue between the support system and its user. A particular contribution of this work is the explicit representation of constraint violations, and the definition of scheduling algorithms that aim at minimizing the amount of constraint violations in a solution.

Integrated Maintenance Information System (IMIS): A Maintenance Information Delivery Concept.

DTIC Science & Technology

1987-11-01

InterFace Figure 2. Portable Maintenance Computer Concept. provide advice for difficult fault-isolation problems . The technician will be able to accomplish...faced with an ever-growing number of paper-based technical orders (TOs). This has greatly increased costs and distribution problems . In addition, it has...compounded problems associ- ated with ensuring accurate data and the lengthy correction times involved. To improve the accuracy of technical data and

A Scheduling Algorithm for Cloud Computing System Based on the Driver of Dynamic Essential Path.

PubMed

Xie, Zhiqiang; Shao, Xia; Xin, Yu

2016-01-01

To solve the problem of task scheduling in the cloud computing system, this paper proposes a scheduling algorithm for cloud computing based on the driver of dynamic essential path (DDEP). This algorithm applies a predecessor-task layer priority strategy to solve the problem of constraint relations among task nodes. The strategy assigns different priority values to every task node based on the scheduling order of task node as affected by the constraint relations among task nodes, and the task node list is generated by the different priority value. To address the scheduling order problem in which task nodes have the same priority value, the dynamic essential long path strategy is proposed. This strategy computes the dynamic essential path of the pre-scheduling task nodes based on the actual computation cost and communication cost of task node in the scheduling process. The task node that has the longest dynamic essential path is scheduled first as the completion time of task graph is indirectly influenced by the finishing time of task nodes in the longest dynamic essential path. Finally, we demonstrate the proposed algorithm via simulation experiments using Matlab tools. The experimental results indicate that the proposed algorithm can effectively reduce the task Makespan in most cases and meet a high quality performance objective.

A Scheduling Algorithm for Cloud Computing System Based on the Driver of Dynamic Essential Path

PubMed Central

Xie, Zhiqiang; Shao, Xia; Xin, Yu

2016-01-01

To solve the problem of task scheduling in the cloud computing system, this paper proposes a scheduling algorithm for cloud computing based on the driver of dynamic essential path (DDEP). This algorithm applies a predecessor-task layer priority strategy to solve the problem of constraint relations among task nodes. The strategy assigns different priority values to every task node based on the scheduling order of task node as affected by the constraint relations among task nodes, and the task node list is generated by the different priority value. To address the scheduling order problem in which task nodes have the same priority value, the dynamic essential long path strategy is proposed. This strategy computes the dynamic essential path of the pre-scheduling task nodes based on the actual computation cost and communication cost of task node in the scheduling process. The task node that has the longest dynamic essential path is scheduled first as the completion time of task graph is indirectly influenced by the finishing time of task nodes in the longest dynamic essential path. Finally, we demonstrate the proposed algorithm via simulation experiments using Matlab tools. The experimental results indicate that the proposed algorithm can effectively reduce the task Makespan in most cases and meet a high quality performance objective. PMID:27490901

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

PubMed

Wu, Zuobao; Weng, Michael X

2005-04-01

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

An Optimizing Space Data-Communications Scheduling Method and Algorithm with Interference Mitigation, Generalized for a Broad Class of Optimization Problems

NASA Technical Reports Server (NTRS)

Rash, James

2014-01-01

NASA's space data-communications infrastructure-the Space Network and the Ground Network-provide scheduled (as well as some limited types of unscheduled) data-communications services to user spacecraft. The Space Network operates several orbiting geostationary platforms (the Tracking and Data Relay Satellite System (TDRSS)), each with its own servicedelivery antennas onboard. The Ground Network operates service-delivery antennas at ground stations located around the world. Together, these networks enable data transfer between user spacecraft and their mission control centers on Earth. Scheduling data-communications events for spacecraft that use the NASA communications infrastructure-the relay satellites and the ground stations-can be accomplished today with software having an operational heritage dating from the 1980s or earlier. An implementation of the scheduling methods and algorithms disclosed and formally specified herein will produce globally optimized schedules with not only optimized service delivery by the space data-communications infrastructure but also optimized satisfaction of all user requirements and prescribed constraints, including radio frequency interference (RFI) constraints. Evolutionary algorithms, a class of probabilistic strategies for searching large solution spaces, is the essential technology invoked and exploited in this disclosure. Also disclosed are secondary methods and algorithms for optimizing the execution efficiency of the schedule-generation algorithms themselves. The scheduling methods and algorithms as presented are adaptable to accommodate the complexity of scheduling the civilian and/or military data-communications infrastructure within the expected range of future users and space- or ground-based service-delivery assets. Finally, the problem itself, and the methods and algorithms, are generalized and specified formally. The generalized methods and algorithms are applicable to a very broad class of combinatorial-optimization problems that encompasses, among many others, the problem of generating optimal space-data communications schedules.

Cutting Transportation Costs.

ERIC Educational Resources Information Center

Lewis, Barbara

1982-01-01

Beginning on the front cover, this article tells how school districts are reducing their transportation costs. Particularly effective measures include the use of computers for bus maintenance and scheduling, school board ownership of buses, and the conversion of gasoline-powered buses to alternative fuels. (Author/MLF)

Discrete particle swarm optimization to solve multi-objective limited-wait hybrid flow shop scheduling problem

NASA Astrophysics Data System (ADS)

Santosa, B.; Siswanto, N.; Fiqihesa

2018-04-01

This paper proposes a discrete Particle Swam Optimization (PSO) to solve limited-wait hybrid flowshop scheduing problem with multi objectives. Flow shop schedulimg represents the condition when several machines are arranged in series and each job must be processed at each machine with same sequence. The objective functions are minimizing completion time (makespan), total tardiness time, and total machine idle time. Flow shop scheduling model always grows to cope with the real production system accurately. Since flow shop scheduling is a NP-Hard problem then the most suitable method to solve is metaheuristics. One of metaheuristics algorithm is Particle Swarm Optimization (PSO), an algorithm which is based on the behavior of a swarm. Originally, PSO was intended to solve continuous optimization problems. Since flow shop scheduling is a discrete optimization problem, then, we need to modify PSO to fit the problem. The modification is done by using probability transition matrix mechanism. While to handle multi objectives problem, we use Pareto Optimal (MPSO). The results of MPSO is better than the PSO because the MPSO solution set produced higher probability to find the optimal solution. Besides the MPSO solution set is closer to the optimal solution

Exact and Metaheuristic Approaches for a Bi-Objective School Bus Scheduling Problem

PubMed Central

Chen, Xiaopan; Kong, Yunfeng; Dang, Lanxue; Hou, Yane; Ye, Xinyue

2015-01-01

As a class of hard combinatorial optimization problems, the school bus routing problem has received considerable attention in the last decades. For a multi-school system, given the bus trips for each school, the school bus scheduling problem aims at optimizing bus schedules to serve all the trips within the school time windows. In this paper, we propose two approaches for solving the bi-objective school bus scheduling problem: an exact method of mixed integer programming (MIP) and a metaheuristic method which combines simulated annealing with local search. We develop MIP formulations for homogenous and heterogeneous fleet problems respectively and solve the models by MIP solver CPLEX. The bus type-based formulation for heterogeneous fleet problem reduces the model complexity in terms of the number of decision variables and constraints. The metaheuristic method is a two-stage framework for minimizing the number of buses to be used as well as the total travel distance of buses. We evaluate the proposed MIP and the metaheuristic method on two benchmark datasets, showing that on both instances, our metaheuristic method significantly outperforms the respective state-of-the-art methods. PMID:26176764

Study of turboprop systems reliability and maintenance costs

NASA Technical Reports Server (NTRS)

1978-01-01

The overall reliability and maintenance costs (R&MC's) of past and current turboprop systems were examined. Maintenance cost drivers were found to be scheduled overhaul (40%), lack of modularity particularly in the propeller and reduction gearbox, and lack of inherent durability (reliability) of some parts. Comparisons were made between the 501-D13/54H60 turboprop system and the widely used JT8D turbofan. It was found that the total maintenance cost per flight hour of the turboprop was 75% higher than that of the JT8D turbofan. Part of this difference was due to propeller and gearbox costs being higher than those of the fan and reverser, but most of the difference was in the engine core where the older technology turboprop core maintenance costs were nearly 70 percent higher than for the turbofan. The estimated maintenance cost of both the advanced turboprop and advanced turbofan were less than the JT8D. The conclusion was that an advanced turboprop and an advanced turbofan, using similar cores, will have very competitive maintenance costs per flight hour.

General aviation avionics equipment maintenance

NASA Technical Reports Server (NTRS)

Parker, C. D.; Tommerdahl, J. B.

1978-01-01

Maintenance of general aviation avionics equipment was investigated with emphasis on single engine and light twin engine general aviation aircraft. Factors considered include the regulatory agencies, avionics manufacturers, avionics repair stations, the statistical character of the general aviation community, and owners and operators. The maintenance, environment, and performance, repair costs, and reliability of avionics were defined. It is concluded that a significant economic stratification is reflected in the maintenance problems encountered, that careful attention to installations and use practices can have a very positive impact on maintenance problems, and that new technologies and a general growth in general aviation will impact maintenance.

A Genetic Algorithm Tool (splicer) for Complex Scheduling Problems and the Space Station Freedom Resupply Problem

NASA Technical Reports Server (NTRS)

Wang, Lui; Valenzuela-Rendon, Manuel

1993-01-01

The Space Station Freedom will require the supply of items in a regular fashion. A schedule for the delivery of these items is not easy to design due to the large span of time involved and the possibility of cancellations and changes in shuttle flights. This paper presents the basic concepts of a genetic algorithm model, and also presents the results of an effort to apply genetic algorithms to the design of propellant resupply schedules. As part of this effort, a simple simulator and an encoding by which a genetic algorithm can find near optimal schedules have been developed. Additionally, this paper proposes ways in which robust schedules, i.e., schedules that can tolerate small changes, can be found using genetic algorithms.

Learning Search Control Knowledge for Deep Space Network Scheduling

NASA Technical Reports Server (NTRS)

Gratch, Jonathan; Chien, Steve; DeJong, Gerald

1993-01-01

While the general class of most scheduling problems is NP-hard in worst-case complexity, in practice, for specific distributions of problems and constraints, domain-specific solutions have been shown to perform in much better than exponential time.

Vehicle and driver scheduling for public transit.

DOT National Transportation Integrated Search

2009-08-01

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

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

USGS Publications Warehouse

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

2014-01-01

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

An Efficient Downlink Scheduling Strategy Using Normal Graphs for Multiuser MIMO Wireless Systems

NASA Astrophysics Data System (ADS)

Chen, Jung-Chieh; Wu, Cheng-Hsuan; Lee, Yao-Nan; Wen, Chao-Kai

Inspired by the success of the low-density parity-check (LDPC) codes in the field of error-control coding, in this paper we propose transforming the downlink multiuser multiple-input multiple-output scheduling problem into an LDPC-like problem using the normal graph. Based on the normal graph framework, soft information, which indicates the probability that each user will be scheduled to transmit packets at the access point through a specified angle-frequency sub-channel, is exchanged among the local processors to iteratively optimize the multiuser transmission schedule. Computer simulations show that the proposed algorithm can efficiently schedule simultaneous multiuser transmission which then increases the overall channel utilization and reduces the average packet delay.

Predit: A temporal predictive framework for scheduling systems

NASA Technical Reports Server (NTRS)

Paolucci, E.; Patriarca, E.; Sem, M.; Gini, G.

1992-01-01

Scheduling can be formalized as a Constraint Satisfaction Problem (CSP). Within this framework activities belonging to a plan are interconnected via temporal constraints that account for slack among them. Temporal representation must include methods for constraints propagation and provide a logic for symbolic and numerical deductions. In this paper we describe a support framework for opportunistic reasoning in constraint directed scheduling. In order to focus the attention of an incremental scheduler on critical problem aspects, some discrete temporal indexes are presented. They are also useful for the prediction of the degree of resources contention. The predictive method expressed through our indexes can be seen as a Knowledge Source for an opportunistic scheduler with a blackboard architecture.

Low-Cost Oil Quality Sensor Based on Changes in Complex Permittivity

PubMed Central

Pérez, Angel Torres; Hadfield, Mark

2011-01-01

Real time oil quality monitoring techniques help to protect important industry assets, minimize downtime and reduce maintenance costs. The measurement of a lubricant’s complex permittivity is an effective indicator of the oil degradation process and it can be useful in condition based maintenance (CBM) to select the most adequate oil replacement maintenance schedules. A discussion of the working principles of an oil quality sensor based on a marginal oscillator to monitor the losses of the dielectric at high frequencies (>1 MHz) is presented. An electronic design procedure is covered which results in a low cost, effective and ruggedized sensor implementation suitable for use in harsh environments. PMID:22346666

Solving complex maintenance planning optimization problems using stochastic simulation and multi-criteria fuzzy decision making

DOE Office of Scientific and Technical Information (OSTI.GOV)

Tahvili, Sahar; Österberg, Jonas; Silvestrov, Sergei

One of the most important factors in the operations of many cooperations today is to maximize profit and one important tool to that effect is the optimization of maintenance activities. Maintenance activities is at the largest level divided into two major areas, corrective maintenance (CM) and preventive maintenance (PM). When optimizing maintenance activities, by a maintenance plan or policy, we seek to find the best activities to perform at each point in time, be it PM or CM. We explore the use of stochastic simulation, genetic algorithms and other tools for solving complex maintenance planning optimization problems in terms ofmore » a suggested framework model based on discrete event simulation.« less

Distributed Sleep Scheduling in Wireless Sensor Networks via Fractional Domatic Partitioning

NASA Astrophysics Data System (ADS)

Schumacher, André; Haanpää, Harri

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

A Solution Method of Scheduling Problem with Worker Allocation by a Genetic Algorithm

NASA Astrophysics Data System (ADS)

Osawa, Akira; Ida, Kenichi

In a scheduling problem with worker allocation (SPWA) proposed by Iima et al, the worker's skill level to each machine is all the same. However, each worker has a different skill level for each machine in the real world. For that reason, we propose a new model of SPWA in which a worker has the different skill level to each machine. To solve the problem, we propose a new GA for SPWA consisting of the following new three procedures, shortening of idle time, modifying infeasible solution to feasible solution, and a new selection method for GA. The effectiveness of the proposed algorithm is clarified by numerical experiments using benchmark problems for job-shop scheduling.

Psychometric Properties of the Disability Assessment Schedule (DAS) for Behavior Problems: An Independent Investigation

ERIC Educational Resources Information Center

Tsakanikos, Elias; Underwood, Lisa; Sturmey, Peter; Bouras, Nick; McCarthy, Jane

2011-01-01

The present study employed the Disability Assessment Schedule (DAS) to assess problem behaviors in a large sample of adults with ID (N = 568) and evaluate the psychometric properties of this instrument. Although the DAS problem behaviors were found to be internally consistent (Cronbach's [alpha] = 0.87), item analysis revealed one weak item…

An Optimizing Space Data-Communications Scheduling Method and Algorithm with Interference Mitigation, Generalized for a Broad Class of Optimization Problems

NASA Technical Reports Server (NTRS)

Rash, James L.

2010-01-01

NASA's space data-communications infrastructure, the Space Network and the Ground Network, provide scheduled (as well as some limited types of unscheduled) data-communications services to user spacecraft via orbiting relay satellites and ground stations. An implementation of the methods and algorithms disclosed herein will be a system that produces globally optimized schedules with not only optimized service delivery by the space data-communications infrastructure but also optimized satisfaction of all user requirements and prescribed constraints, including radio frequency interference (RFI) constraints. Evolutionary search, a class of probabilistic strategies for searching large solution spaces, constitutes the essential technology in this disclosure. Also disclosed are methods and algorithms for optimizing the execution efficiency of the schedule-generation algorithm itself. The scheduling methods and algorithms as presented are adaptable to accommodate the complexity of scheduling the civilian and/or military data-communications infrastructure. Finally, the problem itself, and the methods and algorithms, are generalized and specified formally, with applicability to a very broad class of combinatorial optimization problems.

Scheduling: A guide for program managers

NASA Technical Reports Server (NTRS)

1994-01-01

The following topics are discussed concerning scheduling: (1) milestone scheduling; (2) network scheduling; (3) program evaluation and review technique; (4) critical path method; (5) developing a network; (6) converting an ugly duckling to a swan; (7) network scheduling problem; (8) (9) network scheduling when resources are limited; (10) multi-program considerations; (11) influence on program performance; (12) line-of-balance technique; (13) time management; (14) recapitulization; and (15) analysis.

Automated Scheduling Via Artificial Intelligence

NASA Technical Reports Server (NTRS)

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.

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

NASA Astrophysics Data System (ADS)

Qi, Xuan

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

Dataflow Design Tool: User's Manual

NASA Technical Reports Server (NTRS)

Jones, Robert L., III

1996-01-01

The Dataflow Design Tool is a software tool for selecting a multiprocessor scheduling solution for a class of computational problems. The problems of interest are those that can be described with a dataflow graph and are intended to be executed repetitively on a set of identical processors. Typical applications include signal processing and control law problems. The software tool implements graph-search algorithms and analysis techniques based on the dataflow paradigm. Dataflow analyses provided by the software are introduced and shown to effectively determine performance bounds, scheduling constraints, and resource requirements. The software tool provides performance optimization through the inclusion of artificial precedence constraints among the schedulable tasks. The user interface and tool capabilities are described. Examples are provided to demonstrate the analysis, scheduling, and optimization functions facilitated by the tool.

Targeted Cleaning.

ERIC Educational Resources Information Center

Frank, David J.

1998-01-01

Discusses the creation of an effective carpet vacuuming program by combining area usage assessment and vacuuming requirements with a scheduling plan. Also explains vacuum cleaner suction and filtration and how it makes custodian work more efficient. A complementary article discusses creating an effective floor-maintenance plan for resilient…

41 CFR 109-38.502 - Guidelines.

Code of Federal Regulations, 2010 CFR

2010-07-01

... 38-MOTOR EQUIPMENT MANAGEMENT 38.5-Scheduled Maintenance § 109-38.502 Guidelines. ... 41 Public Contracts and Property Management 3 2010-07-01 2010-07-01 false Guidelines. 109-38.502 Section 109-38.502 Public Contracts and Property Management Federal Property Management Regulations System...

18 CFR 125.3 - Schedule of records and periods of retention.

Code of Federal Regulations, 2010 CFR

2010-04-01

... and agreements. 4. Accountants' and auditors' reports. Information Technology Management 5. Automatic.... Vouchers. Insurance 12. Insurance records. Operations and Maintenance 13.1. Production—Public utilities and licensees (less nuclear). 13.2 Production—Nuclear. 14. Transmission and distribution—Public utilities and...

Kuipers uses vacuum cleaner while performing maintenance in the Columbus Module

NASA Image and Video Library

2012-02-22

ISS030-E-093398 (22 Feb. 2012) --- European Space Agency astronaut Andre Kuipers, Expedition 30 flight engineer, uses a vacuum cleaner while performing the scheduled extensive cleanup of ventilation systems in the Columbus laboratory of the International Space Station.

Analysis of Rail Defect Data from the Burlington Northern Railroad and the Atchison, Topeka and Santa Fe Railroad

DOT National Transportation Integrated Search

1984-07-01

Rail descriptive and defect occurrence information from the Burlington Northern and Atchison, Topeka and Santa Fe railroads is given and analyzed. Track data includes information on track type, when laid, maintenance schedules, etc.

40 CFR 243.204-2 - Recommended procedures: Operations.

Code of Federal Regulations, 2010 CFR

2010-07-01

... collection system. These records should be used for scheduling maintenance and replacement, for budgeting, and for system evaluation and comparison. (b) The collection system should be reviewed on a regular...) SOLID WASTES GUIDELINES FOR THE STORAGE AND COLLECTION OF RESIDENTIAL, COMMERCIAL, AND INSTITUTIONAL...

Advanced rocket propulsion

NASA Technical Reports Server (NTRS)

Obrien, Charles J.

1993-01-01

Existing NASA research contracts are supporting development of advanced reinforced polymer and metal matrix composites for use in liquid rocket engines of the future. Advanced rocket propulsion concepts, such as modular platelet engines, dual-fuel dual-expander engines, and variable mixture ratio engines, require advanced materials and structures to reduce overall vehicle weight as well as address specific propulsion system problems related to elevated operating temperatures, new engine components, and unique operating processes. High performance propulsion systems with improved manufacturability and maintainability are needed for single stage to orbit vehicles and other high performance mission applications. One way to satisfy these needs is to develop a small engine which can be clustered in modules to provide required levels of total thrust. This approach should reduce development schedule and cost requirements by lowering hardware lead times and permitting the use of existing test facilities. Modular engines should also reduce operational costs associated with maintenance and parts inventories.

Solving cyclical nurse scheduling problem using preemptive goal programming

NASA Astrophysics Data System (ADS)

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.

Neighbourhood generation mechanism applied in simulated annealing to job shop scheduling problems

NASA Astrophysics Data System (ADS)

Cruz-Chávez, Marco Antonio

2015-11-01

This paper presents a neighbourhood generation mechanism for the job shop scheduling problems (JSSPs). In order to obtain a feasible neighbour with the generation mechanism, it is only necessary to generate a permutation of an adjacent pair of operations in a scheduling of the JSSP. If there is no slack time between the adjacent pair of operations that is permuted, then it is proven, through theory and experimentation, that the new neighbour (schedule) generated is feasible. It is demonstrated that the neighbourhood generation mechanism is very efficient and effective in a simulated annealing.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Russell, J.S.

Several factors in the development of the East Wilmington oil field by THUMS Long Beach Co. are described. These include: critical path scheduling, complex stratigraphy, reservoir engineering, drilling program, production methods, pressure maintenance, crude oil processing, automation, transportation facilities, service lines, and electrical facilities. The complexity and closely scheduled operational events interwoven in the THUMS project demands a method for the carefully planned sequence of jobs to be done, beginning with island construction up through routine production and to the LACT system. These demanding requirements necessitated the use of a critical path scheduling program. It was decided to use themore » program evaluation technique. This technique is used to assign responsibilities for individual assignments to time assignments, and to keep the overall program on schedule. The stratigraphy of East Wilmington complicates all engineering functions associated with recovery methods and reservoir evaluation. At least 5 major faults are anticipated.« less

The Offering, Scheduling and Maintenance of Elective Advanced Pharmacy Practice Experiences

PubMed Central

Brown, Rex O.; Patel, Zalak V.; Foster, Stephan L.

2015-01-01

The Accreditation Council for Pharmacy Education (ACPE) provides standards for colleges of pharmacy to assist in the provision of pharmacy education to student pharmacists. An integral part of all college educational programs includes the provision of experiential learning. Experiential learning allows students to gain real-world experience in direct patient care during completion of the curriculum. All college of pharmacy programs provide several Advanced Pharmacy Practice Experiences (APPEs), which include a balance between the four required experiences and a number of other required or elective APPEs. Required APPEs include advanced community, advanced institutional, ambulatory care, and general medicine. The elective APPEs include a myriad of opportunities to help provide a balanced education in experiential learning for student pharmacists. These unique opportunities help to expose student pharmacists to different career tracks that they may not have been able to experience otherwise. Not all colleges offer enough elective APPEs to enable the student pharmacist to obtain experiences in a defined area. Such an approach is required to produce skilled pharmacy graduates that are capable to enter practice in various settings. Elective APPEs are scheduled logically and are based upon student career interest and site availability. This article describes the offering, scheduling and maintenance of different elective APPEs offered by The University of Tennessee College of Pharmacy. PMID:28975920

The Public School Infrastructure Problem: Deteriorating Buildings and Deferred Maintenance

ERIC Educational Resources Information Center

Hunter, Richard C.

2009-01-01

The deterioration of public school buildings is more prevalent in large cities that, because of funding shortfalls, have deferred maintenance and require huge sums to bring their buildings up to acceptable standards. Cities such as New York will require approximately $680 million to address the problem of deferred maintenance for needed painting,…

Philosophy of Maintenance and Welfare of Parents and Senior Citizens Act, 2007 in India: An Appraisal

NASA Astrophysics Data System (ADS)

Thakur, Runa Mehta

2012-09-01

When the winds of change blow all around and new situations and conditions emerge, this necessitate newer responses conducive to achieve the broad national goal. There has been a steady rise in the population of older persons in India, because of an appreciable increase in the life expectancy. But with the increase in population the traditional norms and status of the senior citizens have deteriorated. The result of withering of the joint family system, industrialization, globalization etc. is that a large number of parents are not being maintained by their children, as was the normal social practice. Consequently, the elders are now exposed to emotional neglect and to lack of physical and financial support. They are facing a lot of problems in the absence of adequate social security. Keeping in view these facts, to ensure that the children perform their moral obligation towards their parents and to eliminate the agony and sufferings of this vulnerable section of society, legislation for the welfare of the Parents and Senior Citizens in pursuance of the provisions of Article 41 read with Entry 23 of the Concurrent List (Schedule VIII) of the Constitution of India has been enacted and titled as The Maintenance and Welfare of Parents and Senior Citizens Act, 2007.

Block Scheduling in High Schools.

ERIC Educational Resources Information Center

Irmsher, Karen

1996-01-01

Block Scheduling has been considered a cure for a lengthy list of educational problems. This report reviews the literature on block schedules and describes some Oregon high schools that have integrated block scheduling. Major disadvantages included resistance to change and requirements that teachers change their teaching strategies. There is…

Deadlock-free genetic scheduling algorithm for automated manufacturing systems based on deadlock control policy.

PubMed

Xing, KeYi; Han, LiBin; Zhou, MengChu; Wang, Feng

2012-06-01

Deadlock-free control and scheduling are vital for optimizing the performance of automated manufacturing systems (AMSs) with shared resources and route flexibility. Based on the Petri net models of AMSs, this paper embeds the optimal deadlock avoidance policy into the genetic algorithm and develops a novel deadlock-free genetic scheduling algorithm for AMSs. A possible solution of the scheduling problem is coded as a chromosome representation that is a permutation with repetition of parts. By using the one-step look-ahead method in the optimal deadlock control policy, the feasibility of a chromosome is checked, and infeasible chromosomes are amended into feasible ones, which can be easily decoded into a feasible deadlock-free schedule. The chromosome representation and polynomial complexity of checking and amending procedures together support the cooperative aspect of genetic search for scheduling problems strongly.

Education and Social Equity: With a Special Focus on Scheduled Castes and Scheduled Tribes in Elementary Education. CREATE Pathways to Access. Research Monograph No. 19

ERIC Educational Resources Information Center

Sedwal, Mona; Kamat, Sangeeta

2008-01-01

The Scheduled Castes (SCs, also known as Dalits) and Scheduled Tribes (STs, also known as Adivasis) are among the most socially and educationally disadvantaged groups in India. This paper examines issues concerning school access and equity for Scheduled Caste and Scheduled Tribe communities and also highlights their unique problems, which may…

A modified genetic algorithm with fuzzy roulette wheel selection for job-shop scheduling problems

NASA Astrophysics Data System (ADS)

Thammano, Arit; Teekeng, Wannaporn

2015-05-01

The job-shop scheduling problem is one of the most difficult production planning problems. Since it is in the NP-hard class, a recent trend in solving the job-shop scheduling problem is shifting towards the use of heuristic and metaheuristic algorithms. This paper proposes a novel metaheuristic algorithm, which is a modification of the genetic algorithm. This proposed algorithm introduces two new concepts to the standard genetic algorithm: (1) fuzzy roulette wheel selection and (2) the mutation operation with tabu list. The proposed algorithm has been evaluated and compared with several state-of-the-art algorithms in the literature. The experimental results on 53 JSSPs show that the proposed algorithm is very effective in solving the combinatorial optimization problems. It outperforms all state-of-the-art algorithms on all benchmark problems in terms of the ability to achieve the optimal solution and the computational time.

Automated Platform Management System Scheduling

NASA Technical Reports Server (NTRS)

Hull, Larry G.

1990-01-01

The Platform Management System was established to coordinate the operation of platform systems and instruments. The management functions are split between ground and space components. Since platforms are to be out of contact with the ground more than the manned base, the on-board functions are required to be more autonomous than those of the manned base. Under this concept, automated replanning and rescheduling, including on-board real-time schedule maintenance and schedule repair, are required to effectively and efficiently meet Space Station Freedom mission goals. In a FY88 study, we developed several promising alternatives for automated platform planning and scheduling. We recommended both a specific alternative and a phased approach to automated platform resource scheduling. Our recommended alternative was based upon use of exactly the same scheduling engine in both ground and space components of the platform management system. Our phased approach recommendation was based upon evolutionary development of the platform. In the past year, we developed platform scheduler requirements and implemented a rapid prototype of a baseline platform scheduler. Presently we are rehosting this platform scheduler rapid prototype and integrating the scheduler prototype into two Goddard Space Flight Center testbeds, as the ground scheduler in the Scheduling Concepts, Architectures, and Networks Testbed and as the on-board scheduler in the Platform Management System Testbed. Using these testbeds, we will investigate rescheduling issues, evaluate operational performance and enhance the platform scheduler prototype to demonstrate our evolutionary approach to automated platform scheduling. The work described in this paper was performed prior to Space Station Freedom rephasing, transfer of platform responsibility to Code E, and other recently discussed changes. We neither speculate on these changes nor attempt to predict the impact of the final decisions. As a consequence some of our work and results may be outdated when this paper is published.

Cost-efficient scheduling of FAST observations

NASA Astrophysics Data System (ADS)

Luo, Qi; Zhao, Laiping; Yu, Ce; Xiao, Jian; Sun, Jizhou; Zhu, Ming; Zhong, Yi

2018-03-01

A cost-efficient schedule for the Five-hundred-meter Aperture Spherical radio Telescope (FAST) requires to maximize the number of observable proposals and the overall scientific priority, and minimize the overall slew-cost generated by telescope shifting, while taking into account the constraints including the astronomical objects visibility, user-defined observable times, avoiding Radio Frequency Interference (RFI). In this contribution, first we solve the problem of maximizing the number of observable proposals and scientific priority by modeling it as a Minimum Cost Maximum Flow (MCMF) problem. The optimal schedule can be found by any MCMF solution algorithm. Then, for minimizing the slew-cost of the generated schedule, we devise a maximally-matchable edges detection-based method to reduce the problem size, and propose a backtracking algorithm to find the perfect matching with minimum slew-cost. Experiments on a real dataset from NASA/IPAC Extragalactic Database (NED) show that, the proposed scheduler can increase the usage of available times with high scientific priority and reduce the slew-cost significantly in a very short time.

Using the principles of circadian physiology enhances shift schedule design

DOE Office of Scientific and Technical Information (OSTI.GOV)

Connolly, J.J.; Moore-Ede, M.C.

1987-01-01

Nuclear power plants must operate 24 h, 7 days a week. For the most part, shift schedules currently in use at nuclear power plants have been designed to meet operational needs without considering the biological clocks of the human operators. The development of schedules that also take circadian principles into account is a positive step that can be taken to improve plant safety by optimizing operator alertness. These schedules reduce the probability of human errors especially during backshifts. In addition, training programs that teach round-the-clock workers how to deal with the problems of shiftwork can help to optimize performance andmore » alertness. These programs teach shiftworkers the underlying causes of the sleep problems associated with shiftwork and also provide coping strategies for improving sleep and dealing with the transition between shifts. When these training programs are coupled with an improved schedule, the problems associated with working round-the-clock can be significantly reduced.« less

Meta-RaPS Algorithm for the Aerial Refueling Scheduling Problem

NASA Technical Reports Server (NTRS)

Kaplan, Sezgin; Arin, Arif; Rabadi, Ghaith

2011-01-01

The Aerial Refueling Scheduling Problem (ARSP) can be defined as determining the refueling completion times for each fighter aircraft (job) on multiple tankers (machines). ARSP assumes that jobs have different release times and due dates, The total weighted tardiness is used to evaluate schedule's quality. Therefore, ARSP can be modeled as a parallel machine scheduling with release limes and due dates to minimize the total weighted tardiness. Since ARSP is NP-hard, it will be more appropriate to develop a pproimate or heuristic algorithm to obtain solutions in reasonable computation limes. In this paper, Meta-Raps-ATC algorithm is implemented to create high quality solutions. Meta-RaPS (Meta-heuristic for Randomized Priority Search) is a recent and promising meta heuristic that is applied by introducing randomness to a construction heuristic. The Apparent Tardiness Rule (ATC), which is a good rule for scheduling problems with tardiness objective, is used to construct initial solutions which are improved by an exchanging operation. Results are presented for generated instances.

EUROPA2: Plan Database Services for Planning and Scheduling Applications

NASA Technical Reports Server (NTRS)

Bedrax-Weiss, Tania; Frank, Jeremy; Jonsson, Ari; McGann, Conor

2004-01-01

NASA missions require solving a wide variety of planning and scheduling problems with temporal constraints; simple resources such as robotic arms, communications antennae and cameras; complex replenishable resources such as memory, power and fuel; and complex constraints on geometry, heat and lighting angles. Planners and schedulers that solve these problems are used in ground tools as well as onboard systems. The diversity of planning problems and applications of planners and schedulers precludes a one-size fits all solution. However, many of the underlying technologies are common across planning domains and applications. We describe CAPR, a formalism for planning that is general enough to cover a wide variety of planning and scheduling domains of interest to NASA. We then describe EUROPA(sub 2), a software framework implementing CAPR. EUROPA(sub 2) provides efficient, customizable Plan Database Services that enable the integration of CAPR into a wide variety of applications. We describe the design of EUROPA(sub 2) from the perspective of both modeling, customization and application integration to different classes of NASA missions.

A B-52H, tail number 61-0025, arrives at NASA's Dryden Flight Research Center after landing July 30,

NASA Technical Reports Server (NTRS)

2001-01-01

NASA Dryden Flight Research Center, Edwards, California, received an 'H' model B-52 Stratofortress aircraft on July 30, 2001. The B-52H will be used as an air-launch aircraft supporting NASA's flight research and advanced technology demonstration efforts. Dryden received the B-52H from the U.S. Air Force's (USAF) 23rd Bomb Squadron, 5th Bombardment Wing (Air Combat Command), located at Minot AFB, N.D. A USAF crew flew the aircraft to Dryden. The aircraft, USAF tail number 61-0025, will be loaned initially, then later transferred from the USAF to NASA. The B-52H is scheduled to leave Dryden Aug. 2 for de-militarization and Programmed Depot Maintenance (PDM) at Tinker Air Force Base (AFB), Oklahoma. The depot-level maintenance is scheduled to last about six months and includes a thorough maintenance and inspection process. The newly arrived B-52H is slated to replace Dryden's famous B-52B '008,' in the 2003-2004 timeframe. It will take about one year for the B-52H to be ready for flight research duties. This time includes PDM, construction of the new pylon, installation of the flight research instrumentation equipment, and aircraft envelope clearance flights.

A B-52H, on loan to NASA's Dryden Flight Research Center, makes a pass down the runway prior to land

NASA Technical Reports Server (NTRS)

2001-01-01

NASA Dryden Flight Research Center, Edwards, California, received an 'H' model B-52 Stratofortress aircraft on July 30, 2001. The B-52H will be used as an air-launch aircraft supporting NASA's flight research and advanced technology demonstration efforts. Dryden received the B-52H from the U.S. Air Force's (USAF) 23rd Bomb Squadron, 5th Bombardment Wing (Air Combat Command), located at Minot AFB, N.D. A USAF crew flew the aircraft to Dryden. The aircraft, USAF tail number 61-0025, will be loaned initially, then later transferred from the USAF to NASA. The B-52H is scheduled to leave Dryden Aug. 2 for de-militarization and Programmed Depot Maintenance (PDM) at Tinker Air Force Base (AFB), Oklahoma. The depot-level maintenance is scheduled to last about six months and includes a thorough maintenance and inspection process. The newly arrived B-52H is slated to replace Dryden's famous B-52B '008,' in the 2003-2004 timeframe. It will take about one year for the B-52H to be ready for flight research duties. This time includes PDM, construction of the new pylon, installation of the flight research instrumentation equipment, and aircraft envelope clearance flights.

Hypertext-based design of a user interface for scheduling

NASA Technical Reports Server (NTRS)

Woerner, Irene W.; Biefeld, Eric

1993-01-01

Operations Mission Planner (OMP) is an ongoing research project at JPL that utilizes AI techniques to create an intelligent, automated planning and scheduling system. The information space reflects the complexity and diversity of tasks necessary in most real-world scheduling problems. Thus the problem of the user interface is to present as much information as possible at a given moment and allow the user to quickly navigate through the various types of displays. This paper describes a design which applies the hypertext model to solve these user interface problems. The general paradigm is to provide maps and search queries to allow the user to quickly find an interesting conflict or problem, and then allow the user to navigate through the displays in a hypertext fashion.

Guidelines to Language Teaching in Classroom and Laboratory.

ERIC Educational Resources Information Center

Iodice, Don R.

Guidelines for evaluating, establishing, and administrating classroom and laboratory language programs are offered in this report. Attention is focused on the language laboratory, with sections on its use, scheduling, materials and texts, preparation of audio materials, preparation of tests, supervision, discipline, and maintenance. Briefer…

76 FR 10233 - Schedule of Water Charges

Federal Register 2010, 2011, 2012, 2013, 2014

2011-02-24

..., operation, maintenance, replacement, reserves and associated administrative costs.'' Id., par. A.2.b. The...'s Beltzville and Blue Marsh reservoirs. The rates established in 1978--$60 per million gallons for... reference, Water resources, Water reservoirs, Water supply, Watersheds. For the reasons set forth in the...

Scheduling the resident 80-hour work week: an operations research algorithm.

PubMed

Day, T Eugene; Napoli, Joseph T; Kuo, Paul C

2006-01-01

The resident 80-hour work week requires that programs now schedule duty hours. Typically, scheduling is performed in an empirical "trial-and-error" fashion. However, this is a classic "scheduling" problem from the field of operations research (OR). It is similar to scheduling issues that airlines must face with pilots and planes routing through various airports at various times. The authors hypothesized that an OR approach using iterative computer algorithms could provide a rational scheduling solution. Institution-specific constraints of the residency problem were formulated. A total of 56 residents are rotating through 4 hospitals. Additional constraints were dictated by the Residency Review Committee (RRC) rules or the specific surgical service. For example, at Hospital 1, during the weekday hours between 6 am and 6 pm, there will be a PGY4 or PGY5 and a PGY2 or PGY3 on-duty to cover Service "A." A series of equations and logic statements was generated to satisfy all constraints and requirements. These were restated in the Optimization Programming Language used by the ILOG software suite for solving mixed integer programming problems. An integer programming solution was generated to this resource-constrained assignment problem. A total of 30,900 variables and 12,443 constraints were required. A total of man-hours of programming were used; computer run-time was 25.9 hours. A weekly schedule was generated for each resident that satisfied the RRC regulations while fulfilling all stated surgical service requirements. Each required between 64 and 80 weekly resident duty hours. The authors conclude that OR is a viable approach to schedule resident work hours. This technique is sufficiently robust to accommodate changes in resident numbers, service requirements, and service and hospital rotations.

Energy-efficient approach to minimizing the energy consumption in an extended job-shop scheduling problem

NASA Astrophysics Data System (ADS)

Tang, Dunbing; Dai, Min

2015-09-01

The traditional production planning and scheduling problems consider performance indicators like time, cost and quality as optimization objectives in manufacturing processes. However, environmentally-friendly factors like energy consumption of production have not been completely taken into consideration. Against this background, this paper addresses an approach to modify a given schedule generated by a production planning and scheduling system in a job shop floor, where machine tools can work at different cutting speeds. It can adjust the cutting speeds of the operations while keeping the original assignment and processing sequence of operations of each job fixed in order to obtain energy savings. First, the proposed approach, based on a mixed integer programming mathematical model, changes the total idle time of the given schedule to minimize energy consumption in the job shop floor while accepting the optimal solution of the scheduling objective, makespan. Then, a genetic-simulated annealing algorithm is used to explore the optimal solution due to the fact that the problem is strongly NP-hard. Finally, the effectiveness of the approach is performed smalland large-size instances, respectively. The experimental results show that the approach can save 5%-10% of the average energy consumption while accepting the optimal solution of the makespan in small-size instances. In addition, the average maximum energy saving ratio can reach to 13%. And it can save approximately 1%-4% of the average energy consumption and approximately 2.4% of the average maximum energy while accepting the near-optimal solution of the makespan in large-size instances. The proposed research provides an interesting point to explore an energy-aware schedule optimization for a traditional production planning and scheduling problem.

Reusable Rocket Engine Operability Modeling and Analysis

NASA Technical Reports Server (NTRS)

Christenson, R. L.; Komar, D. R.

1998-01-01

This paper describes the methodology, model, input data, and analysis results of a reusable launch vehicle engine operability study conducted with the goal of supporting design from an operations perspective. Paralleling performance analyses in schedule and method, this requires the use of metrics in a validated operations model useful for design, sensitivity, and trade studies. Operations analysis in this view is one of several design functions. An operations concept was developed given an engine concept and the predicted operations and maintenance processes incorporated into simulation models. Historical operations data at a level of detail suitable to model objectives were collected, analyzed, and formatted for use with the models, the simulations were run, and results collected and presented. The input data used included scheduled and unscheduled timeline and resource information collected into a Space Transportation System (STS) Space Shuttle Main Engine (SSME) historical launch operations database. Results reflect upon the importance not only of reliable hardware but upon operations and corrective maintenance process improvements.

Pharmacokinetics of metronomic chemotherapy: a neglected but crucial aspect.

PubMed

Bocci, Guido; Kerbel, Robert S

2016-11-01

Metronomic chemotherapy describes the close, regular administration of chemotherapy drugs at less-toxic doses over prolonged periods of time. In 2015, the results of randomized phase III clinical trials demonstrated encouraging, albeit limited, efficacy benefits of metronomic chemotherapy regimens administered as adjuvant maintenance therapy for the treatment of breast cancer, or as maintenance therapy in combination with an antiangiogenic agent for metastatic colorectal cancer. Owing to the investigational nature of this approach, metronomic chemotherapy regimens are highly empirical in terms of the optimal dose and schedule for the drugs administered; therefore, greater knowledge of the pharmacokinetics of metronomic chemotherapy is critical to the future success of this treatment strategy. Unfortunately, such preclinical and clinical pharmacokinetic studies are rare. Herein, we present situations in which active drug concentrations have been achieved with metronomic schedules, and discuss their associated pharmacokinetic parameters. We summarize examples from the limited number of clinical studies in order to illustrate the importance of assessing such pharmacokinetic parameters, and discuss the influence this information can have on improving efficacy and reducing toxicity.

Total quality assurance

NASA Astrophysics Data System (ADS)

Louzon, E.

1989-12-01

Quality, cost, and schedule are three factors affecting the competitiveness of a company; they require balancing so that products of acceptable quality are delivered, on time and at a competitive cost. Quality costs comprise investment in quality maintenance and failure costs which arise from failure to maintain standards. The basic principle for achieving the required quality at minimum cost is that of prevention of failures, etc., through production control, attention to manufacturing practices, and appropriate management and training. Total quality control involves attention to the product throughout its life cycle, including in-service performance evaluation, servicing, and maintenance.

Integrated production and distribution scheduling problems related to fixed delivery departure dates and weights of late orders.

PubMed

Li, Shanlin; Li, Maoqin

2015-01-01

We consider an integrated production and distribution scheduling problem faced by a typical make-to-order manufacturer which relies on a third-party logistics (3PL) provider for finished product delivery to customers. In the beginning of a planning horizon, the manufacturer has received a set of orders to be processed on a single production line. Completed orders are delivered to customers by a finite number of vehicles provided by the 3PL company which follows a fixed daily or weekly shipping schedule such that the vehicles have fixed departure dates which are not part of the decisions. The problem is to find a feasible schedule that minimizes one of the following objective functions when processing times and weights are oppositely ordered: (1) the total weight of late orders and (2) the number of vehicles used subject to the condition that the total weight of late orders is minimum. We show that both problems are solvable in polynomial time.

Scheduling Non-Preemptible Jobs to Minimize Peak Demand

DOE PAGES

Yaw, Sean; Mumey, Brendan

2017-10-28

Our paper examines an important problem in smart grid energy scheduling; peaks in power demand are proportionally more expensive to generate and provision for. The issue is exacerbated in local microgrids that do not benefit from the aggregate smoothing experienced by large grids. Demand-side scheduling can reduce these peaks by taking advantage of the fact that there is often flexibility in job start times. We then focus attention on the case where the jobs are non-preemptible, meaning once started, they run to completion. The associated optimization problem is called the peak demand minimization problem, and has been previously shown tomore » be NP-hard. These results include an optimal fixed-parameter tractable algorithm, a polynomial-time approximation algorithm, as well as an effective heuristic that can also be used in an online setting of the problem. Simulation results show that these methods can reduce peak demand by up to 50% versus on-demand scheduling for household power jobs.« less

Integrated Production and Distribution Scheduling Problems Related to Fixed Delivery Departure Dates and Weights of Late Orders

PubMed Central

Li, Shanlin; Li, Maoqin

2015-01-01

We consider an integrated production and distribution scheduling problem faced by a typical make-to-order manufacturer which relies on a third-party logistics (3PL) provider for finished product delivery to customers. In the beginning of a planning horizon, the manufacturer has received a set of orders to be processed on a single production line. Completed orders are delivered to customers by a finite number of vehicles provided by the 3PL company which follows a fixed daily or weekly shipping schedule such that the vehicles have fixed departure dates which are not part of the decisions. The problem is to find a feasible schedule that minimizes one of the following objective functions when processing times and weights are oppositely ordered: (1) the total weight of late orders and (2) the number of vehicles used subject to the condition that the total weight of late orders is minimum. We show that both problems are solvable in polynomial time. PMID:25785285

Scheduling Non-Preemptible Jobs to Minimize Peak Demand

DOE Office of Scientific and Technical Information (OSTI.GOV)

Yaw, Sean; Mumey, Brendan

Our paper examines an important problem in smart grid energy scheduling; peaks in power demand are proportionally more expensive to generate and provision for. The issue is exacerbated in local microgrids that do not benefit from the aggregate smoothing experienced by large grids. Demand-side scheduling can reduce these peaks by taking advantage of the fact that there is often flexibility in job start times. We then focus attention on the case where the jobs are non-preemptible, meaning once started, they run to completion. The associated optimization problem is called the peak demand minimization problem, and has been previously shown tomore » be NP-hard. These results include an optimal fixed-parameter tractable algorithm, a polynomial-time approximation algorithm, as well as an effective heuristic that can also be used in an online setting of the problem. Simulation results show that these methods can reduce peak demand by up to 50% versus on-demand scheduling for household power jobs.« less

A generalized network flow model for the multi-mode resource-constrained project scheduling problem with discounted cash flows

NASA Astrophysics Data System (ADS)

Chen, Miawjane; Yan, Shangyao; Wang, Sin-Siang; Liu, Chiu-Lan

2015-02-01

An effective project schedule is essential for enterprises to increase their efficiency of project execution, to maximize profit, and to minimize wastage of resources. Heuristic algorithms have been developed to efficiently solve the complicated multi-mode resource-constrained project scheduling problem with discounted cash flows (MRCPSPDCF) that characterize real problems. However, the solutions obtained in past studies have been approximate and are difficult to evaluate in terms of optimality. In this study, a generalized network flow model, embedded in a time-precedence network, is proposed to formulate the MRCPSPDCF with the payment at activity completion times. Mathematically, the model is formulated as an integer network flow problem with side constraints, which can be efficiently solved for optimality, using existing mathematical programming software. To evaluate the model performance, numerical tests are performed. The test results indicate that the model could be a useful planning tool for project scheduling in the real world.

A novel hybrid genetic algorithm to solve the make-to-order sequence-dependent flow-shop scheduling problem

NASA Astrophysics Data System (ADS)

Mirabi, Mohammad; Fatemi Ghomi, S. M. T.; Jolai, F.

2014-04-01

Flow-shop scheduling problem (FSP) deals with the scheduling of a set of n jobs that visit a set of m machines in the same order. As the FSP is NP-hard, there is no efficient algorithm to reach the optimal solution of the problem. To minimize the holding, delay and setup costs of large permutation flow-shop scheduling problems with sequence-dependent setup times on each machine, this paper develops a novel hybrid genetic algorithm (HGA) with three genetic operators. Proposed HGA applies a modified approach to generate a pool of initial solutions, and also uses an improved heuristic called the iterated swap procedure to improve the initial solutions. We consider the make-to-order production approach that some sequences between jobs are assumed as tabu based on maximum allowable setup cost. In addition, the results are compared to some recently developed heuristics and computational experimental results show that the proposed HGA performs very competitively with respect to accuracy and efficiency of solution.

Framework and implementation of a continuous network-wide health monitoring system for roadways

NASA Astrophysics Data System (ADS)

Wang, Ming; Birken, Ralf; Shahini Shamsabadi, Salar

2014-03-01

According to the 2013 ASCE report card America's infrastructure scores only a D+. There are more than four million miles of roads (grade D) in the U.S. requiring a broad range of maintenance activities. The nation faces a monumental problem of infrastructure management in the scheduling and implementation of maintenance and repair operations, and in the prioritization of expenditures within budgetary constraints. The efficient and effective performance of these operations however is crucial to ensuring roadway safety, preventing catastrophic failures, and promoting economic growth. There is a critical need for technology that can cost-effectively monitor the condition of a network-wide road system and provide accurate, up-to-date information for maintenance activity prioritization. The Versatile Onboard Traffic Embedded Roaming Sensors (VOTERS) project provides a framework and the sensing capability to complement periodical localized inspections to continuous network-wide health monitoring. Research focused on the development of a cost-effective, lightweight package of multi-modal sensor systems compatible with this framework. An innovative software infrastructure is created that collects, processes, and evaluates these large time-lapse multi-modal data streams. A GIS-based control center manages multiple inspection vehicles and the data for further analysis, visualization, and decision making. VOTERS' technology can monitor road conditions at both the surface and sub-surface levels while the vehicle is navigating through daily traffic going about its normal business, thereby allowing for network-wide frequent assessment of roadways. This deterioration process monitoring at unprecedented time and spatial scales provides unique experimental data that can be used to improve life-cycle cost analysis models.

PRACTICAL: Planning and Resource Allocation in C2-Domains With Time Critical Algorithms (PRACTICAL: Planning en Allocatie in C2-Domeinen Met Tijdkritische Algoritmen)

DTIC Science & Technology

1993-02-01

the (re)planning framework, incorporating the demonstrators CALIGULA and ALLOCATOR for resource allocation and scheduling respectively. In the Command...demonstrator CALIGULA for the problem of allocating frequencies to a radio link network. The problems in the domain of scheduling are dealt with. which has...demonstrating the (re)planning framework, incorporating the demonstrators CALIGULA and ALLOCATOR for resource allocation and scheduling respectively

Mathematical Frameworks for Diagnostics, Prognostics and Condition Based Maintenance Problems

DTIC Science & Technology

2008-08-15

REPORT Mathematical Frameworks for Diagnostics, Prognostics and Condition Based Maintenance Problems (W911NF-05-1-0426) 14. ABSTRACT 16. SECURITY ...other documentation. 12. DISTRIBUTION AVAILIBILITY STATEMENT Approved for Public Release; Distribution Unlimited 9. SPONSORING/MONITORING AGENCY NAME...parallel and distributed computing environment were researched. In support of the Condition Based Maintenance (CBM) philosophy, a theoretical framework

Intercell scheduling: A negotiation approach using multi-agent coalitions

NASA Astrophysics Data System (ADS)

Tian, Yunna; Li, Dongni; Zheng, Dan; Jia, Yunde

2016-10-01

Intercell scheduling problems arise as a result of intercell transfers in cellular manufacturing systems. Flexible intercell routes are considered in this article, and a coalition-based scheduling (CBS) approach using distributed multi-agent negotiation is developed. Taking advantage of the extended vision of the coalition agents, the global optimization is improved and the communication cost is reduced. The objective of the addressed problem is to minimize mean tardiness. Computational results show that, compared with the widely used combinatorial rules, CBS provides better performance not only in minimizing the objective, i.e. mean tardiness, but also in minimizing auxiliary measures such as maximum completion time, mean flow time and the ratio of tardy parts. Moreover, CBS is better than the existing intercell scheduling approach for the same problem with respect to the solution quality and computational costs.

A Solution Method of Job-shop Scheduling Problems by the Idle Time Shortening Type Genetic Algorithm

NASA Astrophysics Data System (ADS)

Ida, Kenichi; Osawa, Akira

In this paper, we propose a new idle time shortening method for Job-shop scheduling problems (JSPs). We insert its method into a genetic algorithm (GA). The purpose of JSP is to find a schedule with the minimum makespan. We suppose that it is effective to reduce idle time of a machine in order to improve the makespan. The left shift is a famous algorithm in existing algorithms for shortening idle time. The left shift can not arrange the work to idle time. For that reason, some idle times are not shortened by the left shift. We propose two kinds of algorithms which shorten such idle time. Next, we combine these algorithms and the reversal of a schedule. We apply GA with its algorithm to benchmark problems and we show its effectiveness.

Active Solution Space and Search on Job-shop Scheduling Problem

NASA Astrophysics Data System (ADS)

Watanabe, Masato; Ida, Kenichi; Gen, Mitsuo

In this paper we propose a new searching method of Genetic Algorithm for Job-shop scheduling problem (JSP). The coding method that represent job number in order to decide a priority to arrange a job to Gannt Chart (called the ordinal representation with a priority) in JSP, an active schedule is created by using left shift. We define an active solution at first. It is solution which can create an active schedule without using left shift, and set of its defined an active solution space. Next, we propose an algorithm named Genetic Algorithm with active solution space search (GA-asol) which can create an active solution while solution is evaluated, in order to search the active solution space effectively. We applied it for some benchmark problems to compare with other method. The experimental results show good performance.

A case study of machinery maintenance protocols and procedures within the UK utilities sector.

PubMed

Edwards, David J; Love, Peter E D

2016-08-01

Failure to conduct periodic fixed-time-to (or scheduled) maintenance on off-highway plant and equipment represents a significant health and safety hazard and major litigation risk for utility contractors completing service excavation and reinstatement works on public highways. Mini-excavators are a ubiquitous mobile plant item used for such tasks and have recently been responsible for several major injuries and fatalities involving workers and members of the public in the United Kingdom (UK). The research utilises the method of triangulation to examine the maintenance practices of utility contractors in the UK. Findings from the research reveal that a combination of prevailing market forces and internal 'company' pressures have inadvertently removed knowledgeable and trained operators, site foremen and managerial supervisors from hands-on maintenance inspections. Rather, 'virtual' maintenance protocols and procedures are adopted by head office but rarely fully implemented on-site. The research concludes with pragmatic recommendations and direction for future research. Copyright © 2015 Elsevier Ltd. All rights reserved.

Results of calendar year 1994 monitor well inspection and maintenance program, Y-12 Plant, Oak Ridge, Tennessee

DOE Office of Scientific and Technical Information (OSTI.GOV)

McMaster, B.W.; Jones, S.B.; Sitzler, J.L.

1995-06-01

This document is a compendium of results of the calendar year 1994 Monitor Well Inspection and Maintenance Program at the Department of Energy Y-12 Plant in Oak Ridge, Tennessee. This report documents the work relating to well inspections and maintenance requests. Inspections are implemented in order to better assess the condition and maintenance needs of wells that are actively being monitored. Currently this approach calls for inspecting all wells on a routine (annual or triennial) basis which are: (1) in an active sampling program; (2) included in a hydrologic study; or (3) not in service, but not scheduled for pluggingmore » and abandonment. Routine inspections help to ensure that representative groundwater samples and hydrologic data are being collected, and contribute to the life expectancy of each well. This report formally presents well inspection and maintenance activities that were conducted at the Y-12 Plant during 1994. All inspections were conducted between April and December.« less

Maintenance treatment of recurrent ovarian cancer: Is it ready for prime time?

PubMed

DiSilvestro, Paul; Alvarez Secord, Angeles

2018-06-05

Approximately 1% of women in the United States will be diagnosed with epithelial ovarian cancer (EOC) during their lifetime. It is most likely to present at a more advanced stage, requiring aggressive therapeutic measures, and most women will succumb to this illness. Due to advancements in therapy, the oncology community has begun to shift its focus to molecular targeted agents, alternative dosing schedules, and maintenance therapy. Women who achieve a response to initial adjuvant chemotherapy may be candidates for maintenance therapy, with the goal of inducing a lasting remission or prolonging the disease-free interval before recurrence. The rationale for maintenance therapy is to delay disease progression by eliminating residual, slowly-dying cancerous cells, or impeding cell turnover. This review discusses the goals of maintenance therapy for EOC with antiangiogenic agents or poly(adenosine diphosphate-ribose) polymerase (PARP) inhibitors, and reviews clinical studies that have demonstrated improvements in survival outcomes. The side-effect profiles for PARP inhibitors and the implications for preserving quality of life during maintenance therapy will also be discussed. Copyright © 2018 The Authors. Published by Elsevier Ltd.. All rights reserved.

Long-term efficacy and safety of certolizumab pegol in Japanese rheumatoid arthritis patients with an inadequate response to methotrexate: 52-week results from an open-label extension of the J-RAPID study

PubMed Central

Tanaka, Yoshiya; Yamamoto, Kazuhiko; Takeuchi, Tsutomu; Yamanaka, Hisashi; Ishiguro, Naoki; Eguchi, Katsumi; Watanabe, Akira; Origasa, Hideki; Shoji, Toshiharu; Miyasaka, Nobuyuki; Koike, Takao

2014-01-01

Abstract Objectives. To evaluate the long-term efficacy and safety of certolizumab pegol (CZP) plus methotrexate treatment and to assess the efficacy of two CZP maintenance dosing schedules in Japanese rheumatoid arthritis (RA) patients with an inadequate response to methotrexate. Methods. J-RAPID double-blind patients were entered into an open-label extension (OLE) study. Patients withdrawn due to lack of efficacy at 16 weeks and double-blind completers without a week-24 American College of Rheumatology (ACR) 20 response received CZP 200 mg every other week (Q2W) plus methotrexate. Double-blind completers with week-24 ACR20 responses were randomized to CZP 200 mg Q2W plus methotrexate or CZP 400 mg every 4 weeks plus methotrexate. Results. The ACR20/ACR50/ACR70 response rates of double-blind completers (n = 204) were 89.7%/67.2%/36.3% at OLE entry and 95.6%/84.8%/58.3% at 52 weeks, respectively. Other clinical, functional and radiographic outcomes were sustained with long-term CZP plus methotrexate. Long-term treatment with CZP was well-tolerated with no new unexpected adverse events observed. The efficacy and safety of CZP treatment were similar between the two dosing schedules. Conclusions. Continued CZP administration with methotrexate maintained efficacy over 52 weeks and was well-tolerated for Japanese RA patients. No obvious differences in clinical efficacy and safety were observed between the two dosing schedules, giving flexibility in maintenance administration schedules. PMID:24593170

Smart Screening System (S3) In Taconite Processing

DOE Office of Scientific and Technical Information (OSTI.GOV)

Daryoush Allaei; Ryan Wartman; David Tarnowski

2006-03-01

The conventional screening machines used in processing plants have had undesirable high noise and vibration levels. They also have had unsatisfactorily low screening efficiency, high energy consumption, high maintenance cost, low productivity, and poor worker safety. These conventional vibrating machines have been used in almost every processing plant. Most of the current material separation technology uses heavy and inefficient electric motors with an unbalanced rotating mass to generate the shaking. In addition to being excessively noisy, inefficient, and high-maintenance, these vibrating machines are often the bottleneck in the entire process. Furthermore, these motors, along with the vibrating machines and supportingmore » structure, shake other machines and structures in the vicinity. The latter increases maintenance costs while reducing worker health and safety. The conventional vibrating fine screens at taconite processing plants have had the same problems as those listed above. This has resulted in lower screening efficiency, higher energy and maintenance cost, and lower productivity and workers safety concerns. The focus of this work is on the design of a high performance screening machine suitable for taconite processing plants. SmartScreens{trademark} technology uses miniaturized motors, based on smart materials, to generate the shaking. The underlying technologies are Energy Flow Control{trademark} and Vibration Control by Confinement{trademark}. These concepts are used to direct energy flow and confine energy efficiently and effectively to the screen function. The SmartScreens{trademark} technology addresses problems related to noise and vibration, screening efficiency, productivity, and maintenance cost and worker safety. Successful development of SmartScreens{trademark} technology will bring drastic changes to the screening and physical separation industry. The final designs for key components of the SmartScreens{trademark} have been developed. The key components include smart motor and associated electronics, resonators, and supporting structural elements. It is shown that the smart motors have an acceptable life and performance. Resonator (or motion amplifier) designs are selected based on the final system requirement and vibration characteristics. All the components for a fully functional prototype are fabricated. The development program is on schedule. The last semi-annual report described the completion of the design refinement phase. This phase resulted in a Smart Screen design that meets performance targets both in the dry condition and with taconite slurry flow using PZT motors. This system was successfully demonstrated for the DOE and partner companies at the Coleraine Mineral Research Laboratory in Coleraine, Minnesota. Since then, the fabrication of the dry application prototype (incorporating an electromagnetic drive mechanism and a new deblinding concept) has been completed and successfully tested at QRDC's lab.« less

Effective Iterated Greedy Algorithm for Flow-Shop Scheduling Problems with Time lags

NASA Astrophysics Data System (ADS)

ZHAO, Ning; YE, Song; LI, Kaidian; CHEN, Siyu

2017-05-01

Flow shop scheduling problem with time lags is a practical scheduling problem and attracts many studies. Permutation problem(PFSP with time lags) is concentrated but non-permutation problem(non-PFSP with time lags) seems to be neglected. With the aim to minimize the makespan and satisfy time lag constraints, efficient algorithms corresponding to PFSP and non-PFSP problems are proposed, which consist of iterated greedy algorithm for permutation(IGTLP) and iterated greedy algorithm for non-permutation (IGTLNP). The proposed algorithms are verified using well-known simple and complex instances of permutation and non-permutation problems with various time lag ranges. The permutation results indicate that the proposed IGTLP can reach near optimal solution within nearly 11% computational time of traditional GA approach. The non-permutation results indicate that the proposed IG can reach nearly same solution within less than 1% computational time compared with traditional GA approach. The proposed research combines PFSP and non-PFSP together with minimal and maximal time lag consideration, which provides an interesting viewpoint for industrial implementation.

Application of a hybrid generation/utility assessment heuristic to a class of scheduling problems

NASA Technical Reports Server (NTRS)

Heyward, Ann O.

1989-01-01

A two-stage heuristic solution approach for a class of multiobjective, n-job, 1-machine scheduling problems is described. Minimization of job-to-job interference for n jobs is sought. The first stage generates alternative schedule sequences by interchanging pairs of schedule elements. The set of alternative sequences can represent nodes of a decision tree; each node is reached via decision to interchange job elements. The second stage selects the parent node for the next generation of alternative sequences through automated paired comparison of objective performance for all current nodes. An application of the heuristic approach to communications satellite systems planning is presented.

Multi-Objective Approach for Energy-Aware Workflow Scheduling in Cloud Computing Environments

PubMed Central

Kadima, Hubert; Granado, Bertrand

2013-01-01

We address the problem of scheduling workflow applications on heterogeneous computing systems like cloud computing infrastructures. In general, the cloud workflow scheduling is a complex optimization problem which requires considering different criteria so as to meet a large number of QoS (Quality of Service) requirements. Traditional research in workflow scheduling mainly focuses on the optimization constrained by time or cost without paying attention to energy consumption. The main contribution of this study is to propose a new approach for multi-objective workflow scheduling in clouds, and present the hybrid PSO algorithm to optimize the scheduling performance. Our method is based on the Dynamic Voltage and Frequency Scaling (DVFS) technique to minimize energy consumption. This technique allows processors to operate in different voltage supply levels by sacrificing clock frequencies. This multiple voltage involves a compromise between the quality of schedules and energy. Simulation results on synthetic and real-world scientific applications highlight the robust performance of the proposed approach. PMID:24319361

Multi-objective approach for energy-aware workflow scheduling in cloud computing environments.

PubMed

Yassa, Sonia; Chelouah, Rachid; Kadima, Hubert; Granado, Bertrand

2013-01-01

We address the problem of scheduling workflow applications on heterogeneous computing systems like cloud computing infrastructures. In general, the cloud workflow scheduling is a complex optimization problem which requires considering different criteria so as to meet a large number of QoS (Quality of Service) requirements. Traditional research in workflow scheduling mainly focuses on the optimization constrained by time or cost without paying attention to energy consumption. The main contribution of this study is to propose a new approach for multi-objective workflow scheduling in clouds, and present the hybrid PSO algorithm to optimize the scheduling performance. Our method is based on the Dynamic Voltage and Frequency Scaling (DVFS) technique to minimize energy consumption. This technique allows processors to operate in different voltage supply levels by sacrificing clock frequencies. This multiple voltage involves a compromise between the quality of schedules and energy. Simulation results on synthetic and real-world scientific applications highlight the robust performance of the proposed approach.

Learning dominance relations in combinatorial search problems

NASA Technical Reports Server (NTRS)

Yu, Chee-Fen; Wah, Benjamin W.

1988-01-01

Dominance relations commonly are used to prune unnecessary nodes in search graphs, but they are problem-dependent and cannot be derived by a general procedure. The authors identify machine learning of dominance relations and the applicable learning mechanisms. A study of learning dominance relations using learning by experimentation is described. This system has been able to learn dominance relations for the 0/1-knapsack problem, an inventory problem, the reliability-by-replication problem, the two-machine flow shop problem, a number of single-machine scheduling problems, and a two-machine scheduling problem. It is considered that the same methodology can be extended to learn dominance relations in general.

Scheduling IT Staff at a Bank: A Mathematical Programming Approach

PubMed Central

Labidi, M.; Mrad, M.; Gharbi, A.; Louly, M. A.

2014-01-01

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. PMID:24772032

Scheduling IT staff at a bank: a mathematical programming approach.

PubMed

Labidi, M; Mrad, M; Gharbi, A; Louly, M A

2014-01-01

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.

Research on schedulers for astronomical observatories

NASA Astrophysics Data System (ADS)

Colome, Josep; Colomer, Pau; Guàrdia, Josep; Ribas, Ignasi; Campreciós, Jordi; Coiffard, Thierry; Gesa, Lluis; Martínez, Francesc; Rodler, Florian

2012-09-01

The main task of a scheduler applied to astronomical observatories is the time optimization of the facility and the maximization of the scientific return. Scheduling of astronomical observations is an example of the classical task allocation problem known as the job-shop problem (JSP), where N ideal tasks are assigned to M identical resources, while minimizing the total execution time. A problem of higher complexity, called the Flexible-JSP (FJSP), arises when the tasks can be executed by different resources, i.e. by different telescopes, and it focuses on determining a routing policy (i.e., which machine to assign for each operation) other than the traditional scheduling decisions (i.e., to determine the starting time of each operation). In most cases there is no single best approach to solve the planning system and, therefore, various mathematical algorithms (Genetic Algorithms, Ant Colony Optimization algorithms, Multi-Objective Evolutionary algorithms, etc.) are usually considered to adapt the application to the system configuration and task execution constraints. The scheduling time-cycle is also an important ingredient to determine the best approach. A shortterm scheduler, for instance, has to find a good solution with the minimum computation time, providing the system with the capability to adapt the selected task to varying execution constraints (i.e., environment conditions). We present in this contribution an analysis of the task allocation problem and the solutions currently in use at different astronomical facilities. We also describe the schedulers for three different projects (CTA, CARMENES and TJO) where the conclusions of this analysis are applied to develop a suitable routine.

Buying Into Maintenance.

ERIC Educational Resources Information Center

May, Abigail

1998-01-01

Describes how educational institutions are recognizing the short-sightedness of deferred maintenance. Discusses the challenges facing schools as they confront maintenance costs and what they must do to address the problem. Offers advice on proactive stances toward maintenance such as computerized work control processes, maintenance zones, and…

78 FR 43766 - Airworthiness Directives; The Boeing Company Airplanes

Federal Register 2010, 2011, 2012, 2013, 2014

2013-07-22

... Boeing Commercial Airplanes, Attention: Data & Services Management, P.O. Box 3707, MC 2H-65, Seattle, WA... fleet availability or span-time of the planned scheduled maintenance check. Conclusion We reviewed the..., at the applicable time specified in paragraph 1.E., ``Compliance,'' of Boeing Special Attention...

38 CFR 4.130 - Schedule of ratings-mental disorders.

Code of Federal Regulations, 2010 CFR

2010-07-01

...; impairment of short- and long-term memory (e.g., retention of only highly learned material, forgetting to... (including maintenance of minimal personal hygiene); disorientation to time or place; memory loss for names... or less often), chronic sleep impairment, mild memory loss (such as forgetting names, directions...

Surveying School Facilities Needs.

ERIC Educational Resources Information Center

Weichel, Harry J.; Dennell, James

1990-01-01

Ralston (Nebraska) Public School District's communitywide survey helped set school facilities priorities while keeping the district's finite resources firmly in mind. With an outline of maintenance costs for the next 10 years, the district can develop a strategic construction schedule. The board also has the option of financing projects through a…

NASA occupational medicine programs: Our obligation to management

NASA Technical Reports Server (NTRS)

Arnoldt, L. B.; Mockbee, J.

1975-01-01

Factors to be considered in forming policies for managing NASA's health maintenance program to provide optimum arrangement for quality medical care are discussed. Topics include scheduling routine physical examinations, job related stress, prevalence of chronic diseases, additions to the PROM data system, and disease trends among personnel.

32 CFR 326.5 - Responsibilities.

Code of Federal Regulations, 2010 CFR

2010-07-01

... Information Officer (CIO), NRO: (1) Ensures that NRO systems of records databases have procedures to protect... law or Executive Order which provides authority for the maintenance of information in each system of... length of time each item of information must be retained according to the NRO Records Control Schedule as...

75 FR 4632 - Advisory Committee on Disability Compensation; Notice of Meeting

Federal Register 2010, 2011, 2012, 2013, 2014

2010-01-28

... DEPARTMENT OF VETERANS AFFAIRS Advisory Committee on Disability Compensation; Notice of Meeting... Committee Act) that the Advisory Committee on Disability Compensation will meet on February 22-23, 2010, in... Veterans Affairs on the maintenance and periodic readjustment of the VA Schedule for Rating Disabilities...

76 FR 64429 - Advisory Committee on Disability Compensation; Notice of Meeting

Federal Register 2010, 2011, 2012, 2013, 2014

2011-10-18

... DEPARTMENT OF VETERANS AFFAIRS Advisory Committee on Disability Compensation; Notice of Meeting... Committee Act) that the Advisory Committee on Disability Compensation will meet on November 14-15, 2011, at... the maintenance and periodic readjustment of the VA Schedule for Rating Disabilities. The Committee is...

76 FR 27387 - Advisory Committee on Disability Compensation; Notice of Meeting

Federal Register 2010, 2011, 2012, 2013, 2014

2011-05-11

... DEPARTMENT OF VETERANS AFFAIRS Advisory Committee on Disability Compensation; Notice of Meeting... Committee Act) that the Advisory Committee on Disability Compensation will meet on Tuesday, June 21, 2011... the maintenance and periodic readjustment of the VA Schedule for Rating Disabilities. The Committee is...

United States Marine Corps Motor Transport Mechanic-to-Equipment Ratio

DTIC Science & Technology

time motor transport equipment remains in maintenance at the organizational command level. This thesis uses a discrete event simulation model of the...applied to a single experiment that allows for assessment of risk of not achieving the objective. Inter-arrival time, processing time, work schedule

Evaluation of the use of rubber-tire rollers on asphalt concrete.

DOT National Transportation Integrated Search

1989-01-01

The addition of a rubber-tire roller was required on two projects on maintenance schedules and on two construction projects in 1988. The rubber-tire roller was used as an addition to the conventional rollers on one-half of each project. The rubber-ti...

Custodial Methods and Procedures Manual. Third Edition.

ERIC Educational Resources Information Center

Johnson, Donald R.

This manual discusses school facility cleaning and maintenance from the expanded perspective of work management, physical assets management, and resource management. Work management encompasses the organization of work and personnel, scheduling of daily or routine duties and tasks, and handling of demand work. Physical asset management includes…

Enhancement of LEEDS Decision Tools for E-Craft

DTIC Science & Technology

2012-03-13

software tool was conducted to determine how to best incorporate RCM into the FMEA process already a part of LEEDS. Plans were made to enhance the...as opposed to implementing a strictly scheduled and costly equipment maintenance program. Utilizing the FMEA process already a part of LEEDS

Systemic Sustainability in RtI Using Intervention-Based Scheduling Methodologies

ERIC Educational Resources Information Center

Dallas, William P.

2017-01-01

This study evaluated a scheduling methodology referred to as intervention-based scheduling to address the problem of practice regarding the fidelity of implementing Response to Intervention (RtI) in an existing school schedule design. Employing panel data, this study used fixed-effects regressions and first differences ordinary least squares (OLS)…

Scheduling Independent Partitions in Integrated Modular Avionics Systems

PubMed Central

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. PMID:27942013

Temporal planning for transportation planning and scheduling

NASA Technical Reports Server (NTRS)

Frederking, Robert E.; Muscettola, Nicola

1992-01-01

In this paper we describe preliminary work done in the CORTES project, applying the Heuristic Scheduling Testbed System (HSTS) to a transportation planning and scheduling domain. First, we describe in more detail the transportation problems that we are addressing. We then describe the fundamental characteristics of HSTS and we concentrate on the representation of multiple capacity resources. We continue with a more detailed description of the transportation planning problem that we have initially addressed in HSTS and of its solution. Finally we describe future directions for our research.

Graph Coloring Used to Model Traffic Lights.

ERIC Educational Resources Information Center

Williams, John

1992-01-01

Two scheduling problems, one involving setting up an examination schedule and the other describing traffic light problems, are modeled as colorings of graphs consisting of a set of vertices and edges. The chromatic number, the least number of colors necessary for coloring a graph, is employed in the solutions. (MDH)

Concurrent Reinforcement Schedules for Problem Behavior and Appropriate Behavior: Experimental Applications of the Matching Law

ERIC Educational Resources Information Center

Borrero, Carrie S. W.; Vollmer, Timothy R.; Borrero, John C.; Bourret, Jason C.; Sloman, Kimberly N.; Samaha, Andrew L.; Dallery, Jesse

2010-01-01

This study evaluated how children who exhibited functionally equivalent problem and appropriate behavior allocate responding to experimentally arranged reinforcer rates. Relative reinforcer rates were arranged on concurrent variable-interval schedules and effects on relative response rates were interpreted using the generalized matching equation.…

Shiftwork Scheduling for the 1990s.

ERIC Educational Resources Information Center

Coleman, Richard M.

1989-01-01

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

Efficient bounding schemes for the two-center hybrid flow shop scheduling problem with removal times.

PubMed

Hidri, Lotfi; Gharbi, Anis; Louly, Mohamed Aly

2014-01-01

We focus on the two-center hybrid flow shop scheduling problem with identical parallel machines and removal times. The job removal time is the required duration to remove it from a machine after its processing. The objective is to minimize the maximum completion time (makespan). A heuristic and a lower bound are proposed for this NP-Hard problem. These procedures are based on the optimal solution of the parallel machine scheduling problem with release dates and delivery times. The heuristic is composed of two phases. The first one is a constructive phase in which an initial feasible solution is provided, while the second phase is an improvement one. Intensive computational experiments have been conducted to confirm the good performance of the proposed procedures.

Efficient Bounding Schemes for the Two-Center Hybrid Flow Shop Scheduling Problem with Removal Times

PubMed Central

2014-01-01

We focus on the two-center hybrid flow shop scheduling problem with identical parallel machines and removal times. The job removal time is the required duration to remove it from a machine after its processing. The objective is to minimize the maximum completion time (makespan). A heuristic and a lower bound are proposed for this NP-Hard problem. These procedures are based on the optimal solution of the parallel machine scheduling problem with release dates and delivery times. The heuristic is composed of two phases. The first one is a constructive phase in which an initial feasible solution is provided, while the second phase is an improvement one. Intensive computational experiments have been conducted to confirm the good performance of the proposed procedures. PMID:25610911

An Extended Deterministic Dendritic Cell Algorithm for Dynamic Job Shop Scheduling

NASA Astrophysics Data System (ADS)

Qiu, X. N.; Lau, H. Y. K.

The problem of job shop scheduling in a dynamic environment where random perturbation exists in the system is studied. In this paper, an extended deterministic Dendritic Cell Algorithm (dDCA) is proposed to solve such a dynamic Job Shop Scheduling Problem (JSSP) where unexpected events occurred randomly. This algorithm is designed based on dDCA and makes improvements by considering all types of signals and the magnitude of the output values. To evaluate this algorithm, ten benchmark problems are chosen and different kinds of disturbances are injected randomly. The results show that the algorithm performs competitively as it is capable of triggering the rescheduling process optimally with much less run time for deciding the rescheduling action. As such, the proposed algorithm is able to minimize the rescheduling times under the defined objective and to keep the scheduling process stable and efficient.

Performance comparison of heuristic algorithms for task scheduling in IaaS cloud computing environment.

PubMed

Madni, Syed Hamid Hussain; Abd Latiff, Muhammad Shafie; Abdullahi, Mohammed; Abdulhamid, Shafi'i Muhammad; Usman, Mohammed Joda

2017-01-01

Cloud computing infrastructure is suitable for meeting computational needs of large task sizes. Optimal scheduling of tasks in cloud computing environment has been proved to be an NP-complete problem, hence the need for the application of heuristic methods. Several heuristic algorithms have been developed and used in addressing this problem, but choosing the appropriate algorithm for solving task assignment problem of a particular nature is difficult since the methods are developed under different assumptions. Therefore, six rule based heuristic algorithms are implemented and used to schedule autonomous tasks in homogeneous and heterogeneous environments with the aim of comparing their performance in terms of cost, degree of imbalance, makespan and throughput. First Come First Serve (FCFS), Minimum Completion Time (MCT), Minimum Execution Time (MET), Max-min, Min-min and Sufferage are the heuristic algorithms considered for the performance comparison and analysis of task scheduling in cloud computing.

Performance comparison of heuristic algorithms for task scheduling in IaaS cloud computing environment

PubMed Central

Madni, Syed Hamid Hussain; Abd Latiff, Muhammad Shafie; Abdullahi, Mohammed; Usman, Mohammed Joda

2017-01-01

Cloud computing infrastructure is suitable for meeting computational needs of large task sizes. Optimal scheduling of tasks in cloud computing environment has been proved to be an NP-complete problem, hence the need for the application of heuristic methods. Several heuristic algorithms have been developed and used in addressing this problem, but choosing the appropriate algorithm for solving task assignment problem of a particular nature is difficult since the methods are developed under different assumptions. Therefore, six rule based heuristic algorithms are implemented and used to schedule autonomous tasks in homogeneous and heterogeneous environments with the aim of comparing their performance in terms of cost, degree of imbalance, makespan and throughput. First Come First Serve (FCFS), Minimum Completion Time (MCT), Minimum Execution Time (MET), Max-min, Min-min and Sufferage are the heuristic algorithms considered for the performance comparison and analysis of task scheduling in cloud computing. PMID:28467505

A Strategy for Autogeneration of Space Shuttle Ground Processing Simulation Models for Project Makespan Estimations

NASA Technical Reports Server (NTRS)

Madden, Michael G.; Wyrick, Roberta; O'Neill, Dale E.

2005-01-01

Space Shuttle Processing is a complicated and highly variable project. The planning and scheduling problem, categorized as a Resource Constrained - Stochastic Project Scheduling Problem (RC-SPSP), has a great deal of variability in the Orbiter Processing Facility (OPF) process flow from one flight to the next. Simulation Modeling is a useful tool in estimation of the makespan of the overall process. However, simulation requires a model to be developed, which itself is a labor and time consuming effort. With such a dynamic process, often the model would potentially be out of synchronization with the actual process, limiting the applicability of the simulation answers in solving the actual estimation problem. Integration of TEAMS model enabling software with our existing schedule program software is the basis of our solution. This paper explains the approach used to develop an auto-generated simulation model from planning and schedule efforts and available data.

Optimisation of assembly scheduling in VCIM systems using genetic algorithm

NASA Astrophysics Data System (ADS)

Dao, Son Duy; Abhary, Kazem; Marian, Romeo

2017-09-01

Assembly plays an important role in any production system as it constitutes a significant portion of the lead time and cost of a product. Virtual computer-integrated manufacturing (VCIM) system is a modern production system being conceptually developed to extend the application of traditional computer-integrated manufacturing (CIM) system to global level. Assembly scheduling in VCIM systems is quite different from one in traditional production systems because of the difference in the working principles of the two systems. In this article, the assembly scheduling problem in VCIM systems is modeled and then an integrated approach based on genetic algorithm (GA) is proposed to search for a global optimised solution to the problem. Because of dynamic nature of the scheduling problem, a novel GA with unique chromosome representation and modified genetic operations is developed herein. Robustness of the proposed approach is verified by a numerical example.

Some single-machine scheduling problems with learning effects and two competing agents.

PubMed

Li, Hongjie; Li, Zeyuan; Yin, Yunqiang

2014-01-01

This study considers a scheduling environment in which there are two agents and a set of jobs, each of which belongs to one of the two agents and its actual processing time is defined as a decreasing linear function of its starting time. Each of the two agents competes to process its respective jobs on a single machine and has its own scheduling objective to optimize. The objective is to assign the jobs so that the resulting schedule performs well with respect to the objectives of both agents. The objective functions addressed in this study include the maximum cost, the total weighted completion time, and the discounted total weighted completion time. We investigate three problems arising from different combinations of the objectives of the two agents. The computational complexity of the problems is discussed and solution algorithms where possible are presented.

Single machine total completion time minimization scheduling with a time-dependent learning effect and deteriorating jobs

NASA Astrophysics Data System (ADS)

Wang, Ji-Bo; Wang, Ming-Zheng; Ji, Ping

2012-05-01

In this article, we consider a single machine scheduling problem with a time-dependent learning effect and deteriorating jobs. By the effects of time-dependent learning and deterioration, we mean that the job processing time is defined by a function of its starting time and total normal processing time of jobs in front of it in the sequence. The objective is to determine an optimal schedule so as to minimize the total completion time. This problem remains open for the case of -1 < a < 0, where a denotes the learning index; we show that an optimal schedule of the problem is V-shaped with respect to job normal processing times. Three heuristic algorithms utilising the V-shaped property are proposed, and computational experiments show that the last heuristic algorithm performs effectively and efficiently in obtaining near-optimal solutions.

A Grounded Theory Study of Aircraft Maintenance Technician Decision-Making

NASA Astrophysics Data System (ADS)

Norcross, Robert

Aircraft maintenance technician decision-making and actions have resulted in aircraft system errors causing aircraft incidents and accidents. Aircraft accident investigators and researchers examined the factors that influence aircraft maintenance technician errors and categorized the types of errors in an attempt to prevent similar occurrences. New aircraft technology introduced to improve aviation safety and efficiency incur failures that have no information contained in the aircraft maintenance manuals. According to the Federal Aviation Administration, aircraft maintenance technicians must use only approved aircraft maintenance documents to repair, modify, and service aircraft. This qualitative research used a grounded theory approach to explore the decision-making processes and actions taken by aircraft maintenance technicians when confronted with an aircraft problem not contained in the aircraft maintenance manuals. The target population for the research was Federal Aviation Administration licensed aircraft and power plant mechanics from across the United States. Nonprobability purposeful sampling was used to obtain aircraft maintenance technicians with the experience sought in the study problem. The sample population recruitment yielded 19 participants for eight focus group sessions to obtain opinions, perceptions, and experiences related to the study problem. All data collected was entered into the Atlas ti qualitative analysis software. The emergence of Aircraft Maintenance Technician decision-making themes regarding Aircraft Maintenance Manual content, Aircraft Maintenance Technician experience, and legal implications of not following Aircraft Maintenance Manuals surfaced. Conclusions from this study suggest Aircraft Maintenance Technician decision-making were influenced by experience, gaps in the Aircraft Maintenance Manuals, reliance on others, realizing the impact of decisions concerning aircraft airworthiness, management pressures, and legal concerns related to decision-making. Recommendations included an in-depth systematic review of the Aircraft Maintenance Manuals, development of a Federal Aviation Administration approved standardized Aircraft Maintenance Technician decision-making flow diagram, and implementation of risk based decision-making training. The benefit of this study is to save the airline industry revenue by preventing poor decision-making practices that result in inefficient maintenance actions and aircraft incidents and accidents.

Coping with Deferred Maintenance.

ERIC Educational Resources Information Center

Suber, L. Terry

1982-01-01

The deferred maintenance problem on college and university campuses is addressed. Deferred maintenance refers to larger or more expansive maintenance work that can be delayed and is not performed when needed or reported, usually because its cost is beyond the annual maintenance and operating budget of the physical plant department. Eventually…

ECS: efficient communication scheduling for underwater sensor networks.

PubMed

Hong, Lu; Hong, Feng; Guo, Zhongwen; Li, Zhengbao

2011-01-01

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

Zero-gravity atmospheric Cloud Physics Experiment Laboratory; Programmatics report

NASA Technical Reports Server (NTRS)

1974-01-01

The programmatics effort included comprehensive analyses in four major areas: (1) work breakdown structure, (2) schedules, (3) costs, and (4) supporting research and technology. These analyses are discussed in detail in the following sections which identify and define the laboratory project development schedule, cost estimates, funding distributions and supporting research and technology requirements. All programmatics analyses are correlated among themselves and with the technical analyses by means of the work breakdown structure which serves as a common framework for program definition. In addition, the programmatic analyses reflect the results of analyses and plans for reliability, safety, test, and maintenance and refurbishment.

78 FR 1728 - Airworthiness Directives; Thielert Aircraft Engines GmbH Reciprocating Engines

Federal Register 2010, 2011, 2012, 2013, 2014

2013-01-09

... scheduled maintenance, whichever occurs first, do the following. (1) Remove the oil filler plug and check... Airworthiness Directives; Thielert Aircraft Engines GmbH Reciprocating Engines AGENCY: Federal Aviation... all Thielert Aircraft Engines GmbH (TAE) TAE 125-02-99 and TAE 125-02-114 reciprocating engines. This...

76 FR 35978 - Drawbridge Operation Regulations; Connecticut River, Old Lyme, CT

Federal Register 2010, 2011, 2012, 2013, 2014

2011-06-21

... Operation Regulations; Connecticut River, Old Lyme, CT AGENCY: Coast Guard, DHS. ACTION: Notice of temporary... Connecticut River at Old Lyme, Connecticut. The deviation is necessary to facilitate scheduled maintenance at... the Connecticut River at mile 3.4, at Old Lyme, Connecticut, has a vertical clearance in the closed...

76 FR 12587 - Approval and Promulgation of Implementation Plans and Designation of Areas for Air Quality...

Federal Register 2010, 2011, 2012, 2013, 2014

2011-03-08

... is not publicly available, i.e., Confidential Business Information or other information whose... to schedule your inspection. The Regional Office's official hours of business are Monday through... Administrators, Regions I-X, regarding Policy on Excess Emissions During Startup, Shutdown, Maintenance, and...

14 CFR Section 24 - Profit and Loss Elements

Code of Federal Regulations, 2014 CFR

2014-01-01

... Maintenance Burden” shall reflect a memorandum allocation by each air carrier of the total expenses included... operation personnel in readiness for assignment to an in-flight status. (2) “Maintenance” shall include all... line 5 of this schedule. (f) “Operating Profit (Loss)” shall be computed by subtracting the total...

14 CFR Section 24 - Profit and Loss Elements

Code of Federal Regulations, 2013 CFR

2013-01-01

... Maintenance Burden” shall reflect a memorandum allocation by each air carrier of the total expenses included... operation personnel in readiness for assignment to an in-flight status. (2) “Maintenance” shall include all... line 5 of this schedule. (f) “Operating Profit (Loss)” shall be computed by subtracting the total...

14 CFR Section 24 - Profit and Loss Elements

Code of Federal Regulations, 2011 CFR

2011-01-01

... Maintenance Burden” shall reflect a memorandum allocation by each air carrier of the total expenses included... operation personnel in readiness for assignment to an in-flight status. (2) “Maintenance” shall include all... line 5 of this schedule. (f) “Operating Profit (Loss)” shall be computed by subtracting the total...

Asphalt Raking. Instructor Manual. Trainee Manual.

ERIC Educational Resources Information Center

Laborers-AGC Education and Training Fund, Pomfret Center, CT.

This packet consists of the instructor and trainee manuals for an asphalt raking course. The instructor manual contains a course schedule for 4 days of instruction, content outline, and instructor outline. The trainee manual is divided into five sections: safety, asphalt basics, placing methods, repair and patching, and clean-up and maintenance.…

More Than Pushing a Broom

ERIC Educational Resources Information Center

Ward, James E.

1976-01-01

A course in building maintenance (at the Voc Tech Department of Pensacola Junior College, Florida) teaches students to maintain, repair, and rework existing facilities under the CETA program. The daily schedule includes one hour of classroom work covering related academic subjects and five hours spent working on a variety of projects. (LH)

40 CFR 1054.125 - What maintenance instructions must I give to buyers?

Code of Federal Regulations, 2011 CFR

2011-07-01

... schedule cleaning or changing air filters or changing spark plugs at the least frequent interval described... (CONTINUED) AIR POLLUTION CONTROLS CONTROL OF EMISSIONS FROM NEW, SMALL NONROAD SPARK-IGNITION ENGINES AND... aftertreatment devices, pulse-air valves, fuel injectors, oxygen sensors, electronic control units, superchargers...

40 CFR 1054.125 - What maintenance instructions must I give to buyers?

Code of Federal Regulations, 2010 CFR

2010-07-01

... schedule cleaning or changing air filters or changing spark plugs at the least frequent interval described... (CONTINUED) AIR POLLUTION CONTROLS CONTROL OF EMISSIONS FROM NEW, SMALL NONROAD SPARK-IGNITION ENGINES AND... aftertreatment devices, pulse-air valves, fuel injectors, oxygen sensors, electronic control units, superchargers...

10 CFR Appendix B to Part 436 - Goal Setting Methodology

Code of Federal Regulations, 2013 CFR

2013-01-01

... investment program, (using where appropriate, the life cycle costing factors and methodology in subpart A of... subpart A, the dollars saved can be projected against the dollars invested. Life cycle costing methodology..., maintenance, and equipment acquisition; and phase-out schedule (of older equipment or plants which may be...

10 CFR Appendix B to Part 436 - Goal Setting Methodology

Code of Federal Regulations, 2012 CFR

2012-01-01

... investment program, (using where appropriate, the life cycle costing factors and methodology in subpart A of... subpart A, the dollars saved can be projected against the dollars invested. Life cycle costing methodology..., maintenance, and equipment acquisition; and phase-out schedule (of older equipment or plants which may be...

10 CFR Appendix B to Part 436 - Goal Setting Methodology

Code of Federal Regulations, 2011 CFR

2011-01-01

... investment program, (using where appropriate, the life cycle costing factors and methodology in subpart A of... Subpart A, the dollars saved can be projected against the dollars invested. Life cycle costing methodology..., maintenance, and equipment acquisition; and phase-out schedule (of older equipment or plants which may be...

10 CFR Appendix B to Part 436 - Goal Setting Methodology

Code of Federal Regulations, 2014 CFR

2014-01-01

... investment program, (using where appropriate, the life cycle costing factors and methodology in subpart A of... subpart A, the dollars saved can be projected against the dollars invested. Life cycle costing methodology..., maintenance, and equipment acquisition; and phase-out schedule (of older equipment or plants which may be...

41 CFR 109-38.502-50 - DOE guidelines.

Code of Federal Regulations, 2010 CFR

2010-07-01

..., AND MOTOR VEHICLES 38-MOTOR EQUIPMENT MANAGEMENT 38.5-Scheduled Maintenance § 109-38.502-50 DOE... 41 Public Contracts and Property Management 3 2010-07-01 2010-07-01 false DOE guidelines. 109-38.502-50 Section 109-38.502-50 Public Contracts and Property Management Federal Property Management...

41 CFR 102-34.280 - What State inspections must we have for Government motor vehicles?

Code of Federal Regulations, 2010 CFR

2010-07-01

... Management Federal Property Management Regulations System (Continued) FEDERAL MANAGEMENT REGULATION PERSONAL PROPERTY 34-MOTOR VEHICLE MANAGEMENT Scheduled Maintenance of Motor Vehicles § 102-34.280 What State... 41 Public Contracts and Property Management 3 2010-07-01 2010-07-01 false What State inspections...

18 CFR 300.11 - Technical support for the rate schedule.

Code of Federal Regulations, 2011 CFR

2011-04-01

... historic period or are expected to produce revenue during the rate test period; (B) Capitalized deferred...) Whether the investment is an initial investment, an addition, a replacement, or a capitalized deferred..., Maintenance and Other Annual Expenses. Statement E must contain, for the last five years of the historic...

18 CFR 300.11 - Technical support for the rate schedule.

Code of Federal Regulations, 2010 CFR

2010-04-01

... historic period or are expected to produce revenue during the rate test period; (B) Capitalized deferred...) Whether the investment is an initial investment, an addition, a replacement, or a capitalized deferred..., Maintenance and Other Annual Expenses. Statement E must contain, for the last five years of the historic...

18 CFR 300.11 - Technical support for the rate schedule.

Code of Federal Regulations, 2014 CFR

2014-04-01

... historic period or are expected to produce revenue during the rate test period; (B) Capitalized deferred...) Whether the investment is an initial investment, an addition, a replacement, or a capitalized deferred..., Maintenance and Other Annual Expenses. Statement E must contain, for the last five years of the historic...

18 CFR 300.11 - Technical support for the rate schedule.

Code of Federal Regulations, 2012 CFR

2012-04-01

... historic period or are expected to produce revenue during the rate test period; (B) Capitalized deferred...) Whether the investment is an initial investment, an addition, a replacement, or a capitalized deferred..., Maintenance and Other Annual Expenses. Statement E must contain, for the last five years of the historic...

18 CFR 300.11 - Technical support for the rate schedule.

Code of Federal Regulations, 2013 CFR

2013-04-01

... historic period or are expected to produce revenue during the rate test period; (B) Capitalized deferred...) Whether the investment is an initial investment, an addition, a replacement, or a capitalized deferred..., Maintenance and Other Annual Expenses. Statement E must contain, for the last five years of the historic...

77 FR 488 - Control of Emissions From New Highway Vehicles and Engines; Approval of New Scheduled Maintenance...

Federal Register 2010, 2011, 2012, 2013, 2014

2012-01-05

... and engine manufacturers began planning to meet those requirements by optimizing engine designs for low emissions and adding high-efficiency aftertreatment systems. Manufacturers examined the use of... recirculation, and selective catalytic reduction (SCR). SCR systems use a nitrogen-containing reducing agent...

42 CFR 417.480 - Maintenance of records: Cost HMOs and CMPs.

Code of Federal Regulations, 2010 CFR

2010-10-01

... or CMP, and operation of the HMO's or CMP's financial, medical, and other recordkeeping systems. (2..., sale, or other action. (5) Agreements, contracts, and subcontracts. (6) Franchise, marketing, and management agreements. (7) Schedules of charges for the HMO's or CMP's fee-for-service patients. (8) Matters...