Scheduling in Engineering, Project, and Production Management

OpenAIRE

Chien-Ho Ko

2015-01-01

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

Joint optimization of production scheduling and machine group preventive maintenance

International Nuclear Information System (INIS)

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

2016-01-01

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

A new mathematical programming model for long-term production scheduling considering geological uncertainty

OpenAIRE

Gholamnejad, J.; Moosavi, E.

2012-01-01

Determination of the optimum production schedules over the life of a mine is a critical mechanism in open pit mine planning procedures. Long-term production scheduling is used to maximize the net present value of the project under technical, financial, and environmental constraints. Mathematical programming models are well suited for optimizing long-term production schedules of open pit mines. There are two approaches to solving long-term production problems: deterministic- and uncertainty- b...

Simulation of less master production schedule nervousness model

OpenAIRE

Herrera , Carlos; Thomas , André

2009-01-01

International audience; In production decision making systems, Master Production Schedule (MPS) states the requirements for individual end items by date and quantity. The solution sensitivity to demand forecast changes, unforeseen supplier and production problem occurrences, is known as nervousness. This feature cause undesirable effects at tactical and operational levels. Some of these effects are production and inventory cost increases and, also, negative impacts on overall and labor produc...

Uncertainty management by relaxation of conflicting constraints in production process scheduling

Science.gov (United States)

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.

Scheduling the scheduling task : a time management perspective on scheduling

NARCIS (Netherlands)

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

2013-01-01

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

Refinery scheduling

Energy Technology Data Exchange (ETDEWEB)

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

2004-07-01

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

Integrated Production-Distribution Scheduling Problem with Multiple Independent Manufacturers

Directory of Open Access Journals (Sweden)

Jianhong Hao

2015-01-01

Full Text Available We consider the nonstandard parts supply chain with a public service platform for machinery integration in China. The platform assigns orders placed by a machinery enterprise to multiple independent manufacturers who produce nonstandard parts and makes production schedule and batch delivery schedule for each manufacturer in a coordinate manner. Each manufacturer has only one plant with parallel machines and is located at a location far away from other manufacturers. Orders are first processed at the plants and then directly shipped from the plants to the enterprise in order to be finished before a given deadline. We study the above integrated production-distribution scheduling problem with multiple manufacturers to maximize a weight sum of the profit of each manufacturer under the constraints that all orders are finished before the deadline and the profit of each manufacturer is not negative. According to the optimal condition analysis, we formulate the problem as a mixed integer programming model and use CPLEX to solve it.

Information Flow Scheduling in Concurrent Multi-Product Development Based on DSM

Science.gov (United States)

Sun, Qing-Chao; Huang, Wei-Qiang; Jiang, Ying-Jie; Sun, Wei

2017-09-01

Multi-product collaborative development is adopted widely in manufacturing enterprise, while the present multi-project planning models don't take technical/data interactions of multiple products into account. To decrease the influence of technical/data interactions on project progresses, the information flow scheduling models based on the extended DSM is presented. Firstly, information dependencies are divided into four types: series, parallel, coupling and similar. Secondly, different types of dependencies are expressed as DSM units, and the extended DSM model is brought forward, described as a block matrix. Furthermore, the information flow scheduling methods is proposed, which involves four types of operations, where partitioning and clustering algorithm are modified from DSM for ensuring progress of high-priority project, merging and converting is the specific computation of the extended DSM. Finally, the information flow scheduling of two machine tools development is analyzed with example, and different project priorities correspond to different task sequences and total coordination cost. The proposed methodology provides a detailed instruction for information flow scheduling in multi-product development, with specially concerning technical/data interactions.

Cost Minimization for Joint Energy Management and Production Scheduling Using Particle Swarm Optimization

Science.gov (United States)

Shah, Rahul H.

Production costs account for the largest share of the overall cost of manufacturing facilities. With the U.S. industrial sector becoming more and more competitive, manufacturers are looking for more cost and resource efficient working practices. Operations management and production planning have shown their capability to dramatically reduce manufacturing costs and increase system robustness. When implementing operations related decision making and planning, two fields that have shown to be most effective are maintenance and energy. Unfortunately, the current research that integrates both is limited. Additionally, these studies fail to consider parameter domains and optimization on joint energy and maintenance driven production planning. Accordingly, production planning methodology that considers maintenance and energy is investigated. Two models are presented to achieve well-rounded operating strategy. The first is a joint energy and maintenance production scheduling model. The second is a cost per part model considering maintenance, energy, and production. The proposed methodology will involve a Time-of-Use electricity demand response program, buffer and holding capacity, station reliability, production rate, station rated power, and more. In practice, the scheduling problem can be used to determine a joint energy, maintenance, and production schedule. Meanwhile, the cost per part model can be used to: (1) test the sensitivity of the obtained optimal production schedule and its corresponding savings by varying key production system parameters; and (2) to determine optimal system parameter combinations when using the joint energy, maintenance, and production planning model. Additionally, a factor analysis on the system parameters is conducted and the corresponding performance of the production schedule under variable parameter conditions, is evaluated. Also, parameter optimization guidelines that incorporate maintenance and energy parameter decision making in the

A Literature Survey for Earliness/Tardiness Scheduling Problems with Learning Effect

Directory of Open Access Journals (Sweden)

Mesut Cemil İŞLER

2009-02-01

Full Text Available When a task or work is done continuously, there will be an experience so following times needs of required resources (manpower, materials, etc. will be reduced. This learning curve described first by Wright. Wright determined how workmanship costs decreased while proceed plain increasing. This investigations correctness found consistent by plain producers. Learning effect is an effect that, works can be done in shorter time in the rate of repeat of work with repeating same or similar works in production process. Nowadays classical production systems adapted more acceptable systems with new approaches. Just in time production system (JIT philosophy is one of the most important production system philosophies. JIT which is known production without stock stands on using all product resources optimum. Minimization problem of Earliness/Tardiness finishing penalty, which we can describe Just in time scheduling, appeared by inspired from JIT philosophy. In this study, there is literature survey which directed to earliness/tardiness performance criteria and learning effect processing in scheduling and as a result of this it is obtained some establishing for literature.

Decision Model for Planning and Scheduling of Seafood Product Considering Traceability

Science.gov (United States)

Agustin; Mawengkang, Herman; Mathelinea, Devy

2018-01-01

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

optimal scheduling of petroleum products distribution in nigeria

African Journals Online (AJOL)

MECHANICAL ENGINEERING

The study reveals that any variation in supply, demand and ... and storage depots for easy shipment of the products from ... The system should be robust yet simple to support routine ..... (10)Klabjan, D. Topics in airline crew scheduling and ...

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

Science.gov (United States)

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

2018-02-01

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

A stochastic simulation approach for production scheduling and ...

African Journals Online (AJOL)

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

Increasing the reliability of production schedules in a pharmaceutical packaging department.

Science.gov (United States)

Pacciarelli, Dario; D'Ariano, Andrea

2012-12-01

This paper studies quantitative methods for evaluating the potential benefits of introducing new advanced tracking technologies in the pharmaceutical industry with special reference to radio frequency identification (RFID). RFID technology is an effective way for increasing the quality of the data that are used to generate production schedules, but there is a lack of scientific research to quantify the return on investment that can be achieved in practice. In this work, we distinguish two major sources of data unreliability: one is the inherent stochasticity of operations, which cannot be reduced by RFID, and the other one is the data estimation error, which can be significantly reduced by RFID. We focus on the marginal contribution of the latter quantity to the productivity of the packaging department of a pharmaceutical plant, propose a systematic method for assessing this impact and discuss its implementation in a practical test case. Our results confirm that advanced tracking technologies in combination with effective scheduling procedures show a significant potential for improving productivity. Extensions to other production environments and their issues associated with scheduling problems are also discussed.

Refinery production planning and scheduling: the refining core business

Directory of Open Access Journals (Sweden)

M. Joly

2012-06-01

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

Mathematical models for a batch scheduling problem to minimize earliness and tardiness

Directory of Open Access Journals (Sweden)

Basar Ogun

2018-05-01

Full Text Available Purpose: Today’s manufacturing facilities are challenged by highly customized products and just in time manufacturing and delivery of these products. In this study, a batch scheduling problem is addressed to provide on-time completion of customer orders in the environment of lean manufacturing. The problem is to optimize partitioning of product components into batches and scheduling of the resulting batches where each customer order is received as a set of products made of various components. Design/methodology/approach: Three different mathematical models for minimization of total earliness and tardiness of customer orders are developed to provide on-time completion of customer orders and also, to avoid from inventory of final products. The first model is a non-linear integer programming model while the second is a linearized version of the first. Finally, to solve larger sized instances of the problem, an alternative linear integer model is presented. Findings: Computational study using a suit set of test instances showed that the alternative linear integer model is able to solve all test instances in varying sizes within quite shorter computer times comparing to the other two models. It was also showed that the alternative model can solve moderate sized real-world problems. Originality/value: The problem under study differentiates from existing batch scheduling problems in the literature since it includes new circumstances which may arise in real-world applications. This research, also, contributes the literature of batch scheduling problem by presenting new optimization models.

Patients' preference for radiotherapy fractionation schedule in the palliation of symptomatic unresectable lung cancer

International Nuclear Information System (INIS)

Tang, J. I.; Lu, J. J.; Wong, L. C.

2008-01-01

Full text: The palliative radiotherapeutic management of unresectable non-small-cell lung cancer is controversial, with various fractionation (F x) schedules available. We aimed to determine patient's choice of F x schedule after involvement in a decision-making process using a decision board. A decision board outlining the various advantages and disadvantages apparent in the Medical Research Council study of F x schedules (17 Gy in two fractions vs 39 Gy in 13 fractions) was discussed with patients who met Medical Research Council eligibility criteria. Patients were then asked to indicate their preferred F x schedules, reasons and their level of satisfaction with being involved in the decision making process. Radiation oncologists (R O ) could prescribe radiotherapy schedules irrespective of patients' preferences. Of 92 patients enrolled, 55% chose the longer schedule. English-speaking patients were significantly more likely to choose the longer schedule (P 0.02, 95% confidence interval: 1.2-7.6). Longer F x was chosen because of longer survival (90%) and better local control (12%). Shorter F x was chosen for shorter overall treatment duration (80%), cost (61%) and better symptom control (20%). In all, 56% of patients choosing the shorter schedule had their treatment altered by the treating R O , whereas only 4% of patients choosing longer F x had their treatment altered (P O 's own biases.

A Recovery Model for Production Scheduling: Combination of Disruption Management and Internet of Things

Directory of Open Access Journals (Sweden)

Yang Jiang

2016-01-01

Full Text Available It is difficult to generate the new schedule effectively for minimizing the negative impact when an unanticipated disruption occurs after a subset of tasks has been finished in production scheduling. In such cases, continuing with the original schedule may not be optimal or feasible. Based on disruption management and Internet of things (IoT, this study designs a real-time status analyzer to identify the disruption and propose a recovery model to deal with the disruption. The computational result proves that our algorithm is competitive with the existing heuristics. Furthermore, due to the tradeoff between all participators (mainly including customers, managers of production enterprise, and workers involved in production scheduling, our model is more effective than the total rescheduling and right-shift rescheduling.

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

DEFF Research Database (Denmark)

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

2014-01-01

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

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

Science.gov (United States)

2013-09-09

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

Research on Energy-Saving Production Scheduling Based on a Clustering Algorithm for a Forging Enterprise

Directory of Open Access Journals (Sweden)

Yifei Tong

2016-02-01

Full Text Available Energy efficiency is a buzzword of the 21st century. With the ever growing need for energy efficient and low-carbon production, it is a big challenge for high energy-consumption enterprises to reduce their energy consumption. To this aim, a forging enterprise, DVR (the abbreviation of a forging enterprise, is researched. Firstly, an investigation into the production processes of DVR is given as well as an analysis of forging production. Then, the energy-saving forging scheduling is decomposed into two sub-problems. One is for cutting and machining scheduling, which is similar to traditional machining scheduling. The other one is for forging and heat treatment scheduling. Thirdly, former forging production scheduling is presented and solved based on an improved genetic algorithm. Fourthly, the latter is discussed in detail, followed by proposed dynamic clustering and stacking combination optimization. The proposed stacking optimization requires making the gross weight of forgings as close to the maximum batch capacity as possible. The above research can help reduce the heating times, and increase furnace utilization with high energy efficiency and low carbon emissions.

Integration of scheduling and discrete event simulation systems to improve production flow planning

Science.gov (United States)

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

2016-08-01

The increased availability of data and computer-aided technologies such as MRPI/II, ERP and MES system, allowing producers to be more adaptive to market dynamics and to improve production scheduling. Integration of production scheduling and computer modelling, simulation and visualization systems can be useful in the analysis of production system constraints related to the efficiency of manufacturing systems. A integration methodology based on semi-automatic model generation method for eliminating problems associated with complexity of the model and labour-intensive and time-consuming process of simulation model creation is proposed. Data mapping and data transformation techniques for the proposed method have been applied. This approach has been illustrated through examples of practical implementation of the proposed method using KbRS scheduling system and Enterprise Dynamics simulation system.

Operational Excellence through Schedule Optimization and Production Simulation of Application Specific Integrated Circuits.

Energy Technology Data Exchange (ETDEWEB)

Flory, John Andrew [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Padilla, Denise D. [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Gauthier, John H. [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Zwerneman, April Marie [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Miller, Steven P [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)

2016-05-01

Upcoming weapon programs require an aggressive increase in Application Specific Integrated Circuit (ASIC) production at Sandia National Laboratories (SNL). SNL has developed unique modeling and optimization tools that have been instrumental in improving ASIC production productivity and efficiency, identifying optimal operational and tactical execution plans under resource constraints, and providing confidence in successful mission execution. With ten products and unprecedented levels of demand, a single set of shared resources, highly variable processes, and the need for external supplier task synchronization, scheduling is an integral part of successful manufacturing. The scheduler uses an iterative multi-objective genetic algorithm and a multi-dimensional performance evaluator. Schedule feasibility is assessed using a discrete event simulation (DES) that incorporates operational uncertainty, variability, and resource availability. The tools provide rapid scenario assessments and responses to variances in the operational environment, and have been used to inform major equipment investments and workforce planning decisions in multiple SNL facilities.

Proposing New Heuristic Approaches for Preventive Maintenance Scheduling

Directory of Open Access Journals (Sweden)

majid Esmailian

2013-08-01

Full Text Available The purpose of preventive maintenance management is to perform a series of tasks that prevent or minimize production breakdowns and improve reliability of production facilities. An important objective of preventive maintenance management is to minimize downtime of production facilities. In order to accomplish this objective, personnel should efficiently allocate resources and determine an effective maintenance schedule. Gopalakrishnan (1997 developed a mathematical model and four heuristic approaches to solve the preventive maintenance scheduling problem of assigning skilled personnel to work with tasks that require a set of corresponding skills. However, there are several limitations in the prior work in this area of research. The craft combination problem has not been solved because the craft combination is assumed as given. The craft combination problem concerns the computation of all combinations of assigning multi skilled workers to accomplishment of a particular task. In fact, determining craft combinations is difficult because of the exponential number of craft combinations that are possible. This research provides a heuristic approach for determining the craft combination and four new heuristic approach solution for the preventive maintenance scheduling problem with multi skilled workforce constraints. In order to examine the new heuristic approach and to compare the new heuristic approach with heuristic approach of Gopalakrishnan (1997, 81 standard problems have been generated based on the criterion suggested by from Gopalakrishnan (1997. The average solution quality (SQ of the new heuristic approaches is 1.86% and in old heuristic approaches is 8.32%. The solution time of new heuristic approaches are shorter than old heuristic approaches. The solution time of new heuristic approaches is 0.78 second and old heuristic approaches is 6.43 second, but the solution time of mathematical model provided by Gopalakrishnan (1997 is 152 second. �

10 CFR 170.21 - Schedule of fees for production and utilization facilities, review of standard referenced design...

Science.gov (United States)

2010-01-01

... 10 Energy 2 2010-01-01 2010-01-01 false Schedule of fees for production and utilization facilities, review of standard referenced design approvals, special projects, inspections and import and export... AMENDED Schedule of Fees § 170.21 Schedule of fees for production and utilization facilities, review of...

Production and Resource Scheduling in Mass Customization with Dependent Setup Consideration

DEFF Research Database (Denmark)

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

2014-01-01

will contribute to the success of mass customization. This paper addresses the problem of production and resource scheduling for a production system with dependent setup and internal transportation such as AGVs in a mass customization environment. A constraint-programming-based methodology is developed to satisfy...

Analyzing Integrated Cost-Schedule Risk for Complex Product Systems R&D Projects

Directory of Open Access Journals (Sweden)

Zhe Xu

2014-01-01

Full Text Available The vast majority of the research efforts in project risk management tend to assess cost risk and schedule risk independently. However, project cost and time are related in reality and the relationship between them should be analyzed directly. We propose an integrated cost and schedule risk assessment model for complex product systems R&D projects. Graphical evaluation review technique (GERT, Monte Carlo simulation, and probability distribution theory are utilized to establish the model. In addition, statistical analysis and regression analysis techniques are employed to analyze simulation outputs. Finally, a complex product systems R&D project as an example is modeled by the proposed approach and the simulation outputs are analyzed to illustrate the effectiveness of the risk assessment model. It seems that integrating cost and schedule risk assessment can provide more reliable risk estimation results.

Proposed algorithm to improve job shop production scheduling using ant colony optimization method

Science.gov (United States)

Pakpahan, Eka KA; Kristina, Sonna; Setiawan, Ari

2017-12-01

This paper deals with the determination of job shop production schedule on an automatic environment. On this particular environment, machines and material handling system are integrated and controlled by a computer center where schedule were created and then used to dictate the movement of parts and the operations at each machine. This setting is usually designed to have an unmanned production process for a specified interval time. We consider here parts with various operations requirement. Each operation requires specific cutting tools. These parts are to be scheduled on machines each having identical capability, meaning that each machine is equipped with a similar set of cutting tools therefore is capable of processing any operation. The availability of a particular machine to process a particular operation is determined by the remaining life time of its cutting tools. We proposed an algorithm based on the ant colony optimization method and embedded them on matlab software to generate production schedule which minimize the total processing time of the parts (makespan). We test the algorithm on data provided by real industry and the process shows a very short computation time. This contributes a lot to the flexibility and timelines targeted on an automatic environment.

A Formal Product-Line Engineering Approach for Schedulers

NARCIS (Netherlands)

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

2017-01-01

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

Preventive Maintenance Scheduling for Multicogeneration Plants with Production Constraints Using Genetic Algorithms

Directory of Open Access Journals (Sweden)

Khaled Alhamad

2015-01-01

Full Text Available This paper describes a method developed to schedule the preventive maintenance tasks of the generation and desalination units in separate and linked cogeneration plants provided that all the necessary maintenance and production constraints are satisfied. The proposed methodology is used to generate two preventing maintenance schedules, one for electricity and the other for distiller. Two types of crossover operators were adopted, 2-point and 4-point. The objective function of the model is to maximize the available number of operational units in each plant. The results obtained were satisfying the problem parameters. However, 4-point slightly produce better solution than 2-point ones for both electricity and water distiller. The performance as well as the effectiveness of the genetic algorithm in solving preventive maintenance scheduling is applied and tested on a real system of 21 units for electricity and 21 units for water. The results presented here show a great potential for utility applications for effective energy management over a time horizon of 52 weeks. The model presented is an effective decision tool that optimizes the solution of the maintenance scheduling problem for cogeneration plants under maintenance and production constraints.

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

Science.gov (United States)

2017-01-13

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

Formulation for less master production schedule instability under rolling horizon

OpenAIRE

Herrera , Carlos; Thomas , André

2009-01-01

International audience; In Manufacturing Planning and Control Systems, the Master Production Schedule (MPS) makes a link between tactical and operational levels, taking into account information provided by end items, demand forecast as well as Sales and Operations Planning (S&OP) suggestions. Therefore, MPS plays an important role to maintain an adequate customers service level and an efficient production system. In a rolling planning horizon, MPS is periodically computed over whole operation...

National contingency plan product schedule data base

International Nuclear Information System (INIS)

Putukian, J.; Hiltabrand, R.R.

1993-01-01

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

A random-key encoded harmony search approach for energy-efficient production scheduling with shared resources

Science.gov (United States)

Garcia-Santiago, C. A.; Del Ser, J.; Upton, C.; Quilligan, F.; Gil-Lopez, S.; Salcedo-Sanz, S.

2015-11-01

When seeking near-optimal solutions for complex scheduling problems, meta-heuristics demonstrate good performance with affordable computational effort. This has resulted in a gravitation towards these approaches when researching industrial use-cases such as energy-efficient production planning. However, much of the previous research makes assumptions about softer constraints that affect planning strategies and about how human planners interact with the algorithm in a live production environment. This article describes a job-shop problem that focuses on minimizing energy consumption across a production facility of shared resources. The application scenario is based on real facilities made available by the Irish Center for Manufacturing Research. The formulated problem is tackled via harmony search heuristics with random keys encoding. Simulation results are compared to a genetic algorithm, a simulated annealing approach and a first-come-first-served scheduling. The superior performance obtained by the proposed scheduler paves the way towards its practical implementation over industrial production chains.

Decomposition principles applied to the dynamic production and work-force scheduling problem

NARCIS (Netherlands)

Aardal, K.I.; Ari, A.

1987-01-01

One of the most important problems in the production and inventory planning field, is the scheduling of production and work force in a dynamic environment. Although this problem can be formulated as a linear program, it is often quite difficult to solve directly, due to its large scale. Instead, it

Simulation methods for nuclear production scheduling

International Nuclear Information System (INIS)

Miles, W.T.; Markel, L.C.

1975-01-01

Recent developments and applications of simulation methods for use in nuclear production scheduling and fuel management are reviewed. The unique characteristics of the nuclear fuel cycle as they relate to the overall optimization of a mixed nuclear-fossil system in both the short-and mid-range time frame are described. Emphasis is placed on the various formulations and approaches to the mid-range planning problem, whose objective is the determination of an optimal (least cost) system operation strategy over a multi-year planning horizon. The decomposition of the mid-range problem into power system simulation, reactor core simulation and nuclear fuel management optimization, and system integration models is discussed. Present utility practices, requirements, and research trends are described. 37 references

Retail sales of scheduled listed chemical products; self-certification of regulated sellers of scheduled listed chemical products. Interim final rule with request for comment.

Science.gov (United States)

2006-09-26

In March 2006, the President signed the Combat Methamphetamine Epidemic Act of 2005, which establishes new requirements for retail sales of over-the-counter (nonprescription) products containing the List I chemicals ephedrine, pseudoephedrine, and phenylpropanolamine. The three chemicals can be used to manufacture methamphetamine illegally. DEA is promulgating this rule to incorporate the statutory provisions and make its regulations consistent with the new requirements. This action establishes daily and 30-day limits on the sales of scheduled listed chemical products to individuals and requires recordkeeping on most sales.

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

Science.gov (United States)

2010-01-01

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

A reactive decision-making approach to reduce instability in a Master Production Schedule

OpenAIRE

Herrera , Carlos; Belmokhtar Berraf , Sana; Thomas , André; Parada , Victor

2016-01-01

International audience; One of the primary factors that impact the master production scheduling performance is demand fluctuation, which leads to frequently updated decisions, thereby causing instability. Consequently, global cost deteriorates, and productivity decreases. A reactive approach based on parametric mixed-integer programming is proposed that aims to provide a set of plans such that a compromise between production cost and production stability is ensured. Several stability measures...

Comparative Simulation Study of Production Scheduling in the Hybrid and the Parallel Flow

Directory of Open Access Journals (Sweden)

Varela Maria L.R.

2017-06-01

Full Text Available Scheduling is one of the most important decisions in production control. An approach is proposed for supporting users to solve scheduling problems, by choosing the combination of physical manufacturing system configuration and the material handling system settings. The approach considers two alternative manufacturing scheduling configurations in a two stage product oriented manufacturing system, exploring the hybrid flow shop (HFS and the parallel flow shop (PFS environments. For illustrating the application of the proposed approach an industrial case from the automotive components industry is studied. The main aim of this research to compare results of study of production scheduling in the hybrid and the parallel flow, taking into account the makespan minimization criterion. Thus the HFS and the PFS performance is compared and analyzed, mainly in terms of the makespan, as the transportation times vary. The study shows that the performance HFS is clearly better when the work stations’ processing times are unbalanced, either in nature or as a consequence of the addition of transport times just to one of the work station processing time but loses advantage, becoming worse than the performance of the PFS configuration when the work stations’ processing times are balanced, either in nature or as a consequence of the addition of transport times added on the work stations’ processing times. This means that physical layout configurations along with the way transport time are including the work stations’ processing times should be carefully taken into consideration due to its influence on the performance reached by both HFS and PFS configurations.

Advances in mixed-integer programming methods for chemical production scheduling.

Science.gov (United States)

Velez, Sara; Maravelias, Christos T

2014-01-01

The goal of this paper is to critically review advances in the area of chemical production scheduling over the past three decades and then present two recently proposed solution methods that have led to dramatic computational enhancements. First, we present a general framework and problem classification and discuss modeling and solution methods with an emphasis on mixed-integer programming (MIP) techniques. Second, we present two solution methods: (a) a constraint propagation algorithm that allows us to compute parameters that are then used to tighten MIP scheduling models and (b) a reformulation that introduces new variables, thus leading to effective branching. We also present computational results and an example illustrating how these methods are implemented, as well as the resulting enhancements. We close with a discussion of open research challenges and future research directions.

Multi-Agent Based Beam Search for Real-Time Production Scheduling and Control Method, Software and Industrial Application

CERN Document Server

Kang, Shu Gang

2013-01-01

The Multi-Agent Based Beam Search (MABBS) method systematically integrates four major requirements of manufacturing production - representation capability, solution quality, computation efficiency, and implementation difficulty - within a unified framework to deal with the many challenges of complex real-world production planning and scheduling problems. Multi-agent Based Beam Search for Real-time Production Scheduling and Control introduces this method, together with its software implementation and industrial applications.  This book connects academic research with industrial practice, and develops a practical solution to production planning and scheduling problems. To simplify implementation, a reusable software platform is developed to build the MABBS method into a generic computation engine.  This engine is integrated with a script language, called the Embedded Extensible Application Script Language (EXASL), to provide a flexible and straightforward approach to representing complex real-world problems. ...

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

Energy Technology Data Exchange (ETDEWEB)

United States. Bonneville Power Administration.

2006-11-01

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

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

Science.gov (United States)

2013-06-20

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

Optimal scheduling for enhanced coal bed methane production through CO2 injection

International Nuclear Information System (INIS)

Huang, Yuping; Zheng, Qipeng P.; Fan, Neng; Aminian, Kashy

2014-01-01

Highlights: • A novel deterministic optimization model for CO 2 -ECBM production scheduling. • Maximize the total profit from both sales of natural gas and CO 2 credits trading in the carbon market. • A stochastic model incorporating uncertainties and dynamics of NG price and CO 2 credit. - Abstract: Enhanced coal bed methane production with CO 2 injection (CO 2 -ECBM) is an effective technology for accessing the natural gas embedded in the traditionally unmineable coal seams. The revenue via this production process is generated not only by the sales of coal bed methane, but also by trading CO 2 credits in the carbon market. As the technology of CO 2 -ECBM becomes mature, its commercialization opportunities are also springing up. This paper proposes applicable mathematical models for CO 2 -ECBM production and compares the impacts of their production schedules on the total profit. A novel basic deterministic model for CO 2 -ECBM production including the technical and chemical details is proposed and then a multistage stochastic programming model is formulated in order to address uncertainties of natural gas price and CO 2 credit. Both models are nonlinear programming problems, which are solved by commercial nonlinear programming software BARON via GAMS. Numerical experiments show the benefits (e.g., expected profit gain) of using stochastic models versus deterministic models

Working Less and Enjoying It More: Alternative Work Schedules.

Science.gov (United States)

Shanks, Katherine

1984-01-01

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

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

Directory of Open Access Journals (Sweden)

Sang-Oh Shim

2017-12-01

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

Analyzing scheduling in the food-processing industry

DEFF Research Database (Denmark)

Akkerman, Renzo; van Donk, Dirk Pieter

2009-01-01

Production scheduling has been widely studied in several research areas, resulting in a large number of methods, prescriptions, and approaches. However, the impact on scheduling practice seems relatively low. This is also the case in the food-processing industry, where industry......-specific characteristics induce specific and complex scheduling problems. Based on ideas about decomposition of the scheduling task and the production process, we develop an analysis methodology for scheduling problems in food processing. This combines an analysis of structural (technological) elements of the production...... process with an analysis of the tasks of the scheduler. This helps to understand, describe, and structure scheduling problems in food processing, and forms a basis for improving scheduling and applying methods developed in literature. It also helps in evaluating the organisational structures...

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

DEFF Research Database (Denmark)

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

2006-01-01

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

Project scheduling method with time using MRP system – A case study: Construction project in Libya

Directory of Open Access Journals (Sweden)

Abdallah Ali Imetieg

2015-04-01

Full Text Available Materials Requirements and Planning (MRP is a system of production planning and inventory control, which is used to manage manufacturing processes. Most MRP systems are software-based and are used to ensure that the materials are available for production, that the products are available for delivery to customers, that the lowest possible material and product level is maintained in store, as well as to plan delivery schedules and purchasing activities. Upon completion of scheduling, begins the process of follow-up, which includes the achievement of the project goals in terms of quantity, quality and costs in accordance with deadlines. MRP system was applied to project of 5000 housing units in Solug area, which is close to Benghazi city, Libya, with the aim to provide necessary cash flow to pay dues on time without delay to all involved project sub-contractors and material suppliers, to ensure the smooth flow of operations, as well as to diminish costs by reduction of temporary storages and rented areas. There is a correlation between time and cost of each activity. If the required time is shorter than the scheduled time of the certain activity, it would demand more resources, which further leads to the increase in direct costs of the given activity. Therefore, the output of MRP is important since commands are issued through planning in order to launch the suggested orders with the required quantities and within the limited time period.

21 CFR 113.83 - Establishing scheduled processes.

Science.gov (United States)

2010-04-01

... commercial production runs should be determined on the basis of recognized scientific methods to be of a size... CONTAINERS Production and Process Controls § 113.83 Establishing scheduled processes. Scheduled processes for... production shall be adequately provided for in establishing the scheduled process. Critical factors, e.g...

Sustainable Scheduling of Cloth Production Processes by Multi-Objective Genetic Algorithm with Tabu-Enhanced Local Search

Directory of Open Access Journals (Sweden)

Rui Zhang

2017-09-01

Full Text Available The dyeing of textile materials is the most critical process in cloth production because of the strict technological requirements. In addition to the technical aspect, there have been increasing concerns over how to minimize the negative environmental impact of the dyeing industry. The emissions of pollutants are mainly caused by frequent cleaning operations which are necessary for initializing the dyeing equipment, as well as idled production capacity which leads to discharge of unconsumed chemicals. Motivated by these facts, we propose a methodology to reduce the pollutant emissions by means of systematic production scheduling. Firstly, we build a three-objective scheduling model that incorporates both the traditional tardiness objective and the environmentally-related objectives. A mixed-integer programming formulation is also provided to accurately define the problem. Then, we present a novel solution method for the sustainable scheduling problem, namely, a multi-objective genetic algorithm with tabu-enhanced iterated greedy local search strategy (MOGA-TIG. Finally, we conduct extensive computational experiments to investigate the actual performance of the MOGA-TIG. Based on a fair comparison with two state-of-the-art multi-objective optimizers, it is concluded that the MOGA-TIG is able to achieve satisfactory solution quality within tight computational time budget for the studied scheduling problem.

12-hour-shift plant schedule improves operator productivity

International Nuclear Information System (INIS)

Gould, S.

1989-01-01

Twelve-hour scheduling has been a mainstay of the petrochemical industry, is common in the papermill industry, and is relatively new to the nuclear utility industry. A review of industry experiences, research, and a federal Nuclear Regulatory Commission (NRC) study of the 12-hour shift (NUREG/CR-4248) demonstrate that the advantages outweigh the disadvantages. The primary advantages are greater job satisfaction, fewer errors, and the better communications inherent in two shift turnovers versus three. Several companies that implemented the 12-hour shift found an increase in employee morale, no adverse effect on worker health, and no decline in safety. They experienced greater productivity, fewer operator errors, and better communication

Concurrent schedules of wheel-running reinforcement: choice between different durations of opportunity to run in rats.

Science.gov (United States)

Belke, Terry W

2006-02-01

How do animals choose between opportunities to run of different durations? Are longer durations preferred over shorter durations because they permit a greater number of revolutions? Are shorter durations preferred because they engender higher rates of running? Will longer durations be chosen because running is less constrained? The present study reports on three experiments that attempted to address these questions. In the first experiment, five male Wistar rats chose between 10-sec and 50-sec opportunities to run on modified concurrent variable-interval (VI) schedules. Across conditions, the durations associated with the alternatives were reversed. Response, time, and reinforcer proportions did not vary from indifference. In a second experiment, eight female Long-Evans rats chose between opportunities to run of equal (30 sec) and unequal durations (10 sec and 50 sec) on concurrent variable-ratio (VR) schedules. As in Experiment 1, between presentations of equal duration conditions, 10-sec and 50-sec durations were reversed. Results showed that response, time, and reinforcer proportions on an alternative did not vary with reinforcer duration. In a third experiment, using concurrent VR schedules, durations were systematically varied to decrease the shorter duration toward 0 sec. As the shorter duration decreased, response, time, and reinforcer proportions shifted toward the longer duration. In summary, differences in durations of opportunities to run did not affect choice behavior in a manner consistent with the assumption that a longer reinforcer is a larger reinforcer.

An FMS Dynamic Production Scheduling Algorithm Considering Cutting Tool Failure and Cutting Tool Life

International Nuclear Information System (INIS)

Setiawan, A; Wangsaputra, R; Halim, A H; Martawirya, Y Y

2016-01-01

This paper deals with Flexible Manufacturing System (FMS) production rescheduling due to unavailability of cutting tools caused either of cutting tool failure or life time limit. The FMS consists of parallel identical machines integrated with an automatic material handling system and it runs fully automatically. Each machine has a same cutting tool configuration that consists of different geometrical cutting tool types on each tool magazine. The job usually takes two stages. Each stage has sequential operations allocated to machines considering the cutting tool life. In the real situation, the cutting tool can fail before the cutting tool life is reached. The objective in this paper is to develop a dynamic scheduling algorithm when a cutting tool is broken during unmanned and a rescheduling needed. The algorithm consists of four steps. The first step is generating initial schedule, the second step is determination the cutting tool failure time, the third step is determination of system status at cutting tool failure time and the fourth step is the rescheduling for unfinished jobs. The approaches to solve the problem are complete-reactive scheduling and robust-proactive scheduling. The new schedules result differences starting time and completion time of each operations from the initial schedule. (paper)

GLOA: A New Job Scheduling Algorithm for Grid Computing

Directory of Open Access Journals (Sweden)

Zahra Pooranian

2013-03-01

Full Text Available The purpose of grid computing is to produce a virtual supercomputer by using free resources available through widespread networks such as the Internet. This resource distribution, changes in resource availability, and an unreliable communication infrastructure pose a major challenge for efficient resource allocation. Because of the geographical spread of resources and their distributed management, grid scheduling is considered to be a NP-complete problem. It has been shown that evolutionary algorithms offer good performance for grid scheduling. This article uses a new evaluation (distributed algorithm inspired by the effect of leaders in social groups, the group leaders' optimization algorithm (GLOA, to solve the problem of scheduling independent tasks in a grid computing system. Simulation results comparing GLOA with several other evaluation algorithms show that GLOA produces shorter makespans.

MO-E-BRD-02: Accelerated Partial Breast Irradiation in Brachytherapy: Is Shorter Better?

International Nuclear Information System (INIS)

Todor, D.

2015-01-01

Is Non-invasive Image-Guided Breast Brachytherapy Good? – Jess Hiatt, MS Non-invasive Image-Guided Breast Brachytherapy (NIBB) is an emerging therapy for breast boost treatments as well as Accelerated Partial Breast Irradiation (APBI) using HDR surface breast brachytherapy. NIBB allows for smaller treatment volumes while maintaining optimal target coverage. Considering the real-time image-guidance and immobilization provided by the NIBB modality, minimal margins around the target tissue are necessary. Accelerated Partial Breast Irradiation in brachytherapy: is shorter better? - Dorin Todor, PhD VCU A review of balloon and strut devices will be provided together with the origins of APBI: the interstitial multi-catheter implant. A dosimetric and radiobiological perspective will help point out the evolution in breast brachytherapy, both in terms of devices and the protocols/clinical trials under which these devices are used. Improvements in imaging, delivery modalities and convenience are among the factors driving the ultrashort fractionation schedules but our understanding of both local control and toxicities associated with various treatments is lagging. A comparison between various schedules, from a radiobiological perspective, will be given together with a critical analysis of the issues. to review and understand the evolution and development of APBI using brachytherapy methods to understand the basis and limitations of radio-biological ‘equivalence’ between fractionation schedules to review commonly used and proposed fractionation schedules Intra-operative breast brachytherapy: Is one stop shopping best?- Bruce Libby, PhD. University of Virginia A review of intraoperative breast brachytherapy will be presented, including the Targit-A and other trials that have used electronic brachytherapy. More modern approaches, in which the lumpectomy procedure is integrated into an APBI workflow, will also be discussed. Learning Objectives: To review past and current

MO-E-BRD-02: Accelerated Partial Breast Irradiation in Brachytherapy: Is Shorter Better?

Energy Technology Data Exchange (ETDEWEB)

Todor, D. [Virginia Commonwealth University (United States)

2015-06-15

Is Non-invasive Image-Guided Breast Brachytherapy Good? – Jess Hiatt, MS Non-invasive Image-Guided Breast Brachytherapy (NIBB) is an emerging therapy for breast boost treatments as well as Accelerated Partial Breast Irradiation (APBI) using HDR surface breast brachytherapy. NIBB allows for smaller treatment volumes while maintaining optimal target coverage. Considering the real-time image-guidance and immobilization provided by the NIBB modality, minimal margins around the target tissue are necessary. Accelerated Partial Breast Irradiation in brachytherapy: is shorter better? - Dorin Todor, PhD VCU A review of balloon and strut devices will be provided together with the origins of APBI: the interstitial multi-catheter implant. A dosimetric and radiobiological perspective will help point out the evolution in breast brachytherapy, both in terms of devices and the protocols/clinical trials under which these devices are used. Improvements in imaging, delivery modalities and convenience are among the factors driving the ultrashort fractionation schedules but our understanding of both local control and toxicities associated with various treatments is lagging. A comparison between various schedules, from a radiobiological perspective, will be given together with a critical analysis of the issues. to review and understand the evolution and development of APBI using brachytherapy methods to understand the basis and limitations of radio-biological ‘equivalence’ between fractionation schedules to review commonly used and proposed fractionation schedules Intra-operative breast brachytherapy: Is one stop shopping best?- Bruce Libby, PhD. University of Virginia A review of intraoperative breast brachytherapy will be presented, including the Targit-A and other trials that have used electronic brachytherapy. More modern approaches, in which the lumpectomy procedure is integrated into an APBI workflow, will also be discussed. Learning Objectives: To review past and current

Application of Tabu Search Algorithm in Job Shop Scheduling

Directory of Open Access Journals (Sweden)

Betrianis Betrianis

2010-10-01

Full Text Available Tabu Search is one of local search methods which is used to solve the combinatorial optimization problem. This method aimed is to make the searching process of the best solution in a complex combinatorial optimization problem(np hard, ex : job shop scheduling problem, became more effective, in a less computational time but with no guarantee to optimum solution.In this paper, tabu search is used to solve the job shop scheduling problem consists of 3 (three cases, which is ordering package of September, October and November with objective of minimizing makespan (Cmax. For each ordering package, there is a combination for initial solution and tabu list length. These result then  compared with 4 (four other methods using basic dispatching rules such as Shortest Processing Time (SPT, Earliest Due Date (EDD, Most Work Remaining (MWKR dan First Come First Served (FCFS. Scheduling used Tabu Search Algorithm is sensitive for variables changes and gives makespan shorter than scheduling used by other four methods.

A Three-Stage Optimization Algorithm for the Stochastic Parallel Machine Scheduling Problem with Adjustable Production Rates

Directory of Open Access Journals (Sweden)

Rui Zhang

2013-01-01

Full Text Available We consider a parallel machine scheduling problem with random processing/setup times and adjustable production rates. The objective functions to be minimized consist of two parts; the first part is related with the due date performance (i.e., the tardiness of the jobs, while the second part is related with the setting of machine speeds. Therefore, the decision variables include both the production schedule (sequences of jobs and the production rate of each machine. The optimization process, however, is significantly complicated by the stochastic factors in the manufacturing system. To address the difficulty, a simulation-based three-stage optimization framework is presented in this paper for high-quality robust solutions to the integrated scheduling problem. The first stage (crude optimization is featured by the ordinal optimization theory, the second stage (finer optimization is implemented with a metaheuristic called differential evolution, and the third stage (fine-tuning is characterized by a perturbation-based local search. Finally, computational experiments are conducted to verify the effectiveness of the proposed approach. Sensitivity analysis and practical implications are also discussed.

Schedules of Controlled Substances: Placement of FDA-Approved Products of Oral Solutions Containing Dronabinol [(-)-delta-9-transtetrahydrocannabinol (delta-9-THC)] in Schedule II. Interim final rule, with request for comments.

Science.gov (United States)

2017-03-23

On July 1, 2016, the U.S. Food and Drug Administration (FDA) approved a new drug application for Syndros, a drug product consisting of dronabinol [(-)-delta-9-trans-tetrahydrocannabinol (delta-9-THC)] oral solution. Thereafter, the Department of Health and Human Services (HHS) provided the Drug Enforcement Administration (DEA) with a scheduling recommendation that would result in Syndros (and other oral solutions containing dronabinol) being placed in schedule II of the Controlled Substances Act (CSA). In accordance with the CSA, as revised by the Improving Regulatory Transparency for New Medical Therapies Act, DEA is hereby issuing an interim final rule placing FDA-approved products of oral solutions containing dronabinol in schedule II of the CSA.

Automated Scheduling Via Artificial Intelligence

Science.gov (United States)

Biefeld, Eric W.; Cooper, Lynne P.

1991-01-01

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

The robust schedule - A link to improved workflow

DEFF Research Database (Denmark)

Lindhard, Søren; Wandahl, Søren

2012-01-01

-down the contractors, and force them to rigorously adhere to the initial schedule. If delayed the work-pace or manpower has to be increased to observe the schedule. In attempt to improve productivity three independent site-mangers have been interviewed about time-scheduling. Their experiences and opinions have been...... analyzed and weaknesses in existing time scheduling have been found. The findings showed a negative side effect of keeping the schedule to tight. A too tight schedule is inflexible and cannot absorb variability in production. Flexibility is necessary because of the contractors interacting and dependable....... The result is a chaotic, complex and uncontrolled construction site. Furthermore, strict time limits entail the workflow to be optimized under non-optimal conditions. Even though productivity seems to be increasing, productivity per man-hour is decreasing resulting in increased cost. To increase productivity...

75 FR 15642 - Schedules of Controlled Substances: Exempted Prescription Product; River Edge Pharmaceutical...

Science.gov (United States)

2010-03-30

... 1117-AB28 Schedules of Controlled Substances: Exempted Prescription Product; River Edge Pharmaceutical... new applications for exemption. DEA has received one new application for exemption for River Edge... application for exemption pursuant to the provisions of 21 CFR 1308.32 for: River Edge Pharmaceutical's...

Project scheduling with resources constraints: application in the equipment production for the oil industry; Scheduling de projetos com restricao de recursos: aplicacao na producao de equipamentos para a industria de petroleo

Energy Technology Data Exchange (ETDEWEB)

Cruz, Carolina A.O.; Ferreira Filho, Virgilio J.M. [Universidade Federal do Rio de Janeiro (UFRJ), Rio de Janeiro, RJ (Brazil). Coordenacao dos Programas de Pos-graduacao de Engenharia (COPPE)

2008-07-01

One of the essential steps in the main scope Project Management is the Time Management made by the planning and control of the project schedule. In this work is presented the resource constrained scheduling problem beyond its mathematical formulation and a review of papers about this issue. In sequence is presented a practical example of this model considering a simplified model of an engineering project schedule of oil production equipment. The results obtained with the model application are shown and the conclusions about the work with resource constrained scheduling problems. (author)

Urdu translation and validation of shorter version of Positive Affect and Negative Affect Schedule (PANAS) on Pakistani bank employees.

Science.gov (United States)

Akhter, Noreen

2017-10-01

To translate, adapt and validate shorter version of positive affect and negative affect scale on Pakistani corporate employees. This cross-sectional study was conducted in the twin cities of Islamabad and Rawalpindi from October 2014 to December 2015. The study was completed into two independent parts. In part one, the scale was translated by forward translation. Then it was pilot-tested and administered on customer services employees from commercial banks and the telecommunication sector. Data of the pilot study was analysed by using exploratory factor analysis to extract the initial factor of positive affect and negative affect scale. Part two comprised the main study. Commercial bank employees were included in the sample using convenient sampling technique. Data of the main study was analysed using confirmatory factor analysis in order to establish construct validity of positive affect and negative affect scale. There were145 participants in the first part of the study and 495 in the second. Results of confirmatory factor analysis confirmed the two-factor structure of positive affect and negative affect scale suggesting that the scale has two distinct domains, i.e. positive affect and negative affect. The shorter version of positive affect and negative affect scale was found to be a valid and reliable measure.

Integrated batch production and maintenance scheduling for multiple items processed on a deteriorating machine to minimize total production and maintenance costs with due date constraint

Directory of Open Access Journals (Sweden)

Zahedi Zahedi

2016-04-01

Full Text Available This paper discusses an integrated model of batch production and maintenance scheduling on a deteriorating machine producing multiple items to be delivered at a common due date. The model describes the trade-off between total inventory cost and maintenance cost as the increase of production run length. The production run length is a time bucket between two consecutive preventive maintenance activities. The objective function of the model is to minimize total cost consisting of in process and completed part inventory costs, setup cost, preventive and corrective maintenance costs and rework cost. The problem is to determine the optimal production run length and to schedule the batches obtained from determining the production run length in order to minimize total cost.

Online Scheduling in Manufacturing A Cumulative Delay Approach

CERN Document Server

Suwa, Haruhiko

2013-01-01

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

Step-by-step cyclic processes scheduling

DEFF Research Database (Denmark)

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

2013-01-01

Automated Guided Vehicles (AGVs) fleet scheduling is one of the big problems in Flexible Manufacturing System (FMS) control. The problem is more complicated when concurrent multi-product manufacturing and resource deadlock avoidance policies are considered. The objective of the research is to pro......Automated Guided Vehicles (AGVs) fleet scheduling is one of the big problems in Flexible Manufacturing System (FMS) control. The problem is more complicated when concurrent multi-product manufacturing and resource deadlock avoidance policies are considered. The objective of the research...... is to provide a declarative model enabling to state a constraint satisfaction problem aimed at AGVs fleet scheduling subject to assumed itineraries of concurrently manufactured product types. In other words, assuming a given layout of FMS’s material handling and production routes of simultaneously manufactured...... orders, the main objective is to provide the declarative framework aimed at conditions allowing one to calculate the AGVs fleet schedule in online mode. An illustrative example of the relevant algebra-like driven step-by-stem cyclic scheduling is provided....

Optimal Scheduling of Material Handling Devices in a PCB Production Line: Problem Formulation and a Polynomial Algorithm

Directory of Open Access Journals (Sweden)

Ada Che

2008-01-01

Full Text Available Modern automated production lines usually use one or multiple computer-controlled robots or hoists for material handling between workstations. A typical application of such lines is an automated electroplating line for processing printed circuit boards (PCBs. In these systems, cyclic production policy is widely used due to large lot size and simplicity of implementation. This paper addresses cyclic scheduling of a multihoist electroplating line with constant processing times. The objective is to minimize the cycle time, or equivalently to maximize the production throughput, for a given number of hoists. We propose a mathematical model and a polynomial algorithm for this scheduling problem. Computational results on randomly generated instances are reported.

48 CFR 53.301-1427 - Standard Form 1427, Inventory Schedule A-Construction Sheet (Metals in Mill Product Form).

Science.gov (United States)

2010-10-01

... 48 Federal Acquisition Regulations System 2 2010-10-01 2010-10-01 false Standard Form 1427, Inventory Schedule A-Construction Sheet (Metals in Mill Product Form). 53.301-1427 Section 53.301-1427... Illustrations of Forms 53.301-1427 Standard Form 1427, Inventory Schedule A—Construction Sheet (Metals in Mill...

Rework Impacts Evaluation Through System Dynamics Approach in Overlapped Product Development Schedule

Directory of Open Access Journals (Sweden)

Lino Guimarães Marujo

2009-07-01

Full Text Available This work aims to explore a novel framework to analyze the planning concepts in product development projects employing techniques to reduce the lead-time of activities, such as overlapping of a pair of each. With the System Dynamics methodology a model to evaluate the rework fraction needed to accommodate the deviations proportional to the overlapping grade of the activities. A numerical example is provided to demonstrate the validity of the model. Although problems encountered during the project management are dynamic, they have been treated on a static basis, what has as result, chronic schedules delays, overruns and cost overspent persist in follow the managers’ (reactions. In this work, we have addressed this known problem by introducing and reviewing some characteristics of the concept of rework in overlapped schedules. This consists in observe and capture the relations feedbacks among the original planned project schedule, the overlapping strategy and the inherent uncertainty in a work being done with poor information. To realize this concept, we have faced with many behaviors patterns (e.g. rework, new duration, non-conformity, and analyze the output behavior pattern, produced by the proposed model.

Production Scheduling in Complex Job Shops from an Industrie 4.0 Perspective: A Review and Challenges in the Semiconductor Industry

OpenAIRE

Waschneck, Bernd; Bauernhansl, Thomas; Altenmüller, Thomas; Kyek, Andreas

2017-01-01

On the one hand, Industrie 4.0 has recently emerged as the keyword for increasing productivity in the 21st century. On the other hand, production scheduling in a Complex Job Shop (CJS) environment, such as wafer fabrication facilities, has drawn interest of researchers dating back to the 1950s [65, 18]. Although both research areas overlap, there seems to be very little interchange of ideas. This review presents and assesses production scheduling techniques in complex job shops from an Indust...

Optimal production scheduling for energy efficiency improvement in biofuel feedstock preprocessing considering work-in-process particle separation

International Nuclear Information System (INIS)

Li, Lin; Sun, Zeyi; Yao, Xufeng; Wang, Donghai

2016-01-01

Biofuel is considered a promising alternative to traditional liquid transportation fuels. The large-scale substitution of biofuel can greatly enhance global energy security and mitigate greenhouse gas emissions. One major concern of the broad adoption of biofuel is the intensive energy consumption in biofuel manufacturing. This paper focuses on the energy efficiency improvement of biofuel feedstock preprocessing, a major process of cellulosic biofuel manufacturing. An improved scheme of the feedstock preprocessing considering work-in-process particle separation is introduced to reduce energy waste and improve energy efficiency. A scheduling model based on the improved scheme is also developed to identify an optimal production schedule that can minimize the energy consumption of the feedstock preprocessing under production target constraint. A numerical case study is used to illustrate the effectiveness of the proposed method. The research outcome is expected to improve the energy efficiency and enhance the environmental sustainability of biomass feedstock preprocessing. - Highlights: • A novel method to schedule production in biofuel feedstock preprocessing process. • Systems modeling approach is used. • Capable of optimize preprocessing to reduce energy waste and improve energy efficiency. • A numerical case is used to illustrate the effectiveness of the method. • Energy consumption per unit production can be significantly reduced.

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

OpenAIRE

Bożek Andrzej; Wysocki Marian

2016-01-01

A comprehensive case study of manufacturing scheduling solutions development is given. It includes highly generalized scheduling problem as well as a few scheduling modes, methods and problem models. The considered problem combines flexible job shop structure, lot streaming with variable sublots, transport times, setup times, and machine calendars. Tabu search metaheuristic and constraint programming methods have been used for the off-line scheduling. Two dynamic scheduling methods have also ...

ATLAS construction schedule

CERN Multimedia

Kotamaki, M

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

The Napoleon Complex: When Shorter Men Take More.

Science.gov (United States)

Knapen, Jill E P; Blaker, Nancy M; Van Vugt, Mark

2018-05-01

Inspired by an evolutionary psychological perspective on the Napoleon complex, we hypothesized that shorter males are more likely to show indirect aggression in resource competitions with taller males. Three studies provide support for our interpretation of the Napoleon complex. Our pilot study shows that men (but not women) keep more resources for themselves when they feel small. When paired with a taller male opponent (Study 1), shorter men keep more resources to themselves in a game in which they have all the power (dictator game) versus a game in which the opponent also has some power (ultimatum game). Furthermore, shorter men are not more likely to show direct, physical aggression toward a taller opponent (Study 2). As predicted by the Napoleon complex, we conclude that (relatively) shorter men show greater behavioral flexibility in securing resources when presented with cues that they are physically less competitive. Theoretical and practical implications are discussed.

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

Directory of Open Access Journals (Sweden)

Bożek Andrzej

2016-03-01

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

College Students Understanding of Production Management and Master Production Schedule through Using a Real World Tool, Complimented with Company Tours and In- Class Visits, Provides an Excellent Learning Experience at Farmingdale State College

Directory of Open Access Journals (Sweden)

Jill Anne O'Sullivan

2015-08-01

Full Text Available Manufacturing is playing a significant role in its re-shoring into America. Companies are grappling with ways to obtain that competitive advantage by distinguishing themselves through their intellectual capabilities, process improvements, technology, people, shop floor management and information flows. The purpose of this paper is to describe the effort at Farmingdale State College to educate our students in understanding Production Management and Master Production Schedule (MPS. We are trying to prepare students for entry into the workforce. By using a Real world ERP tool in the classroom while complimenting this learning with touring local manufacturers who use this tool and having production control experts in our classrooms. [1] The opportunity presents itself for these students to visit real world manufacturers using the same tool these students use in the classroom, the Infor Visual ERP. Each semester students go to a local manufacturer to see how the product is made and the ERP system is used to make it. Each semester a subject matter expert, SME, in manufacturing comes into the class and talks about how they use their ERP to perform their functional responsibilities. Students go into these companies and sit down with these Production Manufacturing and IT SME's to see how they use the modules in their ERP system from estimating, Production Management, MPS to delivery and payment. From the manufacturing window to the Master Schedule Window students learn from these companies SME's just how they perform their functions, how they use this tool. Then that is replicated this in the classroom lab assignments for students to better understand Production Management, scheduling and work order integrity. They identify the desired schedule (forecast and populate a Master Production Schedule. They create a BOM with work orders adding operations and material. The Production Management/Control is the function of directing or regulating the movement of

Driving for shorter outages

International Nuclear Information System (INIS)

Tritch, S.

1996-01-01

Nuclear plant outages are necessary to complete activities that cannot be completed during the operating cycle, such as steam generator inspection and testing, refueling, installing modifications, and performing maintenance tests. The time devoted to performing outages is normally the largest contributor to plant unavailability. Similarly, outage costs are a sizable portion of the total plant budget. The scope and quality of work done during outages directly affects operating reliability and the number of unplanned outages. Improved management and planning of outages enhances the margin of safety during the outage and results in increased plant reliability. The detailed planning and in-depth preparation that has become a necessity for driving shorter outage durations has also produced safer outages and improved post-outage reliability. Short outages require both plant and vendor management to focus on all aspects of the outage. Short outage durations, such as 26 days at South Texas or 29 days at North Anna, require power plant inter-department and intra-department teamwork and communication and vendor participation. In this paper shorter and safer outage at the 3-loop plants in the United States are explained. (J.P.N.)

77 FR 31877 - Corrosion-Resistant Carbon Steel Flat Products From Germany and Korea; Scheduling of Full Five...

Science.gov (United States)

2012-05-30

... INTERNATIONAL TRADE COMMISSION [Investigation Nos. 701-TA-350 and 731-TA-616 and 618 (Third Review)] Corrosion-Resistant Carbon Steel Flat Products From Germany and Korea; Scheduling of Full Five-Year Reviews... corrosion-resistant carbon steel flat products from Korea and the antidumping duty orders on corrosion...

Car painting process scheduling with harmony search algorithm

Science.gov (United States)

Syahputra, M. F.; Maiyasya, A.; Purnamawati, S.; Abdullah, D.; Albra, W.; Heikal, M.; Abdurrahman, A.; Khaddafi, M.

2018-02-01

Automotive painting program in the process of painting the car body by using robot power, making efficiency in the production system. Production system will be more efficient if pay attention to scheduling of car order which will be done by considering painting body shape of car. Flow shop scheduling is a scheduling model in which the job-job to be processed entirely flows in the same product direction / path. Scheduling problems often arise if there are n jobs to be processed on the machine, which must be specified which must be done first and how to allocate jobs on the machine to obtain a scheduled production process. Harmony Search Algorithm is a metaheuristic optimization algorithm based on music. The algorithm is inspired by observations that lead to music in search of perfect harmony. This musical harmony is in line to find optimal in the optimization process. Based on the tests that have been done, obtained the optimal car sequence with minimum makespan value.

An imperialist competitive algorithm for solving the production scheduling problem in open pit mine

Directory of Open Access Journals (Sweden)

Mojtaba Mokhtarian Asl

2016-06-01

Full Text Available Production scheduling (planning of an open-pit mine is the procedure during which the rock blocks are assigned to different production periods in a way that the highest net present value of the project achieved subject to operational constraints. The paper introduces a new and computationally less expensive meta-heuristic technique known as imperialist competitive algorithm (ICA for long-term production planning of open pit mines. The proposed algorithm modifies the original rules of the assimilation process. The ICA performance for different levels of the control factors has been studied and the results are presented. The result showed that ICA could be efficiently applied on mine production planning problem.

A Gas Scheduling Optimization Model for Steel Enterprises

Directory of Open Access Journals (Sweden)

Niu Honghai

2017-01-01

Full Text Available Regarding the scheduling problems of steel enterprises, this research designs the gas scheduling optimization model according to the rules and priorities. Considering different features and the process changes of the gas unit in the process of actual production, the calculation model of process state and gas consumption soft measurement together with the rules of scheduling optimization is proposed to provide the dispatchers with real-time gas using status of each process, then help them to timely schedule and reduce the gas volume fluctuations. In the meantime, operation forewarning and alarm functions are provided to avoid the abnormal situation in the scheduling, which has brought about very good application effect in the actual scheduling and ensures the safety of the gas pipe network system and the production stability.

Cbs (Contrastrain Based Schedulling Adalah Faktor Penentu Keberhasilan Perusahanan Printing

Directory of Open Access Journals (Sweden)

Hendra Achmadi

2010-06-01

Full Text Available In a highly competitive industry faces today ranging from small or home-based printing to using machine that can print offset a hundred thousand copies per hour. But, the increasing competition resulted in requiring a faster production time from order entry, print proff until the production process to delivery to customers. Often times in case of orders which will result in the concurrent PPIC will experience vertigo in the setting of production schedules which have concurrent delivery time. Often will end up with no receipt of orders due to difficulties in the production schedule, especially if the orders require the same offset machine and cylinder wear the same length, while the number of cylinders is limited. Therefore, the printing company should be able to do so in the conduct of a penetration timing of production can easily be simulated and implemented on the ground. CBS (Base Constraint scheduling is a technique to do the scheduling of production so that production can be carried out smoothly and quickly that fulfill the promise made to customers. In scheduling, there are several techniques that can be used are: FCFS (First Came First Serve, EDD (Earliest Date, and LCLS (Last Came Last Serve. So, it is required to be able to do way better scheduling to get results quickly in this fast changing schedules.

Reactor outage schedule (tentative)

Energy Technology Data Exchange (ETDEWEB)

Walton, R.P.

1969-11-01

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

Reactor outage schedule (tentative)

Energy Technology Data Exchange (ETDEWEB)

Walton, R.P.

1969-10-01

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

Reactor outage schedule (tentative)

Energy Technology Data Exchange (ETDEWEB)

Walton, R.P.

1969-10-15

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

Reactor outage schedule (tentative)

Energy Technology Data Exchange (ETDEWEB)

Walton, R.P.

1969-09-15

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

Reactor outage schedule (tentative)

Energy Technology Data Exchange (ETDEWEB)

Walton, R.P.

1969-12-15

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

Reactor outage schedule (tentative)

Energy Technology Data Exchange (ETDEWEB)

Walton, R.P.

1969-12-01

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

Integrated Job Scheduling and Network Routing

DEFF Research Database (Denmark)

Gamst, Mette; Pisinger, David

2013-01-01

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

A hybrid flow shop model for an ice cream production scheduling problem

Directory of Open Access Journals (Sweden)

Imma Ribas Vila

2009-07-01

Full Text Available Normal 0 21 false false false ES X-NONE X-NONE /* Style Definitions */ table.MsoNormalTable {mso-style-name:"Taula normal"; mso-tstyle-rowband-size:0; mso-tstyle-colband-size:0; mso-style-noshow:yes; mso-style-priority:99; mso-style-qformat:yes; mso-style-parent:""; mso-padding-alt:0cm 5.4pt 0cm 5.4pt; mso-para-margin:0cm; mso-para-margin-bottom:.0001pt; mso-pagination:widow-orphan; font-size:10.0pt; font-family:"Times New Roman","serif";} In this paper we address the scheduling problem that comes from an ice cream manufacturing company. This production system can be modelled as a three stage nowait hybrid flow shop with batch dependent setup costs. To contribute reducing the gap between theory and practice we have considered the real constraints and the criteria used by planners. The problem considered has been formulated as a mixed integer programming. Further, two competitive heuristic procedures have been developed and one of them will be proposed to schedule in the ice cream factory.

Self-certification and employee training of mail-order distributors of scheduled listed chemical products. Interim final rule with request for comment.

Science.gov (United States)

2011-04-13

On October 12, 2010, the President signed the Combat Methamphetamine Enhancement Act of 2010 (MEA). It establishes new requirements for mail-order distributors of scheduled listed chemical products. Mail-order distributors must now self-certify to DEA in order to sell scheduled listed chemical products at retail. Sales at retail are those sales intended for personal use; mail-order distributors that sell scheduled listed chemical products not intended for personal use, e.g., sale to a university, are not affected by the new law. This self-certification must include a statement that the mail-order distributor understands each of the requirements that apply under part 1314 and agrees to comply with these requirements. Additionally, mail-order distributors are now required to train their employees prior to self certification. DEA is promulgating this rule to incorporate the statutory provisions and make its regulations consistent with the new requirements and other existing regulations related to self-certification.

Travel time and concurrent-schedule choice: retrospective versus prospective control.

OpenAIRE

Davison, M; Elliffe, D

2000-01-01

Six pigeons were trained on concurrent variable-interval schedules in which two different travel times between alternatives, 4.5 and 0.5 s, were randomly arranged. In Part 1, the next travel time was signaled while the subjects were responding on each alternative. Generalized matching analyses of performance in the presence of the two travel-time signals showed significantly higher response and time sensitivity when the longer travel time was signaled compared to when the shorter time was sig...

36 CFR 223.81 - Shorter advertising periods in emergencies.

Science.gov (United States)

2010-07-01

... 36 Parks, Forests, and Public Property 2 2010-07-01 2010-07-01 false Shorter advertising periods... OF AGRICULTURE SALE AND DISPOSAL OF NATIONAL FOREST SYSTEM TIMBER Timber Sale Contracts Advertisement and Bids § 223.81 Shorter advertising periods in emergencies. In emergency situations where prompt...

Implementation of quality assurance with respect to product quality and scheduling

International Nuclear Information System (INIS)

Schleimer, W.F.

1986-04-01

Quality assurance means the whole range of actions which are necessary to meet the client's requirements for the product and the test methods. Audits: The preconditions for fabrication must be fulfilled by approval of the manufacturer's quality assurance system, the staff's qualification, his procedures and his equipments. This is done by means of a system audit at KWU or an equivalent organisation. Specifications: For quality assurance the requirements for the components are fixed in specifications. There are material specifications, process/procedure specifications, components specifications. Approval of Component Design and Manufacture (Scheduling): The approval procedure of a structurally welded part is described as an example of the approval of component design and manufacture, thus representing one small piece of a mechanical equipment. In-Process Surveillance (Product Audit): At KWU the in-process surveillance is regulated by a KQ- or product audit concept. In this concept we have K- and KQ-steps. The list of KQ-steps will be presented. Documentation: All test or examination steps are documented with certificates, lists, and stamps for the final documentation. 19 figs

The bases for optimisation of scheduled repairs and tests of safety systems to improve the NPP productive efficiency

International Nuclear Information System (INIS)

Bilej, D.V.; Vasil'chenko, S.V.; Vlasenko, N.I.; Vasil'chenko, V.N.; Skalozubov, V.I.

2004-01-01

In the frames of risk-informed approaches the paper proposed the theoretical bases for methods of optimisation of scheduled repairs and tests of safety systems at nuclear power plants. The optimisation criterion is the objective risk function minimising. This function depends on the scheduled repairs/tests periodicity and the allowed time to bring the system channel to a state of non-operability. The main optimisation direct is to reduce the repair time with the purpose of enhancement of productive efficiency

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

Science.gov (United States)

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.

SPANR planning and scheduling

Science.gov (United States)

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

2001-07-01

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

Decentralized scheduling algorithm to improve the rate of production without increasing the stocks of intermediates; Zaiko wo fuyasu kotonaku seisan sokudo wo kojo saseru jiritsu bunsangata sukejuringu arugorizumu

Energy Technology Data Exchange (ETDEWEB)

Takeda, Kazuhiro; Shiigi, Daisuke; Tsuge, Yoshifumi; Matsuyama, Hisayoshi [Kyushu University, Fukuoka (Japan). Department of Chemical Engineering

1999-03-10

In a factory with a multi-stage production system, push-type scheduling methods can hardly improve the production rate without increasing the stocks of intermediates. For products whose specifications are known before their orders, a pull-type scheduling method named Kanban system has been developed, and has succeeded to improve the production rate without increasing the stocks of intermediates. The Kanban system, however, is not applicable to custom-made products whose specifications are not known before their orders. In this paper, a 'Virtual Kanban (VK) system' is presented as a pull-type scheduling method which is applicable to custom-made products, and its usefulness is demonstrated by simulation of an application specific integrated circuit manufacturing facility. (author)

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

Directory of Open Access Journals (Sweden)

Zhou Erming

2017-01-01

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

Online scheduling of 2-re-entrant flexible manufacturing systems

NARCIS (Netherlands)

Pinxten, J. van; Waqas, U.; Geilen, M.; Basten, T.; Somers, L.

2017-01-01

Online scheduling of operations is essential to optimize productivity of flexible manufacturing systems (FMSs) where manufacturing requests arrive on the fly. An FMS processes products according to a particular flow through processing stations. This work focusses on online scheduling of re-entrant

77 FR 67395 - Corrosion-Resistant Carbon Steel Flat Products From Germany and Korea; Revised Schedule for the...

Science.gov (United States)

2012-11-09

... INTERNATIONAL TRADE COMMISSION [Investigation Nos. 701-TA-350 and 731-TA-616 and 618 (Third Review)] Corrosion-Resistant Carbon Steel Flat Products From Germany and Korea; Revised Schedule for the Subject Reviews AGENCY: United States International Trade Commission. ACTION: Notice. DATES: Effective Date...

Optimal imaging surveillance schedules after liver-directed therapy for hepatocellular carcinoma.

Science.gov (United States)

Boas, F Edward; Do, Bao; Louie, John D; Kothary, Nishita; Hwang, Gloria L; Kuo, William T; Hovsepian, David M; Kantrowitz, Mark; Sze, Daniel Y

2015-01-01

To optimize surveillance schedules for the detection of recurrent hepatocellular carcinoma (HCC) after liver-directed therapy. New methods have emerged that allow quantitative analysis and optimization of surveillance schedules for diseases with substantial rates of recurrence such as HCC. These methods were applied to 1,766 consecutive chemoembolization, radioembolization, and radiofrequency ablation procedures performed on 910 patients between 2006 and 2011. Computed tomography or magnetic resonance imaging performed just before repeat therapy was set as the time of "recurrence," which included residual and locally recurrent tumor as well as new liver tumors. Time-to-recurrence distribution was estimated by Kaplan-Meier method. Average diagnostic delay (time between recurrence and detection) was calculated for each proposed surveillance schedule using the time-to-recurrence distribution. An optimized surveillance schedule could then be derived to minimize the average diagnostic delay. Recurrence is 6.5 times more likely in the first year after treatment than in the second. Therefore, screening should be much more frequent in the first year. For eight time points in the first 2 years of follow-up, the optimal schedule is 2, 4, 6, 8, 11, 14, 18, and 24 months. This schedule reduces diagnostic delay compared with published schedules and is cost-effective. The calculated optimal surveillance schedules include shorter-interval follow-up when there is a higher probability of recurrence and longer-interval follow-up when there is a lower probability. Cost can be optimized for a specified acceptable diagnostic delay or diagnostic delay can be optimized within a specified acceptable cost. Copyright © 2015 SIR. Published by Elsevier Inc. All rights reserved.

The impact of service-specific staffing, case scheduling, turnovers, and first-case starts on anesthesia group and operating room productivity: a tutorial using data from an Australian hospital.

Science.gov (United States)

McIntosh, Catherine; Dexter, Franklin; Epstein, Richard H

2006-12-01

In this tutorial, we consider the impact of operating room (OR) management on anesthesia group and OR labor productivity and costs. Most of the tutorial focuses on the steps required for each facility to refine its OR allocations using its own data collected during patient care. Data from a hospital in Australia are used throughout to illustrate the methods. OR allocation is a two-stage process. During the initial tactical stage of allocating OR time, OR capacity ("block time") is adjusted. For operational decision-making on a shorter-term basis, the existing workload can be considered fixed. Staffing is matched to that workload based on maximizing the efficiency of use of OR time. Scheduling cases and making decisions on the day of surgery to increase OR efficiency are worthwhile interventions to increase anesthesia group productivity. However, by far, the most important step is the appropriate refinement of OR allocations (i.e., planning service-specific staffing) 2-3 mo before the day of surgery. Reducing surgical and/or turnover times and delays in first-case-of-the-day starts generally provides small reductions in OR labor costs. Results vary widely because they are highly sensitive both to the OR allocations (i.e., staffing) and to the appropriateness of those OR allocations.

REORGANIZATION OF THE TECHNOLOGICAL FLOW AT CLOTHING COMPANY THROUGH THE PRODUCTION SCHEDULE

Directory of Open Access Journals (Sweden)

GHELBET Angela

2017-05-01

Full Text Available One of the main difficulties that light industry, namely clothing manufacturing sector faces today is inadequate organization of production processes. This is one of the most common and most serious obstacles in companies in the country, leading to low productivity. In order to reveal the causes of the problem and to develop solutions for change, it is proposed to conduct a study of a company facing difficulties in organizing the production process. It is important that the method/tool applied for the study is able to solve the problems occurring in the production process with minimum effort and maximum efficiency. The study was conducted within the process of manufacturing of a model of special clothing, namely clothing for doctors. The study was conducted within February-March 2016 at a clothing company of the Republic of Moldova. The study conducted shows that the transport issue in the technological flow can be solved by applying the production schedule, which eventually increases labor productivity by eliminating the time necessary to transport the labor object from one place of work to another, leading to economic growth considerable for the company. Following the assessments referring to the proposed improvements to organize the technological flow, there should be a 20% reduction in manufacturing time of a product, which will directly increase the revenue of the company by at least 10%.

The applicability of knowledge-based scheduling to the utilities industry

International Nuclear Information System (INIS)

Yoshimoto, G.; Gargan, R. Jr.; Duggan, P.

1992-01-01

The Electric Power Research Institute (EPRI), Nuclear Power Division, has identified the three major goals of high technology applications for nuclear power plants. These goals are to enhance power production through increasing power generation efficiency, to increase productivity of the operations, and to reduce the threats to the safety of the plant. Our project responds to the second goal by demonstrating that significant productivity increases can be achieved for outage maintenance operations based on existing knowledge-based scheduling technology. Its use can also mitigate threats to potential safety problems by means of the integration of risk assessment features into the scheduler. The scheduling approach uses advanced techniques enabling the automation of the routine scheduling decision process that previously was handled by people. The process of removing conflicts in scheduling is automated. This is achieved by providing activity representations that allow schedulers to express a variety of different scheduling constraints and by implementing scheduling mechanisms that simulate kinds of processes that humans use to find better solutions from a large number of possible solutions. This approach allows schedulers to express detailed constraints between activities and other activities, resources (material and personnel), and requirements that certain states exist for their execution. Our scheduler has already demonstrated its benefit to improving the shuttle processing flow management at Kennedy Space Center. Knowledge-based scheduling techniques should be examined by utilities industry researchers, developers, operators and management for application to utilities planning problems because of its great cost benefit potential. 4 refs., 4 figs

Some extensions of the discrete lotsizing and scheduling problem

NARCIS (Netherlands)

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

1991-01-01

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

Automated scheduling and planning from theory to practice

CERN Document Server

Ozcan, Ender; Urquhart, Neil

2013-01-01

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

Schedules of Controlled Substances: Placement of FDA-Approved Products of Oral Solutions Containing Dronabinol [(-)-delta-9-trans-

Science.gov (United States)

2017-11-22

This final rule adopts without changes an interim final rule with request for comments published in the Federal Register on March 23, 2017. On July 1, 2016, the U.S. Food and Drug Administration (FDA) approved a new drug application for Syndros, a drug product consisting of dronabinol [(-)-delta-9-trans-tetrahydrocannabinol (delta-9-THC)] oral solution. The Drug Enforcement Administration (DEA) maintains FDA-approved products of oral solutions containing dronabinol in schedule II of the Controlled Substances Act.

Optimal Research and Numerical Simulation for Scheduling No-Wait Flow Shop in Steel Production

Directory of Open Access Journals (Sweden)

Huawei Yuan

2013-01-01

Full Text Available This paper considers the m-machine flow shop scheduling problem with the no-wait constraint to minimize total completion time which is the typical model in steel production. First, the asymptotic optimality of the Shortest Processing Time (SPT first rule is proven for this problem. To further evaluate the performance of the algorithm, a new lower bound with performance guarantee is designed. At the end of the paper, numerical simulations show the effectiveness of the proposed algorithm and lower bound.

Developing optimal nurses work schedule using integer programming

Science.gov (United States)

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

2017-08-01

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

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

Directory of Open Access Journals (Sweden)

Logan D. R. Beal

2017-12-01

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

Medium-dose-rate brachytherapy of cancer of the cervix: preliminary results of a prospectively designed schedule based on the linear-quadratic model

International Nuclear Information System (INIS)

Leborgne, Felix; Fowler, Jack F.; Leborgne, Jose H.; Zubizarreta, Eduardo; Curochquin, Rene

1999-01-01

Purpose: To compare results and complications of our previous low-dose-rate (LDR) brachytherapy schedule for early-stage cancer of the cervix, with a prospectively designed medium-dose-rate (MDR) schedule, based on the linear-quadratic model (LQ). Methods and Materials: A combination of brachytherapy, external beam pelvic and parametrial irradiation was used in 102 consecutive Stage Ib-IIb LDR treated patients (1986-1990) and 42 equally staged MDR treated patients (1994-1996). The planned MDR schedule consisted of three insertions on three treatment days with six 8-Gy brachytherapy fractions to Point A, two on each treatment day with an interfraction interval of 6 hours, plus 18 Gy external whole pelvic dose, and followed by additional parametrial irradiation. The calculated biologically effective dose (BED) for tumor was 90 Gy 10 and for rectum below 125 Gy 3 . Results: In practice the MDR brachytherapy schedule achieved a tumor BED of 86 Gy 10 and a rectal BED of 101 Gy 3 . The latter was better than originally planned due to a reduction from 85% to 77% in the percentage of the mean dose to the rectum in relation to Point A. The mean overall treatment time was 10 days shorter for MDR in comparison with LDR. The 3-year actuarial central control for LDR and MDR was 97% and 98% (p = NS), respectively. The Grades 2 and 3 late complications (scale 0 to 3) were 1% and 2.4%, respectively for LDR (3-year) and MDR (2-year). Conclusions: LQ is a reliable tool for designing new schedules with altered fractionation and dose rates. The MDR schedule has proven to be an equivalent treatment schedule compared with LDR, with an additional advantage of having a shorter overall treatment time. The mean rectal BED Gy 3 was lower than expected

"The stone which the builders rejected...": Delay of reinforcement and response rate on fixed-interval and related schedules.

Science.gov (United States)

Wearden, J H; Lejeune, Helga

2006-02-28

The article deals with response rates (mainly running and peak or terminal rates) on simple and on some mixed-FI schedules and explores the idea that these rates are determined by the average delay of reinforcement for responses occurring during the response periods that the schedules generate. The effects of reinforcement delay are assumed to be mediated by a hyperbolic delay of reinforcement gradient. The account predicts that (a) running rates on simple FI schedules should increase with increasing rate of reinforcement, in a manner close to that required by Herrnstein's equation, (b) improving temporal control during acquisition should be associated with increasing running rates, (c) two-valued mixed-FI schedules with equiprobable components should produce complex results, with peak rates sometimes being higher on the longer component schedule, and (d) that effects of reinforcement probability on mixed-FI should affect the response rate at the time of the shorter component only. All these predictions were confirmed by data, although effects in some experiments remain outside the scope of the model. In general, delay of reinforcement as a determinant of response rate on FI and related schedules (rather than temporal control on such schedules) seems a useful starting point for a more thorough analysis of some neglected questions about performance on FI and related schedules.

50 CFR 260.70 - Schedule of fees.

Science.gov (United States)

2010-10-01

... 50 Wildlife and Fisheries 7 2010-10-01 2010-10-01 false Schedule of fees. 260.70 Section 260.70... Products for Human Consumption Fees and Charges § 260.70 Schedule of fees. (a) Unless otherwise provided in a written agreement between the applicant and the Secretary, the fees to be charged and collected...

Designing scheduling concept and computer support in the food processing industries

NARCIS (Netherlands)

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

1998-01-01

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

A Novel Assembly Line Scheduling Algorithm Based on CE-PSO

Directory of Open Access Journals (Sweden)

Xiaomei Hu

2015-01-01

Full Text Available With the widespread application of assembly line in enterprises, assembly line scheduling is an important problem in the production since it directly affects the productivity of the whole manufacturing system. The mathematical model of assembly line scheduling problem is put forward and key data are confirmed. A double objective optimization model based on equipment utilization and delivery time loss is built, and optimization solution strategy is described. Based on the idea of solution strategy, assembly line scheduling algorithm based on CE-PSO is proposed to overcome the shortcomings of the standard PSO. Through the simulation experiments of two examples, the validity of the assembly line scheduling algorithm based on CE-PSO is proved.

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

Directory of Open Access Journals (Sweden)

Chandramouli Anandaraman

2011-10-01

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

The effect of the greek research reactor operating schedule on its fission product inventory

International Nuclear Information System (INIS)

Annousis, J.N., Armyriotis, J.S.

1987-12-01

A simple method to convert the fission product inventory of the 'Democritos' uous Greek Research Reactor (GRR) corresponding to its continuous operation over a given time interval, into the inventory corresponting to GRR discontinuous but periodic operation of the same total duration, is presented in this paper. Relevant correction factors for 31 radioecologically significant radionuclides of the inventory are given as a function of the number of hours or operation per day, 5 days per week of the GRR, according to its present of possible future operating schedule

The effect of the Greek Research Reactor operating schedule on its fission product inventory

International Nuclear Information System (INIS)

ANOUSSIS, J.N.; ARMYRIOTIS, J.S.

1987-12-01

Full text:A simple method to convert the fission product inventory of ''Demokritos'' Greek Research Reactor(GRR) corresponding to its continuous operation over a given time interval, into the inventory corresponding to GRR discontinuous but periodic operation of the same total duration, is presented in this paper. Relevant correction factors for 31 radioecologically significant radionuclides of the inventory are given as a function of the number of hours of operation per day, 5 days per week of the GRR, according to its present or possible future operating schedule. (author)

Production scheduling of a lignite mine under quality and reserves uncertainty

International Nuclear Information System (INIS)

Galetakis, Michael; Roumpos, Christos; Alevizos, George; Vamvuka, Despina

2011-01-01

The effect of uncertainty sources to the stochastic optimization of the combined project of a new surface lignite mine exploitation and power plant operation for electricity generation is investigated. Major sources of uncertainty that were considered are the reserves and the quality of the lignite. Since probability distribution functions for these uncertainties were estimated during the detailed exploration phase of the deposit, the overall goal is then to determine the optimal capacity of the power plant and consequently the optimal production rate of the mine over the time. The optimization objective that was selected is the maximization of the net present value of the project. Emphasis is placed on the sensitivity analysis for the investigation of the effect of quality and reserves uncertainty on project optimization, on the mathematical formulation of risk attitude strategy and on increasing the efficiency of the optimization process by creating a limited set of feasible solutions applying empirical rules. The developed methodology was applied for the determination of the optimal annual production rate of a new surface lignite mine in the area of Ptolemais–Amynteon in Northern Greece. - Highlights: ► Quality and reserves uncertainty affects considerably the production scheduling. ► Stochastic optimization is greatly accelerated by incorporating Taylor's rule. ► Decisions can be made considering different risk level attitudes.

Implementation Learning and Forgetting Curve to Scheduling in Garment Industry

Science.gov (United States)

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

2016-02-01

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

Scheduling job shop - A case study

Science.gov (United States)

Abas, M.; Abbas, A.; Khan, W. A.

2016-08-01

The scheduling in job shop is important for efficient utilization of machines in the manufacturing industry. There are number of algorithms available for scheduling of jobs which depend on machines tools, indirect consumables and jobs which are to be processed. In this paper a case study is presented for scheduling of jobs when parts are treated on available machines. Through time and motion study setup time and operation time are measured as total processing time for variety of products having different manufacturing processes. Based on due dates different level of priority are assigned to the jobs and the jobs are scheduled on the basis of priority. In view of the measured processing time, the times for processing of some new jobs are estimated and for efficient utilization of the machines available an algorithm is proposed and validated.

Patient safety, resident well-being and continuity of care with different resident duty schedules in the intensive care unit: a randomized trial.

Science.gov (United States)

Parshuram, Christopher S; Amaral, Andre C K B; Ferguson, Niall D; Baker, G Ross; Etchells, Edward E; Flintoft, Virginia; Granton, John; Lingard, Lorelei; Kirpalani, Haresh; Mehta, Sangeeta; Moldofsky, Harvey; Scales, Damon C; Stewart, Thomas E; Willan, Andrew R; Friedrich, Jan O

2015-03-17

Shorter resident duty periods are increasingly mandated to improve patient safety and physician well-being. However, increases in continuity-related errors may counteract the purported benefits of reducing fatigue. We evaluated the effects of 3 resident schedules in the intensive care unit (ICU) on patient safety, resident well-being and continuity of care. Residents in 2 university-affiliated ICUs were randomly assigned (in 2-month rotation-blocks from January to June 2009) to in-house overnight schedules of 24, 16 or 12 hours. The primary patient outcome was adverse events. The primary resident outcome was sleepiness, measured by the 7-point Stanford Sleepiness Scale. Secondary outcomes were patient deaths, preventable adverse events, and residents' physical symptoms and burnout. Continuity of care and perceptions of ICU staff were also assessed. We evaluated 47 (96%) of 49 residents, all 971 admissions, 5894 patient-days and 452 staff surveys. We found no effect of schedule (24-, 16- or 12-h shifts) on adverse events (81.3, 76.3 and 78.2 events per 1000 patient-days, respectively; p = 0.7) or on residents' sleepiness in the daytime (mean rating 2.33, 2.61 and 2.30, respectively; p = 0.3) or at night (mean rating 3.06, 2.73 and 2.42, respectively; p = 0.2). Seven of 8 preventable adverse events occurred with the 12-hour schedule (p = 0.1). Mortality rates were similar for the 3 schedules. Residents' somatic symptoms were more severe and more frequent with the 24-hour schedule (p = 0.04); however, burnout was similar across the groups. ICU staff rated residents' knowledge and decision-making worst with the 16-hour schedule. Our findings do not support the purported advantages of shorter duty schedules. They also highlight the trade-offs between residents' symptoms and multiple secondary measures of patient safety. Further delineation of this emerging signal is required before widespread system change. ClinicalTrials.gov, no. NCT00679809. © 2015 Canadian Medical

Hypofractionated Breast Radiation: Shorter Scheme, Lower Toxicity.

Science.gov (United States)

Linares, Isabel; Tovar, María Isabel; Zurita, Mercedes; Guerrero, Rosario; Expósito, Manuela; Del Moral, Rosario

2016-08-01

We analyzed the toxicity and cosmetic outcomes for patients who had undergone 3-dimensional conformal radiotherapy with a hypofractionated schedule and identified the risk factors associated with such a schedule. A total of 143 patients were treated for breast cancer (stage 0-III) with a hypofractionated radiation schedule after breast-conserving surgery from 2006 to 2011. Most patients received 42.4 Gy in 16 daily fractions, 2.65 Gy per fraction to the whole breast plus an additional simultaneous integrated or sequential boost to the tumor bed. The median follow-up period was 36 months. Mild acute skin toxicity was observed in 62%; 7% of the patients developed moderate skin toxicity, but no grade 4 toxicity was observed. The prevalence of fibrosis within the boost area was 5%, but no grade ≥ 2 was observed. The prevalence of fibrosis of any grade was greater in the nonboost (23%) than in the boost area. Of all the patients, 91% had good or excellent cosmetic outcomes. From the multivariate analysis, the incidence of epithelitis correlated with the patient's treated volume (P = .044). The incidence of acute toxicity correlated with the boost type to the tumor bed and the total treatment dose (P = .012 and P = .002, respectively). Also, a poor to fair cosmetic outcome was significantly associated statistically with the surgery type (P = .05), boost type (P = .004), and total dose (P = .001). Delivering whole-breast irradiation with a hypofractionated schedule of 42.4 Gy plus a simultaneous integrated boost to the tumor bed appears to be a safe and effective technique, with good cosmetic results and lower toxicity. Copyright © 2015 Elsevier Inc. All rights reserved.

Meta-heuristic algorithms for parallel identical machines scheduling problem with weighted late work criterion and common due date.

Science.gov (United States)

Xu, Zhenzhen; Zou, Yongxing; Kong, Xiangjie

2015-01-01

To our knowledge, this paper investigates the first application of meta-heuristic algorithms to tackle the parallel machines scheduling problem with weighted late work criterion and common due date ([Formula: see text]). Late work criterion is one of the performance measures of scheduling problems which considers the length of late parts of particular jobs when evaluating the quality of scheduling. Since this problem is known to be NP-hard, three meta-heuristic algorithms, namely ant colony system, genetic algorithm, and simulated annealing are designed and implemented, respectively. We also propose a novel algorithm named LDF (largest density first) which is improved from LPT (longest processing time first). The computational experiments compared these meta-heuristic algorithms with LDF, LPT and LS (list scheduling), and the experimental results show that SA performs the best in most cases. However, LDF is better than SA in some conditions, moreover, the running time of LDF is much shorter than SA.

Distributed continuous energy scheduling for dynamic virtual power plants

International Nuclear Information System (INIS)

Niesse, Astrid

2015-01-01

This thesis presents DynaSCOPE as distributed control method for continuous energy scheduling for dynamic virtual power plants (DVPP). DVPPs aggregate the flexibility of distributed energy units to address current energy markets. As an extension of the Virtual Power Plant concept they show high dynamics in aggregation and operation of energy units. Whereas operation schedules are set up for all energy units in a day-ahead planning procedure, incidents may render these schedules infeasible during execution, like deviation from prognoses or outages. Thus, a continuous scheduling process is needed to ensure product fulfillment. With DynaSCOPE, software agents representing single energy units solve this problem in a completely distributed heuristic approach. Using a stepped concept, several damping mechanisms are applied to allow minimum disturbance while continuously trying to fulfill the product as contracted at the market.

Combined Noncyclic Scheduling and Advanced Control for Continuous Chemical Processes

Directory of Open Access Journals (Sweden)

Damon Petersen

2017-12-01

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

Constraint-based job shop scheduling with ILOG SCHEDULER

NARCIS (Netherlands)

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

1998-01-01

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

Stage, tumor growth rate and optimal dose fractionation schedules in the treatment of squamous cell carcinoma of the head and neck

International Nuclear Information System (INIS)

Sugawara, Tadashi; Morita, Mamoru; Aihara, Toshinori; Tanaka, Osamu

1983-01-01

In 77 patients with cancer of the head and neck, 45 patients received radiotherapy alone, while 32 patients with T 1 or T 2 glottic cancer received combined therapy with laryngomicrosurgery performed prior to or during the course of irradiation. These T 1 and T 2 groups were separately analyzed from other T 1 and T 2 groups as T sub(LMS). Local recurrence rates were compared concerning overall time and fraction size in following three subgroups, i.e., T sub(LMS), Tsub(1+2), and Tsub(3+4). No significant correlation was detected between total dose converted to partial tolerance (PT) and local control in all subgroups except for Tsub(3+4), in which local recurrence rate was rather higher in high PT range. Local control was significantly dependent on overall treatment time and fraction size, differently by tumor stage. Favorable fractionation schedules considered as optimal for T sub(LMS) were those in which treatment was given 5 times weekly with a daily dose rate more than 196 rad in a shorter overall time of less than 42 days. In contrast to T sub(LMS), effective schedules for Tsub(3+4) consisted of longer overall time of more than 60 days and a lower daily dose rate of less than 153 rad. In Tsub(1+2), the optimal schedule was needed to be altered according to rapidness of progression of disease characterised by duration of the complaints, which was statistically proved to be significantly shorter in Tsub(1+2) than Tsub(3+4). Rapidity-adjusted schedule consisted of a shorter over-all time of less than 49 days with a daily dose rate of more than 175 rad 5 fractions a week for a case having a duration of complaints of less than 2.9 months, and a longer overall time of more than 50 days with a daily dose rate of less than 174 rad for a case having a duration of more than 3 months. (J.P.N.)

Flow-shop scheduling problem under uncertainties: Review and trends

Directory of Open Access Journals (Sweden)

Eliana María González-Neira

2017-03-01

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

Short-term scheduling of an open-pit mine with multiple objectives

Science.gov (United States)

Blom, Michelle; Pearce, Adrian R.; Stuckey, Peter J.

2017-05-01

This article presents a novel algorithm for the generation of multiple short-term production schedules for an open-pit mine, in which several objectives, of varying priority, characterize the quality of each solution. A short-term schedule selects regions of a mine site, known as 'blocks', to be extracted in each week of a planning horizon (typically spanning 13 weeks). Existing tools for constructing these schedules use greedy heuristics, with little optimization. To construct a single schedule in which infrastructure is sufficiently utilized, with production grades consistently close to a desired target, a planner must often run these heuristics many times, adjusting parameters after each iteration. A planner's intuition and experience can evaluate the relative quality and mineability of different schedules in a way that is difficult to automate. Of interest to a short-term planner is the generation of multiple schedules, extracting available ore and waste in varying sequences, which can then be manually compared. This article presents a tool in which multiple, diverse, short-term schedules are constructed, meeting a range of common objectives without the need for iterative parameter adjustment.

Concept of Indoor 3D-Route UAV Scheduling System

DEFF Research Database (Denmark)

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

2016-01-01

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

Flow-shop scheduling problem under uncertainties: Review and trends

OpenAIRE

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

2017-01-01

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

40 CFR Appendix H to Subpart A of... - Clean Air Act Amendments of 1990 Phaseout Schedule for Production of Ozone-Depleting Substances

Science.gov (United States)

2010-07-01

... 40 Protection of Environment 17 2010-07-01 2010-07-01 false Clean Air Act Amendments of 1990 Phaseout Schedule for Production of Ozone-Depleting Substances H Appendix H to Subpart A of Part 82... STRATOSPHERIC OZONE Production and Consumption Controls Pt. 82, Subpt. A, App. H Appendix H to Subpart A of Part...

Mix-oriented manufacturing control (MOMC): a quasi-optimal procedure for dynamic scheduling control

Science.gov (United States)

Cristofari, Marco; Caron, Franco; McDuffie, Ernest L.

1997-12-01

The total system throughput (ST) is one of the most important decision variables at the planning/scheduling phase of a manufacturing system. Material requirement planning (MRP) and master production schedule (MPS) are based on the assumption that ST is known. All the subsequent developments (e.g. jobs- release, system work-load, input-product mix, etc.) depends on such an assumption. If this assumption is incorrect, the production activity control (PAC) will not be able to satisfy the planned targets during the scheduling phase. Delays and bottlenecks will be unavoidable in the system. In case of random flexible manufacturing system (FMS) (or, in general, job-shop production), the measure of ST can not be evaluated a priori without running simulations or observing the actual flow of the operations in the system. The way entities enter the system (sequencing and percentage of the input products) effects the value of ST in such a way that estimation based on historical data are highly risky. The methodology proposed in this paper allows the scheduler to assess the analytical functions which link ST, and other output performance variables, to the input product mix (IPM). This way the robustness of the scheduling plan can be verified before the actual release of the jobs into the system.

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

Directory of Open Access Journals (Sweden)

Behnam Barzegar

2012-01-01

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

Crane Scheduling for a Plate Storage

DEFF Research Database (Denmark)

Hansen, Jesper; Clausen, Jens

2002-01-01

Odense Steel Shipyard produces the worlds largest container ships. The first process of producing the steel ships is handling arrival and storage of steel plates until they are needed in production. This paper considers the problem of scheduling two cranes that carry out the movements of plates...... into, around and out of the storage. The system is required to create a daily schedule for the cranes, but also handle possible disruptions during the execution of the plan. The problem is solved with a Simulated Annealing algorithm....

Alternative Work Schedules Increase Employee Satisfaction.

Science.gov (United States)

Turney, John R.; Cohen, Stanley L.

1983-01-01

Facets of alternative work schedules (AWS) are discussed: importance of employee control, possible negative consequences, AWS handbook, time monitoring systems, and treatment of exceptions. AWS' effect on productivity and motivation is examined. (SK)

A shorter fractionation schedule for postlumpectomy breast cancer patients

International Nuclear Information System (INIS)

Shelley, Wendy; Brundage, Michael; Hayter, Charles; Paszat, Lawrence; Zhou, Sam; Mackillop, William

2000-01-01

Purpose: The purpose of this retrospective review was to determine the effectiveness of 40 Gy in 16 daily fractions in preventing local recurrence in postlumpectomy invasive breast cancer patients whose margins of resection were clear of tumor by at least 2 mm. Methods: Between September 1989 and December 1993, 294 breasts were treated with this regimen. The entire breast was treated, using a tangential parallel pair, with wedges as necessary, to a dose of 40 Gy in 16 daily fractions. No additional boost was given. The median duration of follow-up of surviving patients is 5.5 years. Recently, the patients' assessment of the cosmetic outcome of their treatment was obtained, using a mailed questionnaire. Results: The 5-year actuarial breast-relapse rate was 3.5%, with an overall 5-year survival and disease-specific survival of 87.8% and 92.1%, respectively. In response to the cosmesis questionnaire, 77% of patients stated they were either extremely or very satisfied with the overall appearance of the breast, 19.5% moderately satisfied, and 3.5% either slightly or not at all satisfied. The corresponding responses for overall level of comfort of the breast were 79%, 16.5%, and 4.5% respectively. Conclusion: This regimen is very effective at preventing recurrent breast cancer in this group of patients, and it provides a high level of patient satisfaction with cosmetic outcome. Its short duration offers the added advantage of a more efficient use of resources and greater patient convenience

Integrated Scheduling of Production and Distribution with Release Dates and Capacitated Deliveries

Directory of Open Access Journals (Sweden)

Xueling Zhong

2016-01-01

Full Text Available This paper investigates an integrated scheduling of production and distribution model in a supply chain consisting of a single machine, a customer, and a sufficient number of homogeneous capacitated vehicles. In this model, the customer places a set of orders, each of which has a given release date. All orders are first processed nonpreemptively on the machine and then batch delivered to the customer. Two variations of the model with different objective functions are studied: one is to minimize the arrival time of the last order plus total distribution cost and the other is to minimize total arrival time of the orders plus total distribution cost. For the former one, we provide a polynomial-time exact algorithm. For the latter one, due to its NP-hard property, we provide a heuristic with a worst-case ratio bound of 2.

The importance of interpreting the commercial contract in scheduling the production of a Romanian business operator

Directory of Open Access Journals (Sweden)

Laura MUREŞAN (POŢINCU

2015-12-01

Full Text Available Part of scheduling the production is complying with the conditions of the commercial contract, which is the foundation of the relation between the client and the business operator that performs its activity in the area of the industrial production. In case the compliance with the contractual obligations raises issues, it is required to interpret the commercial contract according to the provisions of the Romanian Civil Code. This work aims at presenting and analyzing these rules of interpreting the commercial contract, which are not provided in the special stipulations of the law applied to the business field, so that one shall consider the rules common to the private law, i.e. the juridical norms provided by the legislation of the civil law.

Extending 3D near-cloud corrections from shorter to longer wavelengths

International Nuclear Information System (INIS)

Marshak, Alexander; Evans, K. Frank; Várnai, Tamás; Wen, Guoyong

2014-01-01

Satellite observations have shown a positive correlation between cloud amount and aerosol optical thickness (AOT) that can be explained by the humidification of aerosols near clouds, and/or by cloud contamination by sub-pixel size clouds and the cloud adjacency effect. The last effect may substantially increase reflected radiation in cloud-free columns, leading to overestimates in the retrieved AOT. For clear-sky areas near boundary layer clouds the main contribution to the enhancement of clear sky reflectance at shorter wavelengths comes from the radiation scattered into clear areas by clouds and then scattered to the sensor by air molecules. Because of the wavelength dependence of air molecule scattering, this process leads to a larger reflectance increase at shorter wavelengths, and can be corrected using a simple two-layer model [18]. However, correcting only for molecular scattering skews spectral properties of the retrieved AOT. Kassianov and Ovtchinnikov [9] proposed a technique that uses spectral reflectance ratios to retrieve AOT in the vicinity of clouds; they assumed that the cloud adjacency effect influences the spectral ratio between reflectances at two wavelengths less than it influences the reflectances themselves. This paper combines the two approaches: It assumes that the 3D correction for the shortest wavelength is known with some uncertainties, and then it estimates the 3D correction for longer wavelengths using a modified ratio method. The new approach is tested with 3D radiances simulated for 26 cumulus fields from Large-Eddy Simulations, supplemented with 40 aerosol profiles. The results showed that (i) for a variety of cumulus cloud scenes and aerosol profiles over ocean the 3D correction due to cloud adjacency effect can be extended from shorter to longer wavelengths and (ii) the 3D corrections for longer wavelengths are not very sensitive to unbiased random uncertainties in the 3D corrections at shorter wavelengths. - Highlights: �

Planning and scheduling for petroleum refineries using mathematical programming

Directory of Open Access Journals (Sweden)

Joly M.

2002-01-01

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

Mixed Criticality Scheduling for Industrial Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Xi Jin

2016-08-01

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

Schedule control in Ling Ao nuclear power project

International Nuclear Information System (INIS)

Xie Ahai

2007-01-01

Ling Ao Nuclear Power Station (LANP) is first one built up by self-reliance in China with power capacity 990x2 MWe. The results of quality control, schedule control and cost control are satisfactory. The commercial operation days of Unit 1 and Unit 2 were 28th May 2002 and 8th Jan. 2003 respectively, which were 48 days and 66 days in advance of the project schedule. This paper presents the practices of self-reliance schedule control system in LANP. The paper includes 10 sections: schedule control system; targets of schedule control; schedule control at early stage of project; construction schedule; scheduling practice; Point curves; schedule control of design and procurement; a good practice of construction schedule control on site; commissioning and startup schedule; schedule control culture. Three figures are attached. The main contents of the self-reliance schedule control system are as follows: to draw up reasonable schedules and targets; to setup management mechanism and procedures; to organize powerful project management team; to establish close monitoring system; to provide timely progress reports and statistics information. Five kinds of schedule control targets are introduced, i.e. bar-chart schedule; milesones; Point curves; interface management; hydraulic test schedule of auxiliary piping loops; EMR/EMC/EESR issuance schedules. Six levels of bar-chart schedules were adopted in LANP, but the bar-chart schedules were not satisfactory for complicated erection condition on site, even using six levels of schedules. So a kind of Point curves was developed and their advantages are explained. Scheduling method of three elements: activity, duration, logic, which was adopted in LANP, is introduced. The duration of each piping activities in LANP level 2 project schedule was calculated based on the relevant working Point quantities. The analysis and adjustment of Point curves are illustrated, i.e. balance of monthly quantities; possible production in the peakload

Capacity optimization and scheduling of a multiproduct manufacturing facility for biotech products.

Science.gov (United States)

Shaik, Munawar A; Dhakre, Ankita; Rathore, Anurag S; Patil, Nitin

2014-01-01

A general mathematical framework has been proposed in this work for scheduling of a multiproduct and multipurpose facility involving manufacturing of biotech products. The specific problem involves several batch operations occurring in multiple units involving fixed processing time, unlimited storage policy, transition times, shared units, and deterministic and fixed data in the given time horizon. The different batch operations are modeled using state-task network representation. Two different mathematical formulations are proposed based on discrete- and continuous-time representations leading to a mixed-integer linear programming model which is solved using General Algebraic Modeling System software. A case study based on a real facility is presented to illustrate the potential and applicability of the proposed models. The continuous-time model required less number of events and has a smaller problem size compared to the discrete-time model. © 2014 American Institute of Chemical Engineers.

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

Science.gov (United States)

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

1986-09-01

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

Multi-objective Mobile Robot Scheduling Problem with Dynamic Time Windows

DEFF Research Database (Denmark)

Dang, Vinh Quang; Nielsen, Izabela Ewa; Steger-Jensen, Kenn

2012-01-01

This paper deals with the problem of scheduling feeding tasks of a single mobile robot which has capability of supplying parts to feeders on pro-duction lines. The performance criterion is to minimize the total traveling time of the robot and the total tardiness of the feeding tasks being scheduled...

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

Science.gov (United States)

2017-05-03

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

Task-specific shell for scheduling problems, ARES[sub TM]/SCH. Scheduling mondai muke task tokka shell ARES[sub TM]/SCH

Energy Technology Data Exchange (ETDEWEB)

Kojima, S; Narimatsu, K [Toshiba Corp., Tokyo (Japan)

1994-08-01

An Expert System (ES) Shell (developed by Toshiba Corp.) which applies to the scheduling of production plan and operation plan is introduced. It describes that this tool is equipped with flowchart editor and constraint condition editor which mention the knowledge related to scheduling method, and that the former expresses scheduling procedure knowledge in the form of flowchart by combining basic tasks prepared beforehand, and the latter expresses constraint conditions which should be satisfied by the schedule, and knowledge related to the priority order which should be considered in-between in the form of IF-THEN Rule which is very close to Japanese. In addition, the knowledge is equipped with knowledge debugging system which conducts debugging while executing the knowledge. It adds that by using this tool, the manhour required for the development and maintenance of ES can be reduced considerably. 2 refs., 3 figs.

Automated Planning and Scheduling for Space Mission Operations

Science.gov (United States)

Chien, Steve; Jonsson, Ari; Knight, Russell

2005-01-01

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

Research and Applications of Shop Scheduling Based on Genetic Algorithms

Directory of Open Access Journals (Sweden)

Hang ZHAO

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

Reprint of: Production scheduling of a lignite mine under quality and reserves uncertainty

International Nuclear Information System (INIS)

Galetakis, Michael; Roumpos, Christos; Alevizos, George; Vamvuka, Despina

2012-01-01

The effect of uncertainty sources to the stochastic optimization of the combined project of a new surface lignite mine exploitation and power plant operation for electricity generation is investigated. Major sources of uncertainty that were considered are the reserves and the quality of the lignite. Since probability distribution functions for these uncertainties were estimated during the detailed exploration phase of the deposit, the overall goal is then to determine the optimal capacity of the power plant and consequently the optimal production rate of the mine over the time. The optimization objective that was selected is the maximization of the net present value of the project. Emphasis is placed on the sensitivity analysis for the investigation of the effect of quality and reserves uncertainty on project optimization, on the mathematical formulation of risk attitude strategy and on increasing the efficiency of the optimization process by creating a limited set of feasible solutions applying empirical rules. The developed methodology was applied for the determination of the optimal annual production rate of a new surface lignite mine in the area of Ptolemais–Amynteon in Northern Greece. - Highlights: ► Quality and reserves uncertainty affects considerably the production scheduling. ► Stochastic optimization is greatly accelerated by incorporating Taylor's rule. ► Decisions can be made considering different risk level attitudes.

Scheduling techniques in the Request Oriented Scheduling Engine (ROSE)

Science.gov (United States)

Zoch, David R.

1991-01-01

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

Effect of sampling schedule on pharmacokinetic parameter estimates of promethazine in astronauts

Science.gov (United States)

Boyd, Jason L.; Wang, Zuwei; Putcha, Lakshmi

2005-08-01

Six astronauts on the Shuttle Transport System (STS) participated in an investigation on the pharmacokinetics of promethazine (PMZ), a medication used for the treatment of space motion sickness (SMS) during flight. Each crewmember completed the protocol once during flight and repeated thirty days after returned to Earth. Saliva samples were collected at scheduled times for 72 h after PMZ administration; more frequent samples were collected on the ground than during flight owing to schedule constraints in flight. PMZ concentrations in saliva were determined by a liquid chromatographic/mass spectrometric (LC-MS) assay and pharmacokinetic parameters (PKPs) were calculated using actual flight and ground-based data sets and using time-matched sampling schedule on ground to that during flight. Volume of distribution (Vc) and clearance (Cls) decreased during flight compared to that from time-matched ground data set; however, ClS and Vc estimates were higher for all subjects when partial ground data sets were used for analysis. Area under the curve (AUC) normalized with administered dose was similar in flight and partial ground data; however AUC was significantly lower using time-matched sampling compared with the full data set on ground. Half life (t1/2) was longest during flight, shorter with matched-sampling schedule on ground and shortest when complete data set from ground was used. Maximum concentration (Cmax), time for Cmax (tmax), parameters of drug absorption, depicted a similar trend with lowest and longest respectively, during flight, lower with time- matched ground data and highest and shortest with full ground data.

Vectorization of a penalty function algorithm for well scheduling

Science.gov (United States)

Absar, I.

1984-01-01

In petroleum engineering, the oil production profiles of a reservoir can be simulated by using a finite gridded model. This profile is affected by the number and choice of wells which in turn is a result of various production limits and constraints including, for example, the economic minimum well spacing, the number of drilling rigs available and the time required to drill and complete a well. After a well is available it may be shut in because of excessive water or gas productions. In order to optimize the field performance a penalty function algorithm was developed for scheduling wells. For an example with some 343 wells and 15 different constraints, the scheduling routine vectorized for the CYBER 205 averaged 560 times faster performance than the scalar version.

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

Science.gov (United States)

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

2018-06-12

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

Comparison of heuristics for an economic lot scheduling problem with deliberated coproduction

Directory of Open Access Journals (Sweden)

Pilar I. Vidal-Carreras

2009-12-01

Full Text Available We built on the Economic Lot Scheduling Problem Scheduling (ELSP literature by making some modifications in order to introduce new constraints which had not been thoroughly studied with a view to simulating specific real situations. Specifically, our aim is to propose and simulate different scheduling policies for a new ELSP variant: Deliberated Coproduction. This problem comprises a product system in an ELSP environment in which we may choose if more than one product can be produced on the machine at a given time. We expressly consider the option of coproducing two products whose demand is not substitutable. In order to draw conclusions, a simulation model and its results were developed in the article by employing modified Bomberger data which include two items that could be produced simultaneously.

Effects of a shortened depreciation schedule on the investment costs for combined heat and power; TOPICAL

International Nuclear Information System (INIS)

Kranz, Nicole; Worrell, Ernst

2001-01-01

We investigate and compare several generic depreciation methods to assess the effectiveness of possible policy measures with respect to the depreciation schedules for investments in combined heat and power plants in the United States. We assess the different depreciation methods for CHP projects of various sizes (ranging from 1 MW to 100 MW). We evaluate the impact of different depreciation schedules on the tax shield, and the resulting tax savings to potential investors. We show that a shorter depreciation cycle could have a substantial impact on the cost of producing power, making cogeneration more attractive. The savings amount to approximately 6-7 percent of capital and fixed operation and maintenance costs, when changing from the current system to a 7 year depreciation scheme with switchover from declining balance to straight line depreciation. Suggestions for further research to improve the analysis are given

A genetic algorithm approach for open-pit mine production scheduling

Directory of Open Access Journals (Sweden)

Aref Alipour

2017-06-01

Full Text Available In an Open-Pit Production Scheduling (OPPS problem, the goal is to determine the mining sequence of an orebody as a block model. In this article, linear programing formulation is used to aim this goal. OPPS problem is known as an NP-hard problem, so an exact mathematical model cannot be applied to solve in the real state. Genetic Algorithm (GA is a well-known member of evolutionary algorithms that widely are utilized to solve NP-hard problems. Herein, GA is implemented in a hypothetical Two-Dimensional (2D copper orebody model. The orebody is featured as two-dimensional (2D array of blocks. Likewise, counterpart 2D GA array was used to represent the OPPS problem’s solution space. Thereupon, the fitness function is defined according to the OPPS problem’s objective function to assess the solution domain. Also, new normalization method was used for the handling of block sequencing constraint. A numerical study is performed to compare the solutions of the exact and GA-based methods. It is shown that the gap between GA and the optimal solution by the exact method is less than % 5; hereupon GA is found to be efficiently in solving OPPS problem.

IRRIGATION SCHEDULING CALCULATOR (ISC TO IMPROVE WATER MANAGEMENT ON FIELD LEVEL IN EGYPT

Directory of Open Access Journals (Sweden)

Samiha Abou El-Fetouh Hamed Ouda

2017-10-01

Full Text Available The developed model is MS excel sheet called “Irrigation Scheduling Calculator, ISC”. The model requires to input daily weather data to calculate daily evapotranspiration using Penman-Monteith equation. The model calculates water depletion from the root zone to determine when to irrigate and how much water should be applied. The charge from irrigation pump is used to calculate how many hours should the farmer run the pump to deliver the needed amount of water. ISC model was used to developed irrigation schedule for wheat and maize planted in El-Gharbia governorate. The developed schedules were compared to the actual schedules for both crops. Furthermore, CropSyst model was calibrated for both crops and run using the developed schedules by ISC model. The simulation results indicated that the calculated irrigation amount by ISC model for wheat was lower than actual schedule by 6.0 mm. Furthermore, the simulated wheat productivity by CropSyst was higher than measured grain and biological by 2%. Similarly, the calculated applied irrigation amount by ISC model for maize was lower than actual schedule by 79.0 mm and the productivity was not changed.

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

Science.gov (United States)

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

1995-03-01

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

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

Directory of Open Access Journals (Sweden)

Jianfei Ye

2015-01-01

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

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

CERN Document Server

Vanhoucke, Mario

2013-01-01

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

NASA scheduling technologies

Science.gov (United States)

Adair, Jerry R.

1994-01-01

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

Radiation therapy for painful bone metastases. Aiming at optimal treatment schedules

International Nuclear Information System (INIS)

Murakami, Ryuji; Saito, Ryuichi; Miyazaki, Toshiyuki; Takahashi, Mutsumasa

2001-01-01

The purpose of this study is to evaluate the pain relief obtained by radiation therapy for painful bone metastases, with a special regard to general condition. Between June 1998 and May 2000, 54 patients with 86 painful bone metastases were treated with radiation therapy whose effects could be evaluated for a minimum period of 6 months or until death. Treatment schedules were 3 Gy/fraction/day (30-36 Gy/10-12 fractions) in usual cases (61 lesions), 4-8 Gy/fraction/day (8-20 Gy/1-5 fractions) in patients with a poor general condition (9 lesions), and 2 Gy/fraction/day (40-50 Gy/20-25 fractions) in lesions with a large radiation field (16 lesions). Complete pain relief without medication (CR) was achieved in 40 lesions (47%). Significant predictors for CR were primary site (p=0.0003), performance status (p=0.0060), pain score (p=00190), narcotic score (p<0.0001), and prognosis (p<0.0001), but no difference was found in CR among treatment schedules. No evidence of severe radiation-induced complication was seen. General condition (performance status and prognosis) has an influence on pain relief. Compared with the daily 2 Gy protocol, the daily 3 Gy protocol has the advantage of shorter treatment time. The treatment schedule should be assessed in patients with a large radiation field and/or poor general condition. Especially for the patients with poor general condition, combined pain medication should be considered. (author)

Evaluating irrigation scheduling of hydroponic tomato in Navarra, Spain

NARCIS (Netherlands)

Lizarraga, H.J.; Boesveld, H.; Huibers, F.P.; Robles, H.

2003-01-01

The correct supply of water and nutrients is important in hydroponic growing systems in order to use water efficiently, avoid stress situations, and control production. The present study was conducted to evaluate two irrigation scheduling techniques for hydroponic tomato production in Navarra,

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

Science.gov (United States)

2010-07-22

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

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

Science.gov (United States)

Richards, Stephen F.

1991-01-01

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

A Heuristic Approach for Determining Lot Sizes and Schedules Using Power-of-Two Policy

Directory of Open Access Journals (Sweden)

Esra Ekinci

2007-01-01

Full Text Available We consider the problem of determining realistic and easy-to-schedule lot sizes in a multiproduct, multistage manufacturing environment. We concentrate on a specific type of production, namely, flow shop type production. The model developed consists of two parts, lot sizing problem and scheduling problem. In lot sizing problem, we employ binary integer programming and determine reorder intervals for each product using power-of-two policy. In the second part, using the results obtained of the lot sizing problem, we employ mixed integer programming to determine schedules for a multiproduct, multistage case with multiple machines in each stage. Finally, we provide a numerical example and compare the results with similar methods found in practice.

Accelerating exact schedulability analysis for fixed-priority pre-emptive scheduling

NARCIS (Netherlands)

Hang, Y.; Jiale, Z.; Keskin, U.; Bril, R.J.

2010-01-01

The schedulability analysis for fixed-priority preemptive scheduling (FPPS) plays a significant role in the real-time systems domain. The so-called Hyperplanes Exact Test (HET) [1] is an example of an exact schedulability test for FPPS. In this paper, we aim at improving the efficiency of HET by

Crane Scheduling on a Plate Storage

DEFF Research Database (Denmark)

Hansen, Jesper

2002-01-01

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

SIMULTANEOUS SCHEDULING AND OPERATIONAL OPTIMIZATION OF MULTIPRODUCT, CYCLIC CONTINUOUS PLANTS

Directory of Open Access Journals (Sweden)

A. Alle

2002-03-01

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

SIMULTANEOUS SCHEDULING AND OPERATIONAL OPTIMIZATION OF MULTIPRODUCT, CYCLIC CONTINUOUS PLANTS

Directory of Open Access Journals (Sweden)

Alle A.

2002-01-01

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

Freezing issue on stability master production scheduling for supplier network: Decision making view

Directory of Open Access Journals (Sweden)

Aisyati Azizah

2017-01-01

Full Text Available In the daily operation, there are frequently changes in customer order requirement which will induce instability of the MPS. Moreover, the frequently adjustment of MPS can induce fluctuation of production and increasing of inventory cost as well as decreasing service level of customer. Most of studies about instability of MPS use freezing method and rolling procedure to adjust MPS periodically. Freezing is the proportion of planning horizon being frozen, whereas rolling procedure is a method replanning periodically of MPS using newly updated demand data. This study is focused on interval freezing length as an issue of decision making. In supply chain, a manufacturer is supported by suppliers to supply material requirement. Since a manufacturer plan production schedule on MPS the freezing interval is determined that will be informed to suppliers which supply the material requirement. In previous research, the freezing interval is decided by manufacturer as necessary decision maker. This decision must be followed by suppliers though it is not beneficial for them. It can be concluded that this condition is no win-win situation. Hence, this research proposes that suppliers will be involved as decision maker besides a manufacturer so the interval freezing is decided by two-side decision maker.

The effect of dynamic scheduling and routing in a solid waste management system

International Nuclear Information System (INIS)

Johansson, Ola M.

2006-01-01

Solid waste collection and hauling account for the greater part of the total cost in modern solid waste management systems. In a recent initiative, 3300 Swedish recycling containers have been fitted with level sensors and wireless communication equipment, thereby giving waste collection operators access to real-time information on the status of each container. In this study, analytical modeling and discrete-event simulation have been used to evaluate different scheduling and routing policies utilizing the real-time data. In addition to the general models developed, an empirical simulation study has been performed on the downtown recycling station system in Malmoe, Sweden. From the study, it can be concluded that dynamic scheduling and routing policies exist that have lower operating costs, shorter collection and hauling distances, and reduced labor hours compared to the static policy with fixed routes and pre-determined pick-up frequencies employed by many waste collection operators today. The results of the analytical model and the simulation models are coherent, and consistent with experiences of the waste collection operators

A Heuristic Scheduling Algorithm for Minimizing Makespan and Idle Time in a Nagare Cell

Directory of Open Access Journals (Sweden)

M. Muthukumaran

2012-01-01

Full Text Available Adopting a focused factory is a powerful approach for today manufacturing enterprise. This paper introduces the basic manufacturing concept for a struggling manufacturer with limited conventional resources, providing an alternative solution to cell scheduling by implementing the technique of Nagare cell. Nagare cell is a Japanese concept with more objectives than cellular manufacturing system. It is a combination of manual and semiautomatic machine layout as cells, which gives maximum output flexibility for all kind of low-to-medium- and medium-to-high- volume productions. The solution adopted is to create a dedicated group of conventional machines, all but one of which are already available on the shop floor. This paper focuses on the development of heuristic scheduling algorithm in step-by-step method. The algorithm states that the summation of processing time of all products on each machine is calculated first and then the sum of processing time is sorted by the shortest processing time rule to get the assignment schedule. Based on the assignment schedule Nagare cell layout is arranged for processing the product. In addition, this algorithm provides steps to determine the product ready time, machine idle time, and product idle time. And also the Gantt chart, the experimental analysis, and the comparative results are illustrated with five (1×8 to 5×8 scheduling problems. Finally, the objective of minimizing makespan and idle time with greater customer satisfaction is studied through.

An Improved Genetic Algorithm for Single-Machine Inverse Scheduling Problem

Directory of Open Access Journals (Sweden)

Jianhui Mou

2014-01-01

Full Text Available The goal of the scheduling is to arrange operations on suitable machines with optimal sequence for corresponding objectives. In order to meet market requirements, scheduling systems must own enough flexibility against uncertain events. These events can change production status or processing parameters, even causing the original schedule to no longer be optimal or even to be infeasible. Traditional scheduling strategies, however, cannot cope with these cases. Therefore, a new idea of scheduling called inverse scheduling has been proposed. In this paper, the inverse scheduling with weighted completion time (SMISP is considered in a single-machine shop environment. In this paper, an improved genetic algorithm (IGA with a local searching strategy is proposed. To improve the performance of IGA, efficient encoding scheme, fitness evaluation mechanism, feasible initialization methods, and a local search procedure have been employed in the paper. Because of the local improving method, the proposed IGA can balance its exploration ability and exploitation ability. We adopt 27 instances to verify the effectiveness of the proposed algorithm. The experimental results illustrated that the proposed algorithm can generate satisfactory solutions. This approach also has been applied to solve the scheduling problem in the real Chinese shipyard and can bring some benefits.

Ensemble hydro-meteorological forecasting for early warning of floods and scheduling of hydropower production

Science.gov (United States)

Solvang Johansen, Stian; Steinsland, Ingelin; Engeland, Kolbjørn

2016-04-01

Running hydrological models with precipitation and temperature ensemble forcing to generate ensembles of streamflow is a commonly used method in operational hydrology. Evaluations of streamflow ensembles have however revealed that the ensembles are biased with respect to both mean and spread. Thus postprocessing of the ensembles is needed in order to improve the forecast skill. The aims of this study is (i) to to evaluate how postprocessing of streamflow ensembles works for Norwegian catchments within different hydrological regimes and to (ii) demonstrate how post processed streamflow ensembles are used operationally by a hydropower producer. These aims were achieved by postprocessing forecasted daily discharge for 10 lead-times for 20 catchments in Norway by using EPS forcing from ECMWF applied the semi-distributed HBV-model dividing each catchment into 10 elevation zones. Statkraft Energi uses forecasts from these catchments for scheduling hydropower production. The catchments represent different hydrological regimes. Some catchments have stable winter condition with winter low flow and a major flood event during spring or early summer caused by snow melting. Others has a more mixed snow-rain regime, often with a secondary flood season during autumn, and in the coastal areas, the stream flow is dominated by rain, and the main flood season is autumn and winter. For post processing, a Bayesian model averaging model (BMA) close to (Kleiber et al 2011) is used. The model creates a predictive PDF that is a weighted average of PDFs centered on the individual bias corrected forecasts. The weights are here equal since all ensemble members come from the same model, and thus have the same probability. For modeling streamflow, the gamma distribution is chosen as a predictive PDF. The bias correction parameters and the PDF parameters are estimated using a 30-day sliding window training period. Preliminary results show that the improvement varies between catchments depending

9 CFR 381.37 - Schedule of operations.

Science.gov (United States)

2010-01-01

... Holiday Service; Billing Establishments § 381.37 Schedule of operations. (a) No operations requiring inspection shall be conducted except under the supervision of an Inspection Service employee. All... 381.37 Animals and Animal Products FOOD SAFETY AND INSPECTION SERVICE, DEPARTMENT OF AGRICULTURE...

Direct block scheduling technology: Analysis of Avidity

Directory of Open Access Journals (Sweden)

Felipe Ribeiro Souza

Full Text Available Abstract This study is focused on Direct Block Scheduling testing (Direct Multi-Period Scheduling methodology which schedules mine production considering the correct discount factor of each mining block, resulting in the final pit. Each block is analyzed individually in order to define the best target period. This methodology presents an improvement of the classical methodology derived from Lerchs-Grossmann's initial proposition improved by Whittle. This paper presents the differences between these methodologies, specially focused on the algorithms' avidity. Avidity is classically defined by the voracious search algorithms, whereupon some of the most famous greedy algorithms are Branch and Bound, Brutal Force and Randomized. Strategies based on heuristics can accentuate the voracity of the optimizer system. The applied algorithm use simulated annealing combined with Tabu Search. The most avid algorithm can select the most profitable blocks in early periods, leading to higher present value in the first periods of mine operation. The application of discount factors to blocks on the Lerchs-Grossmann's final pit has an accentuated effect with time, and this effect may make blocks scheduled for the end of the mine life unfeasible, representing a trend to a decrease in reported reserves.

Effective Schedule and Cost Management as a Product Development Lead

Science.gov (United States)

Simmons, Cynthia

2015-01-01

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

A fast-response production-inventory model for deteriorating seasonal products with learning in set-ups

Directory of Open Access Journals (Sweden)

Ibraheem Abdul

2011-10-01

Full Text Available The classical production-inventory model assumes that both demand and set-up costs are constant. However, in real manufacturing environment, managers usually embark on continuous improvement programmes that often lead to more effective use of tools and machineries and consequently reduction in set-up costs. In fact, constant emphasis on reduction of set-up costs is usually cited as one of the factors responsible for the efficiency of Japanese manufacturing methods. On the other hand, the demand for seasonal product is often characterized by a mixture of time-dependent patterns over the entire season. This paper investigates the effect of learning-based reduction in set-up costs on the optimal schedules and costs of a production-inventory system for deteriorating seasonal products. The demand pattern is a general three-phase ramp-type demand function that represents the various phases of demand commonly observed in many seasonal products in the market. A two-parameter Weibull-distribution function is used for the deterioration of items in order to make the model more generalized and realistic. The study further presents two different multi-period production strategies that can ensure a fast-response to customers’ demand and compare them with the usual single period strategy. The Numerical example and sensitivity analysis shows that learning-based reduction in set-up costs leads to higher production frequency and shorter production runs which are vital aspects of the just-in-time (JIT philosophy.

Web Publishing Schedule

Science.gov (United States)

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

Heuristic algorithms for scheduling heat-treatment furnaces of steel ...

Indian Academy of Sciences (India)

1Department of Management Studies, Indian Institute of Science,. Bangalore .... and scheduling, production monitoring and data capture, and management information. Southall ...... Project Report, Department of Management Studies, Indian.

42 CFR 7.4 - Schedule of charges.

Science.gov (United States)

2010-10-01

... REFERENCE BIOLOGICAL STANDARDS AND BIOLOGICAL PREPARATIONS § 7.4 Schedule of charges. The charges imposed in... ingredients. Charges may vary over time and between different biological standards or biological preparations... is available from the Biological Products Branch, Center for Infectious Diseases, Centers for Disease...

76 FR 20518 - Self-Certification and Employee Training of Mail-Order Distributors of Scheduled Listed Chemical...

Science.gov (United States)

2011-04-13

... regulated sellers--i.e., retail stores and mobile retail vendors--of scheduled listed chemical products. To... scheduled listed chemical products at retail. Sales at retail are those sales intended for personal use... available for public inspection online at http://www.regulations.gov and in the Drug Enforcement...

Preventive maintenance optimization for a multi-component system under changing job shop schedule

International Nuclear Information System (INIS)

Zhou Xiaojun; Lu Zhiqiang; Xi Lifeng

2012-01-01

Variability and small lot size is a common feature for many discrete manufacturing processes designed to meet a wide array of customer needs. Because of this, job shop schedule often has to be continuously updated in reaction to changes in production plan. Generally, the aim of preventive maintenance is to ensure production effectiveness and therefore the preventive maintenance models must have the ability to be adaptive to changes in job shop schedule. In this paper, a dynamic opportunistic preventive maintenance model is developed for a multi-component system with considering changes in job shop schedule. Whenever a job is completed, preventive maintenance opportunities arise for all the components in the system. An optimal maintenance practice is dynamically determined by maximizing the short-term cumulative opportunistic maintenance cost savings for the system. The numerical example shows that the scheme obtained by the proposed model can effectively address the preventive maintenance scheduling problem caused by the changes in job shop schedule and is more efficient than the ones based on two other commonly used preventive maintenance models.

Shorter height is related to lower cardiovascular disease risk – A narrative review

Directory of Open Access Journals (Sweden)

Thomas T. Samaras

2013-01-01

Full Text Available Numerous Western studies have shown a negative correlation between height and cardiovascular disease. However, these correlations do not prove causation. This review provides a variety of studies showing short people have little to no cardiovascular disease. When shorter people are compared to taller people, a number of biological mechanisms evolve favoring shorter people, including reduced telomere shortening, lower atrial fibrillation, higher heart pumping efficiency, lower DNA damage, lower risk of blood clots, lower left ventricular hypertrophy and superior blood parameters. The causes of increased heart disease among shorter people in the developed world are related to lower income, excessive weight, poor diet, lifestyle factors, catch-up growth, childhood illness and poor environmental conditions. For short people in developed countries, the data indicate that a plant-based diet, leanness and regular exercise can substantially reduce the risk of cardiovascular disease.

Interfaz entre el plan de producción y el programa de producción en ambientes de ensamble Interface between the production plan and the master production schedule in assembly environments

Directory of Open Access Journals (Sweden)

Marcos Moya Navarro

2012-11-01

Full Text Available En un entorno de producción existe una relación directa entre el mercado y los procesos de manufactura de los bienes. Sin embargo, cuando la producción está inmersa en un ambiente de ensamble, el procedimiento de la planificación y la programación se vuelve complejo, con el riesgo de que la empresa pierda ventaja competitiva en términos de incumplimiento de las fechas de entrega y elevados costos de planificación y control. La programación lineal constituye una herramienta apropiada para construir modelos de programación y control de la producción en entornos de manufactura complejos. El objetivo de este trabajo es mostrar la interfaz entre el plan de producción y el programa de producción en ambientes de ensamble mediante el modelado por programación lineal. Para ello, se seleccionó un entorno que produce tres productos finales cuya estructura de producto está dispuesta en tres niveles con un máximo de ocho componentes. Los datos proporcionados por el plan de producción se desglosaron en diez órdenes, cada una indicando el tipo de producto, la cantidad por producir y su respectiva fecha de entrega. Los resultados obtenidos en el programa de producción establecieron la recepción de pedidos planificados y el programa de componentes totales requeridos en cada periodo de producción, para minimizar los costos totales de emisión de órdenes de producción e inventario.In a production environment there is a direct relationship between the market and the manufacturing process of goods.When production is immersed in an assembly environment, the process of production planning and scheduling becomes complex, and the enterprises have the risk of losing competitive advantages in terms of not meeting delivery dates and production high costs. Linear programming has become an appropriate tool for production planning and scheduling in complex manufacturing environments. The aim of this paper is to show the interface between both the

Athabasca--special report No. 1, we are progressing on schedule

Energy Technology Data Exchange (ETDEWEB)

Moss, A E

1966-09-01

Since April of 1964 when the government of Alberta gave permission for the production of crude oil from the Athabasca Tar Sands, construction of a $240 million oil sands venture has been progressing according to schedule. This plant will be capable of processing 45,000 bbl of crude oil per day and will require the mining of approximately 135,000 tons of material per day. The scheduled completion date for this project is Sept. 1967. This huge project consists of the construction of various plant units and service facilities, preparation of the mine for production, construction of a highway and a multi- million dollar bridge, and the design and construction of a 16-in. pipeline 266 miles in length. A shortage of experienced engineers, supervisors, and skilled tradesmen has been the largest problem. In spite of the many problems encountered, approximately 50% of the construction has now been completed and the plant will be completed on schedule.

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

Science.gov (United States)

Majerowicz, Walt; Shinn, Stephen A.

2016-01-01

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

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

Science.gov (United States)

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.

Effects of deficit drip-irrigation scheduling regimes with saline water on pepper yield, water productivity and soil salinity under arid conditions of Tunisia

Directory of Open Access Journals (Sweden)

Kamel Nagaz

2012-12-01

Full Text Available A two-year study was carried out in order to assess the effects of different irrigation scheduling regimes with saline water on soil salinity, yield and water productivity of pepper under actual commercial-farming conditions in the arid region of Tunisia. Pepper was grown on a sandy soil and drip-irrigated with water having an ECi of 3.6 dS/m. Irrigation treatments consisted in water replacements of accumulated ETc at levels of 100% (FI, full irrigation, 80% (DI-80, 60% (DI-60, when the readily available water in the control treatment (FI is depleted, deficit irrigation during ripening stage (FI-MDI60 and farmer method corresponding to irrigation practices implemented by the local farmers (FM. Results on pepper yield and soil salinity are globally consistent between the two-year experiments and shows significant difference between irrigation regimes. Higher soil salinity was maintained over the two seasons, 2008 and 2009, with DI-60 and FM treatments than FI. FI-MDI60 and DI-80 treatments resulted also in low ECe values. Highest yields for both years were obtained under FI (22.3 and 24.4 t/ha although we didn’t find significant differences with the regulated deficit irrigation treatment (FI-DI60. However, the DI-80 and DI-60 treatments caused significant reductions in pepper yields through a reduction in fruits number/m² and average fruit weight in comparison with FI treatment. The FM increased soil salinity and caused significant reductions in yield with 14 to 43%, 12 to 39% more irrigation water use than FI, FI-MDI60 and DI-80 treatments, respectively, in 2008 and 2009. Yields for all irrigation treatments were higher in the second year compared to the first year. Water productivity (WP values reflected this difference and varied between 2.31 and 5.49 kg/m3. The WP was found to vary significantly among treatments, where the highest and the lowest values were observed for DI-60 treatment and FM, respectively. FI treatment provides

FOREST HARVEST SCHEDULING PLAN INTEGRATED TO THE ROAD NETWORK

Directory of Open Access Journals (Sweden)

Pedro Henrique Belavenutti Martins da Silva

2016-03-01

Full Text Available In industrial forest plantations, the spatial distribution of management units for harvest scheduling influences the timber production cost and the non-renewable resources consumption, due to issues related to transport logistic. In this context, this research aimed to formulate Integer Linear Programming (ILP by means of the application of Floyd-Warshall network optimization algorithm to generate timber production routes, minimizing the production costs resulting from harvest activities and forest road maintenance. Then, scenarios were simulated considering different minimal harvest ages for Pinus spp. and Eucalyptus spp. stands. The planning horizon was five years with annual periodicity. The study area was 23,330 hectares of forests, located in Paraná state (southern Brazil. We compared the simulated scenarios according to the following parameter indicators: harvest income, building road network and the production unit cost. The decreasing of the minimal harvest age reduces the mean production of management units scheduled to be harvested, in other hand, it requires fewer roads to be built, and consequently increases the production unit cost. The solutions obtained by using ILP models presented an optimality gap lower than 0.1%.

Value Stream Mapping for Evaluation of Load Scheduling Possibilities in a District Heating Plant

Directory of Open Access Journals (Sweden)

Raivo Melsas

2016-09-01

Full Text Available The aim of this paper is to provide a solution for load scheduling by implementing value stream mapping, which is a straightforward enough for production management. Decision makers in the industry should have a clear understanding about positive effect from load scheduling and its effect to production outcome and process availability. Value stream mapping is a well-known process optimization tool from lean production philosophy. The aim of value stream mapping is to shorten the lead time of industrial processes and to reduce the intermediate stock amounts. By complementing value stream map with process energy intensity and energy stored in intermediate stocks, we can promote load scheduling possibilities. Our methodology provides a tool that is understandable and traceable for industry-minded decision makers. Finally, we present a real life test example for the new methodology, which is based on the production process of a district heating plant.

Environmental surveillance master sampling schedule

International Nuclear Information System (INIS)

Bisping, L.E.

1995-02-01

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

Environmental surveillance master sampling schedule

Energy Technology Data Exchange (ETDEWEB)

Bisping, L.E.

1995-02-01

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

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

Science.gov (United States)

Cropper, A. E.; Wang, Z.

1995-08-01

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

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

Science.gov (United States)

2010-07-01

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

Optimal methodology for a machining process scheduling in spot electricity markets

International Nuclear Information System (INIS)

Yusta, J.M.; Torres, F.; Khodr, H.M.

2010-01-01

Electricity spot markets have introduced hourly variations in the price of electricity. These variations allow the increase of the energy efficiency by the appropriate scheduling and adaptation of the industrial production to the hourly cost of electricity in order to obtain the maximum profit for the industry. In this article a mathematical optimization model simulates costs and the electricity demand of a machining process. The resultant problem is solved using the generalized reduced gradient approach, to find the optimum production schedule that maximizes the industry profit considering the hourly variations of the price of electricity in the spot market. Different price scenarios are studied to analyze the impact of the spot market prices for electricity on the optimal scheduling of the machining process and on the industry profit. The convenience of the application of the proposed model is shown especially in cases of very high electricity prices.

Scheduling of resource-constrained projects

CERN Document Server

Klein, Robert

2000-01-01

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

Parallel Machine Scheduling with Batch Delivery to Two Customers

Directory of Open Access Journals (Sweden)

Xueling Zhong

2015-01-01

Full Text Available In some make-to-order supply chains, the manufacturer needs to process and deliver products for customers at different locations. To coordinate production and distribution operations at the detailed scheduling level, we study a parallel machine scheduling model with batch delivery to two customers by vehicle routing method. In this model, the supply chain consists of a processing facility with m parallel machines and two customers. A set of jobs containing n1 jobs from customer 1 and n2 jobs from customer 2 are first processed in the processing facility and then delivered to the customers directly without intermediate inventory. The problem is to find a joint schedule of production and distribution such that the tradeoff between maximum arrival time of the jobs and total distribution cost is minimized. The distribution cost of a delivery shipment consists of a fixed charge and a variable cost proportional to the total distance of the route taken by the shipment. We provide polynomial time heuristics with worst-case performance analysis for the problem. If m=2 and (n1-b(n2-b<0, we propose a heuristic with worst-case ratio bound of 3/2, where b is the capacity of the delivery shipment. Otherwise, the worst-case ratio bound of the heuristic we propose is 2-2/(m+1.

Escalonamento cooperativo interorganizacional Cooperative inter-organizational scheduling

Directory of Open Access Journals (Sweden)

Ricardo J. Rabelo

2000-12-01

Full Text Available Este trabalho tem como objetivo essencial apresentar uma abordagem para uma ágil coordenação e supervisão das ordens de produção da empresa, dando uma nova dimensão à atividade de "escalonamento" (scheduling, não apenas numa perspectiva intra-organizacional, mas também interorganizacional, contemplando toda a cadeia produtiva. Apresenta os fundamentos de um protótipo sendo desenvolvido, baseado nos paradigmas de negociação multiagente e de sistemas de suporte à decisão. Aspectos relacionados com a modelagem e integração da informação requerida nos vários níveis do CIM são abordados. Ao final, uma série de considerações são feitas, quer em relação aos resultados atingidos com o protótipo atual, quer para com as várias dificuldades - e desafios - existentes para a realização de um escalonamento cooperativo interorganizacional.This work aims at presenting an approach for agile scheduling coordination and supervision of distributed production orders, giving rise to a new dimension of the scheduling activity, not only under the intra-organizational perspective, but also the inter-organizational, comprising the whole productive chain. It generally presents a prototype being developed, based on the paradigms of multi-agent negotiation and decision support systems. Aspects related with the information modeling and integration in the several levels of CIM are tackled. At the end, a series of considerations is made, pointing out the results reached with the current prototype, and the several difficulties - and challenges - existent for the accomplishment of cooperative inter-organizational scheduling.

DEVELOPMENT OF A MAINTENANCE SCHEDULING MODEL FOR ...

African Journals Online (AJOL)

... of minor maintenance, for each machine within this time span. In order to minimize the total cost of repairs and production. A numerical application of this development model in a case study is presented. Key words: Maintenance, modeling, scheduling, optimization. [Global Jnl Engineering Res. Vol.1(2) 2002: 107-118] ...

Research on a scheduling mechanism in a complex system based on TOC

International Nuclear Information System (INIS)

Wen, Zhang; Ya-Ming, Zhang; Jinbo, Chen; Kaijun, Leng

2016-01-01

Under the condition where there is no seasonal demand fluctuation, short life cycle product supply chain should confront the market environment such as the decreasing of product value, the launch of substitutes and the appearance of competitors’ similar products, and the supply chain will become a very complex system. In this paper, the authors consider a TOC-based scheduling mechanism in this complex supply chain system. under the constant total production cost, it is more important to improve the availability of the wanted product in order to enhance the overall supply chain competitiveness so to obtain more effective output(profit rate) for the supply chain in a long period. Especially we try to apply the SDBR concept into a schedule mechanism in a particular supply chain system, and use numerical analysis to test the efficiency of the proposed method.

A General State-Space Formulation for Online Scheduling

Directory of Open Access Journals (Sweden)

Dhruv Gupta

2017-11-01

Full Text Available We present a generalized state-space model formulation particularly motivated by an online scheduling perspective, which allows modeling (1 task-delays and unit breakdowns; (2 fractional delays and unit downtimes, when using discrete-time grid; (3 variable batch-sizes; (4 robust scheduling through the use of conservative yield estimates and processing times; (5 feedback on task-yield estimates before the task finishes; (6 task termination during its execution; (7 post-production storage of material in unit; and (8 unit capacity degradation and maintenance. Through these proposed generalizations, we enable a natural way to handle routinely encountered disturbances and a rich set of corresponding counter-decisions. Thereby, greatly simplifying and extending the possible application of mathematical programming based online scheduling solutions to diverse application settings. Finally, we demonstrate the effectiveness of this model on a case study from the field of bio-manufacturing.

A Comparison of the DISASTER (Trademark) Scheduling Software with a Simultaneous Scheduling Algorithm for Minimizing Maximum Tardiness in Job Shops

Science.gov (United States)

1993-09-01

goal ( Heizer , Render , and Stair, 1993:94). Integer Prgronmming. Integer programming is a general purpose approach used to optimally solve job shop...Scheduling," Operations Research Journal. 29, No 4: 646-667 (July-August 1981). Heizer , Jay, Barry Render and Ralph M. Stair, Jr. Production and Operations

Constraint-based scheduling applying constraint programming to scheduling problems

CERN Document Server

Baptiste, Philippe; Nuijten, Wim

2001-01-01

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

Scheduling for decommissioning projects

International Nuclear Information System (INIS)

Podmajersky, O.E.

1987-01-01

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

Program reference schedule baseline

International Nuclear Information System (INIS)

1986-07-01

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

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

Science.gov (United States)

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

2001-09-01

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

Constraint-based scheduling

Science.gov (United States)

Zweben, Monte

1993-01-01

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

Perceptions of randomized security schedules.

Science.gov (United States)

Scurich, Nicholas; John, Richard S

2014-04-01

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

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

African Journals Online (AJOL)

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

Environmental surveillance master sampling schedule

International Nuclear Information System (INIS)

Bisping, L.E.

1994-02-01

This document contains the planned 1994 schedules for routine collection of samples for the Surface Environmental Surveillance Project (SESP), Drinking Water Project, and Ground-Water Surveillance Project. Samples are routinely collected for the SESP and analyzed to determine the quality of air, surface water, soil, sediment, wildlife, vegetation, foodstuffs, and farm products at Hanford Site and surrounding communities. The responsibility for monitoring the onsite drinking water falls outside the scope of the SESP. The Hanford Environmental Health Foundation is responsible for monitoring the nonradiological parameters as defined in the National Drinking Water Standards while PNL conducts the radiological monitoring of the onsite drinking water. PNL conducts the drinking water monitoring project concurrent with the SESP to promote efficiency and consistency, utilize the expertise developed over the years, and reduce costs associated with management, procedure development, data management, quality control and reporting. The ground-water sampling schedule identifies ground-water sampling events used by PNL for environmental surveillance of the Hanford Site

Environmental surveillance master sampling schedule

Energy Technology Data Exchange (ETDEWEB)

Bisping, L.E.

1994-02-01

This document contains the planned 1994 schedules for routine collection of samples for the Surface Environmental Surveillance Project (SESP), Drinking Water Project, and Ground-Water Surveillance Project. Samples are routinely collected for the SESP and analyzed to determine the quality of air, surface water, soil, sediment, wildlife, vegetation, foodstuffs, and farm products at Hanford Site and surrounding communities. The responsibility for monitoring the onsite drinking water falls outside the scope of the SESP. The Hanford Environmental Health Foundation is responsible for monitoring the nonradiological parameters as defined in the National Drinking Water Standards while PNL conducts the radiological monitoring of the onsite drinking water. PNL conducts the drinking water monitoring project concurrent with the SESP to promote efficiency and consistency, utilize the expertise developed over the years, and reduce costs associated with management, procedure development, data management, quality control and reporting. The ground-water sampling schedule identifies ground-water sampling events used by PNL for environmental surveillance of the Hanford Site.

YAOPBM-II: extension to higher degrees and to shorter time series

Energy Technology Data Exchange (ETDEWEB)

Korzennik, S G [Harvard-Smithsonian Center for Astrophysics, Cambridge, MA (United States)], E-mail: skorzennik@cfa.harvard.edu

2008-10-15

In 2005, I presented a new fitting methodology (Yet AnOther Peak Bagging Method -YAOPBM), derived for very-long time series (2088-day-long) and applied it to low degree modes, {iota} {<=} 25. That very-long time series was also sub-divided into shorter segments (728-day-long) that were each fitted over the same range of degrees, to estimate changes with solar activity levels. I present here the extension of this method in several 'directions': a) to substantially higher degrees ({iota} {<=} 125); b) to shorter time series (364- and 182-day-long); and c) to additional 728-day-long segments, covering now some 10 years of observations. I discuss issues with the fitting, namely the leakage matrix, and the f- and p1 mode at very low frequencies, and I present some of the characteristics of the observed temporal changes.

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

Science.gov (United States)

2010-01-01

... PRODUCTS INSPECTION AND VOLUNTARY INSPECTION AND CERTIFICATION POULTRY PRODUCTS INSPECTION REGULATIONS... 9 Animals and Animal Products 2 2010-01-01 2010-01-01 false Critical factors and the application of the process schedule. 381.303 Section 381.303 Animals and Animal Products FOOD SAFETY AND...

Relative performance of priority rules for hybrid flow shop scheduling with setup times

Directory of Open Access Journals (Sweden)

Helio Yochihiro Fuchigami

2015-12-01

Full Text Available This paper focuses the hybrid flow shop scheduling problem with explicit and sequence-independent setup times. This production environment is a multistage system with unidirectional flow of jobs, wherein each stage may contain multiple machines available for processing. The optimized measure was the total time to complete the schedule (makespan. The aim was to propose new priority rules to support the schedule and to evaluate their relative performance at the production system considered by the percentage of success, relative deviation, standard deviation of relative deviation, and average CPU time. Computational experiments have indicated that the rules using ascending order of the sum of processing and setup times of the first stage (SPT1 and SPT1_ERD performed better, reaching together more than 56% of success.

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

Science.gov (United States)

Luczynski, Kevin C; Hanley, Gregory P

2014-01-01

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

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

Science.gov (United States)

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

2016-08-01

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

Environmental surveillance master sampling schedule

Energy Technology Data Exchange (ETDEWEB)

Bisping, L E

1992-01-01

Environmental surveillance of the Hanford Site and surrounding areas is conducted by the Pacific Northwest Laboratory (PNL) for the US Department of Energy (DOE). This document contains the planned schedule for routine sample collection for the Surface Environmental Surveillance Project (SESP) and Ground-Water Monitoring Project. Samples for radiological analyses include Air-Particulate Filter, gases and vapor; Water/Columbia River, Onsite Pond, Spring, Irrigation, and Drinking; Foodstuffs/Animal Products including Whole Milk, Poultry and Eggs, and Beef; Foodstuffs/Produce including Leafy Vegetables, Vegetables, and Fruit; Foodstuffs/Farm Products including Wine, Wheat and Alfalfa; Wildlife; Soil; Vegetation; and Sediment. Direct Radiation Measurements include Terrestrial Locations, Columbia River Shoreline Locations, and Onsite Roadway, Railway and Aerial, Radiation Surveys.

Scheduling with Time Lags

NARCIS (Netherlands)

X. Zhang (Xiandong)

2010-01-01

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

Schedule Analytics

Science.gov (United States)

2016-04-30

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

Patients' and clinicians' views on the optimum schedules for self-monitoring of blood pressure: a qualitative focus group and interview study.

Science.gov (United States)

Grant, Sabrina; Hodgkinson, James A; Milner, Siobhan L; Martin, Una; Tompson, Alice; Hobbs, Fd Richard; Mant, Jonathan; McManus, Richard J; Greenfield, Sheila M

2016-11-01

Self-monitoring of blood pressure is common but guidance on how it should be carried out varies and it is currently unclear how such guidance is viewed. To explore patients' and healthcare professionals' (HCPs) views and experiences of the use of different self-monitoring regimens to determine what is acceptable and feasible, and to inform future recommendations. Thirteen focus groups and four HCP interviews were held, with a total of 66 participants (41 patients and 25 HCPs) from primary and secondary care with and without experience of self-monitoring. Standard and shortened self-monitoring protocols were both considered. Focus groups and interviews were recorded, transcribed verbatim, and analysed using the constant comparative method. Patients generally supported structured schedules but with sufficient flexibility to allow adaptation to individual routine. They preferred a shorter (3-day) schedule to longer (7-day) regimens. Although HCPs could describe benefits for patients of using a schedule, they were reluctant to recommend a specific schedule. Concerns surrounded the use of different schedules for diagnosis and subsequent monitoring. Appropriate education was seen as vital by all participants to enable a self-monitoring schedule to be followed at home. There is not a 'one size fits all approach' to developing the optimum protocol from the perspective of users and those implementing it. An approach whereby patients are asked to complete the minimum number of readings required for accurate blood pressure estimation in a flexible manner seems most likely to succeed. Informative advice and guidance should incorporate such flexibility for patients and professionals alike. © British Journal of General Practice 2016.

A Study on the Optimum Bucket Size for Master Scheduling : For the Case of Hierarchically tured Products

OpenAIRE

木内, 正光

2010-01-01

The function of master scheduling is to plan the flow of order from its arrival to its completion. In this study, the problem of bucket size for master scheduling is taken up. The bucket size for master scheduling has much influence on the lead time of the order. However, to date there is no clear method for how to set the optimum bucket size. The purpose of this study is to propose a method to set the optimum bucket size. In this paper, an equation to estimate the optimum bucket size is prop...

Environmental surveillance master sampling schedule

Energy Technology Data Exchange (ETDEWEB)

Bisping, L.E.

1993-01-01

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

Preemptive scheduling with rejection

NARCIS (Netherlands)

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

2003-01-01

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

Preemptive scheduling with rejection

NARCIS (Netherlands)

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

2000-01-01

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

Prioritizing sleep for healthy work schedules

Science.gov (United States)

2012-01-01

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

Prioritizing sleep for healthy work schedules

Directory of Open Access Journals (Sweden)

Takahashi Masaya

2012-03-01

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

Prioritizing sleep for healthy work schedules.

Science.gov (United States)

Takahashi, Masaya

2012-03-13

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

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

NARCIS (Netherlands)

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

2014-01-01

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

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

NARCIS (Netherlands)

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

2011-01-01

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

NRC comprehensive records disposition schedule

International Nuclear Information System (INIS)

1992-03-01

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

Scheduled evening sleep and enhanced lighting improve adaptation to night shift work in older adults.

Science.gov (United States)

Chinoy, Evan D; Harris, Michael P; Kim, Min Ju; Wang, Wei; Duffy, Jeanne F

2016-12-01

We tested whether a sleep and circadian-based treatment shown to improve circadian adaptation to night shifts and attenuate negative effects on alertness, performance and sleep in young adults would also be effective in older adults. We assessed subjective alertness, sustained attention (psychomotor vigilance task, PVT), sleep duration (actigraphy) and circadian timing (salivary dim-light melatonin onset, DLMO) in 18 older adults (57.2±3.8 years; mean±SD) in a simulated shift work protocol. 4 day shifts were followed by 3 night shifts in the laboratory. Participants slept at home and were randomised to either the treatment group (scheduled evening sleep and enhanced lighting during the latter half of night shifts) or control group (ad-lib sleep and typical lighting during night shifts). Compared with day shifts, alertness and sustained attention declined on the first night shift in both groups, and was worse in the latter half of the night shifts. Alertness and attention improved on nights 2 and 3 for the treatment group but remained lower for the control group. Sleep duration in the treatment group remained similar to baseline (6-7 hours) following night shifts, but was shorter (3-5 hours) following night shifts in the control group. Treatment group circadian timing advanced by 169.3±16.1 min (mean±SEM) but did not shift (-9.7±9.9 min) in the control group. The combined treatment of scheduled evening sleep and enhanced lighting increased sleep duration and partially aligned circadian phase with sleep and work timing, resulting in improved night shift alertness and performance. Published by the BMJ Publishing Group Limited. For permission to use (where not already granted under a licence) please go to http://www.bmj.com/company/products-services/rights-and-licensing/.

Hybrid glowworm swarm optimization for task scheduling in the cloud environment

Science.gov (United States)

Zhou, Jing; Dong, Shoubin

2018-06-01

In recent years many heuristic algorithms have been proposed to solve task scheduling problems in the cloud environment owing to their optimization capability. This article proposes a hybrid glowworm swarm optimization (HGSO) based on glowworm swarm optimization (GSO), which uses a technique of evolutionary computation, a strategy of quantum behaviour based on the principle of neighbourhood, offspring production and random walk, to achieve more efficient scheduling with reasonable scheduling costs. The proposed HGSO reduces the redundant computation and the dependence on the initialization of GSO, accelerates the convergence and more easily escapes from local optima. The conducted experiments and statistical analysis showed that in most cases the proposed HGSO algorithm outperformed previous heuristic algorithms to deal with independent tasks.

Economic appraisal of deployment schedules for high-level radioactive waste repositories

International Nuclear Information System (INIS)

Hoai Linh Doan, Phuong; Duquesnoy, T.; Devezeaux de Lavergne, J.G.

2017-01-01

The deep geological repository (DGR) is considered as the definitive management solution for high-level radioactive waste (HLW). Countries defined different DGR implementation schedules, depending on their national context and political choices. We raise the question of the economic grounds of such political decisions by providing an economic analysis of different DGR schedules. We investigate the optimal timing for DGR commissioning based on available Nuclear Energy Agency (NEA) data (2013). Two scenarios are considered: -1) rescheduling the deployment of a DGR with the same initial operational period, and -2) rescheduling the deployment of a DGR with a shorter operational period, i.e. initial closure date. Given the long timescales of such projects, we also take into account the discounting effect. The first finding is that it appears more economically favorable to extend the interim storage than to dispose of the HLW immediately. Countries which chose 'immediate' disposal are willing to accept higher costs to quickly solve the problem. Another interesting result is that there is an optimal solution with respect to the length of DGR operational period and the waste flow for disposal. Based on data provided by the Organisation for Economic Cooperation and Development (OECD)/Nuclear Energy Agency (NEA), we find an optimal operating period of about 15 years with a flow of 2000 tHM/year. (authors)

Economic appraisal of deployment schedules for high-level radioactive waste repositories

Directory of Open Access Journals (Sweden)

Doan Phuong Hoai Linh

2017-01-01

Full Text Available The deep geological repository (DGR is considered as the definitive management solution for high-level waste (HLW. Countries defined different DGR implementation schedules, depending on their national context and political choices. We raise the question of the economic grounds of such political decisions by providing an economic analysis of different DGR schedules. We investigate the optimal timing for DGR commissioning based on available Nuclear Energy Agency (NEA data (2013. Two scenarios are considered: (1 rescheduling the deployment of a DGR with the same initial operational period, and (2 rescheduling the deployment of a DGR with a shorter operational period, i.e. initial closure date. Given the long timescales of such projects, we also take into account the discounting effect. The first finding is that it appears more economically favorable to extend the interim storage than to dispose of the HLW immediately. Countries which chose “immediate” disposal are willing to accept higher costs to quickly solve the problem. Another interesting result is that there is an optimal solution with respect to the length of DGR operational period and the waste flow for disposal. Based on data provided by the Organisation for Economic Cooperation and Development (OECD/Nuclear Energy Agency (NEA, we find an optimal operating period of about 15 years with a flow of 2000 tHM/year.

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

Science.gov (United States)

2010-01-01

... of the process schedule. 318.303 Section 318.303 Animals and Animal Products FOOD SAFETY AND INSPECTION SERVICE, DEPARTMENT OF AGRICULTURE AGENCY ORGANIZATION AND TERMINOLOGY; MANDATORY MEAT AND POULTRY...; REINSPECTION AND PREPARATION OF PRODUCTS Canning and Canned Products § 318.303 Critical factors and the...

NASA Schedule Management Handbook

Science.gov (United States)

2011-01-01

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

Outage scheduling and implementation

International Nuclear Information System (INIS)

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

1986-01-01

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

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

Science.gov (United States)

Wu, Zuobao; Weng, Michael X

2005-04-01

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

The impact of training schedules on the sleep and fatigue of elite athletes.

Science.gov (United States)

Sargent, Charli; Lastella, Michele; Halson, Shona L; Roach, Gregory D

2014-12-01

In any sport, successful performance requires a planned approach to training and recovery. While sleep is recognized as an essential component of this approach, the amount and quality of sleep routinely obtained by elite athletes has not been systematically evaluated. Data were collected from 70 nationally ranked athletes from seven different sports. Athletes wore wrist activity monitors and completed self-report sleep/training diaries for 2 weeks during normal training. The athletes also recorded their fatigue level prior to each training session using a 7-point scale. On average, the athletes spent 08:18 ± 01:12 h in bed, fell asleep at 23:06 ± 01:12 h, woke at 6:48 ± 01:30 h and obtained 06:30 ± 01:24 h of sleep per night. There was a marked difference in the athletes' sleep/wake behaviour on training days and rest days. Linear mixed model analyses revealed that on nights prior to training days, time spent in bed was significantly shorter (p = 0.001), sleep onset and offset times were significantly earlier (p sleep obtained was significantly less (p = 0.001), than on nights prior to rest days. Moreover, there was a significant effect of sleep duration on pre-training fatigue levels (p ≤ 0.01). Specifically, shorter sleep durations were associated with higher levels of pre-training fatigue. Taken together, these findings suggest that the amount of sleep an elite athlete obtains is dictated by their training schedule. In particular, early morning starts reduce sleep duration and increase pre-training fatigue levels. When designing schedules, coaches should be aware of the implications of the timing of training sessions for sleep and fatigue. In cases where early morning starts are unavoidable, countermeasures for minimizing sleep loss - such as strategic napping during the day and correct sleep hygiene practices at night - should be considered.

Project Schedule Simulation

DEFF Research Database (Denmark)

Mizouni, Rabeb; Lazarova-Molnar, Sanja

2015-01-01

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

A modified genetic algorithm for time and cost optimization of an additive manufacturing single-machine scheduling

Directory of Open Access Journals (Sweden)

M. Fera

2018-09-01

Full Text Available Additive Manufacturing (AM is a process of joining materials to make objects from 3D model data, usually layer by layer, as opposed to subtractive manufacturing methodologies. Selective Laser Melting, commercially known as Direct Metal Laser Sintering (DMLS®, is the most diffused additive process in today’s manufacturing industry. Introduction of a DMLS® machine in a production department has remarkable effects not only on industrial design but also on production planning, for example, on machine scheduling. Scheduling for a traditional single machine can employ consolidated models. Scheduling of an AM machine presents new issues because it must consider the capability of producing different geometries, simultaneously. The aim of this paper is to provide a mathematical model for an AM/SLM machine scheduling. The complexity of the model is NP-HARD, so possible solutions must be found by metaheuristic algorithms, e.g., Genetic Algorithms. Genetic Algorithms solve sequential optimization problems by handling vectors; in the present paper, we must modify them to handle a matrix. The effectiveness of the proposed algorithms will be tested on a test case formed by a 30 Part Number production plan with a high variability in complexity, distinct due dates and low production volumes.

Day and night shift schedules are associated with lower sleep quality in Evening-types.

Science.gov (United States)

Martin, Jeanne Sophie; Laberge, Luc; Sasseville, Alexandre; Bérubé, Marilie; Alain, Samuel; Houle, Jérôme; Hébert, Marc

2015-06-01

Eveningness has been suggested as a facilitating factor in adaptation to shift work, with several studies reporting evening chronotypes (E-types) as better sleepers when on night shifts. Conversely, eveningness has been associated with more sleep complaints during day shifts. However, sleep during day shifts has received limited attention in previous studies assessing chronotypes in shift workers. Environmental light exposure has also been reported to differ between chronotypes in day workers. Activity is also known to provide temporal input to the circadian clock. Therefore, the aim of this study was to compare objective sleep, light exposure and activity levels between chronotypes, both during the night and day shifts. Thirty-nine patrol police patrol officers working on a fast rotating shift schedule (mean age ± SD: 28.9 ± 3.2 yrs; 28 males) participated in this study. All subjects completed the Morningness-Eveningness Questionnaire (MEQ). Sleep and activity were monitored with actigraphy (Actiwatch-L; Mini-Mitter/Respironics, Bend, OR) for four consecutive night shifts and four consecutive day shifts (night work schedule: 00:00 h-07:00 h; day work schedule: 07:00 h-15:00 h). Sleep and activity parameters were calculated with Actiware software. MEQ scores ranged from 26 to 56; no subject was categorized as Morning-type. E-types (n = 13) showed significantly lower sleep efficiency, longer snooze time and spent more time awake after sleep onset than Intermediate-types (I-types, n = 26) for both the night and day shifts. E-types also exhibited shorter and more numerous sleep bouts. Furthermore, when napping was taken into account, E-types had shorter total sleep duration than I-types during the day shifts. E-types were more active during the first hours of their night shift when compared to I-types. Also, all participants spent more time active and had higher amount of activity per minute during day shifts when compared to night shifts. No

Scheduling theory, algorithms, and systems

CERN Document Server

Pinedo, Michael L

2016-01-01

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

Flexible Job-Shop Scheduling with Dual-Resource Constraints to Minimize Tardiness Using Genetic Algorithm

Science.gov (United States)

Paksi, A. B. N.; Ma'ruf, A.

2016-02-01

In general, both machines and human resources are needed for processing a job on production floor. However, most classical scheduling problems have ignored the possible constraint caused by availability of workers and have considered only machines as a limited resource. In addition, along with production technology development, routing flexibility appears as a consequence of high product variety and medium demand for each product. Routing flexibility is caused by capability of machines that offers more than one machining process. This paper presents a method to address scheduling problem constrained by both machines and workers, considering routing flexibility. Scheduling in a Dual-Resource Constrained shop is categorized as NP-hard problem that needs long computational time. Meta-heuristic approach, based on Genetic Algorithm, is used due to its practical implementation in industry. Developed Genetic Algorithm uses indirect chromosome representative and procedure to transform chromosome into Gantt chart. Genetic operators, namely selection, elitism, crossover, and mutation are developed to search the best fitness value until steady state condition is achieved. A case study in a manufacturing SME is used to minimize tardiness as objective function. The algorithm has shown 25.6% reduction of tardiness, equal to 43.5 hours.

Gain scheduling using the Youla parameterization

DEFF Research Database (Denmark)

Niemann, Hans Henrik; Stoustrup, Jakob

1999-01-01

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

Effects of Blocked and Random Practice Schedule on Outcomes of Sound Production Treatment for Acquired Apraxia of Speech: Results of a Group Investigation.

Science.gov (United States)

Wambaugh, Julie L; Nessler, Christina; Wright, Sandra; Mauszycki, Shannon C; DeLong, Catharine; Berggren, Kiera; Bailey, Dallin J

2017-06-22

The purpose of this investigation was to compare the effects of schedule of practice (i.e., blocked vs. random) on outcomes of Sound Production Treatment (SPT; Wambaugh, Kalinyak-Fliszar, West, & Doyle, 1998) for speakers with chronic acquired apraxia of speech and aphasia. A combination of group and single-case experimental designs was used. Twenty participants each received SPT administered with randomized stimuli presentation (SPT-R) and SPT applied with blocked stimuli presentation (SPT-B). Treatment effects were examined with respect to accuracy of articulation as measured in treated and untreated experimental words produced during probes. All participants demonstrated improved articulation of treated items with both practice schedules. Effect sizes were calculated to estimate magnitude of change for treated and untreated items by treatment condition. No significant differences were found for SPT-R and SPT-B relative to effect size. Percent change over the highest baseline performance was also calculated to provide a clinically relevant indication of improvement. Change scores associated with SPT-R were significantly higher than those for SPT-B for treated items but not untreated items. SPT can result in improved articulation regardless of schedule of practice. However, SPT-R may result in greater gains for treated items. https://doi.org/10.23641/asha.5116831.

NRC comprehensive records disposition schedule

International Nuclear Information System (INIS)

1982-07-01

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

Using Optimization Models for Scheduling in Enterprise Resource Planning Systems

Directory of Open Access Journals (Sweden)

Frank Herrmann

2016-03-01

Full Text Available Companies often use specially-designed production systems and change them from time to time. They produce small batches in order to satisfy specific demands with the least tardiness. This imposes high demands on high-performance scheduling algorithms which can be rapidly adapted to changes in the production system. As a solution, this paper proposes a generic approach: solutions were obtained using a widely-used commercially-available tool for solving linear optimization models, which is available in an Enterprise Resource Planning System (in the SAP system for example or can be connected to it. In a real-world application of a flow shop with special restrictions this approach is successfully used on a standard personal computer. Thus, the main implication is that optimal scheduling with a commercially-available tool, incorporated in an Enterprise Resource Planning System, may be the best approach.

Erratum to "Scheduling of a two-machine flowshop with availability constraints on the first machine" [International Journal of Production Economics 99 (2006)

OpenAIRE

Rapine , Christophe

2013-01-01

International audience; In Allaoui H., Artiba A., Elmaghraby S.E., Riane F. Scheduling of a two-machine flowshop with availability constraints on the first machine. International Journal of Production Economics 99 (2006) two conditions of optimality for the Johnson sequence are given. We establish in this note that these conditions are false, under the resumable and the non-resumable case. We also point out two incorrect proofs and give evidence that the time complexity of their dynamic appro...

Scheduling algorithms for automatic control systems for technological processes

Science.gov (United States)

Chernigovskiy, A. S.; Tsarev, R. Yu; Kapulin, D. V.

2017-01-01

Wide use of automatic process control systems and the usage of high-performance systems containing a number of computers (processors) give opportunities for creation of high-quality and fast production that increases competitiveness of an enterprise. Exact and fast calculations, control computation, and processing of the big data arrays - all of this requires the high level of productivity and, at the same time, minimum time of data handling and result receiving. In order to reach the best time, it is necessary not only to use computing resources optimally, but also to design and develop the software so that time gain will be maximal. For this purpose task (jobs or operations), scheduling techniques for the multi-machine/multiprocessor systems are applied. Some of basic task scheduling methods for the multi-machine process control systems are considered in this paper, their advantages and disadvantages come to light, and also some usage considerations, in case of the software for automatic process control systems developing, are made.

Prioritizing sleep for healthy work schedules

OpenAIRE

Takahashi Masaya

2012-01-01

Abstract Good sleep is advantageous to the quality of life. Sleep-related benefits are particularly helpful for the working class, since poor or inadequate amounts of sleep degrade work productivity and overall health. This review paper explores the essential role of sleep in healthy work schedules and primarily focuses on the timing of sleep in relation to the work period (that is, before, during and after work). Data from laboratory, field and modeling studies indicate that consistent amoun...

A branch and cut approach to the multiproduct pipeline scheduling problem

Energy Technology Data Exchange (ETDEWEB)

Souza Filho, Erito Marques de; Bahiense, Laura; Ferreira Filho, Virgilio Jose Martins [Universidade Federal do Rio de Janeiro (UFRJ), RJ (Brazil)

2009-07-01

Pipelines are known as the most reliable and economical mode of transportation for petroleum and its derivatives, especially when large amounts of products have to be pumped for large distances. We address the short-term schedule of a pipeline system comprising the distribution of several petroleum derivatives from a single oil refinery to several depots, connected to local consumer markets, through a single multi-product pipeline. The major difficulties faced in these operations are related to the satisfaction of product demands by the various consumer markets, and operational constraints such as the maximum sizes of contiguous pumping packs, and the immiscible products. Several researchers have developed models and techniques for this short-term pipeline scheduling problem. Two different methodologies have been proposed in the literature: heuristic search techniques and exact methods. In this paper, we use a branch-and cut algorithm, performed in Xpress-MP{sup T}M, and compare the solutions obtained with that ones obtained before using the Variable Neighborhood Search metaheuristic. The computational results showed a significant improvement of performance in relation to previous algorithm. (author)

A novel particle swarm optimization algorithm for permutation flow-shop scheduling to minimize makespan

International Nuclear Information System (INIS)

Lian Zhigang; Gu Xingsheng; Jiao Bin

2008-01-01

It is well known that the flow-shop scheduling problem (FSSP) is a branch of production scheduling and is NP-hard. Now, many different approaches have been applied for permutation flow-shop scheduling to minimize makespan, but current algorithms even for moderate size problems cannot be solved to guarantee optimality. Some literatures searching PSO for continuous optimization problems are reported, but papers searching PSO for discrete scheduling problems are few. In this paper, according to the discrete characteristic of FSSP, a novel particle swarm optimization (NPSO) algorithm is presented and successfully applied to permutation flow-shop scheduling to minimize makespan. Computation experiments of seven representative instances (Taillard) based on practical data were made, and comparing the NPSO with standard GA, we obtain that the NPSO is clearly more efficacious than standard GA for FSSP to minimize makespan

Variable demand and productivity in diagnostic medicine: the customer experience with the scheduling of examinations

Directory of Open Access Journals (Sweden)

Leandro Ortigoza Martins

2016-04-01

Full Text Available From the perspective of marketing, diagnostic medicine services are perishable and demand is variable — characteristics that difficult the maximization of results. Service providers offer the exams through time scheduling system without, however, overcome the inefficiency caused by the no show customers. The objective of this research was to investigate the level of satisfaction of consumers of diagnostic medicine with the schedule, the acceptance of a new model without an appointment time and analyze three secondary dimensions common to the two models (no show, seasonality and timeout in customer satisfaction. This is a quantitative research with exploratory-descriptive design performed with 2,545 clients from a privately held diagnostic medicine in 2013. The results of the secondary dimensions indicated that customers tend to frequent establishments as the current seasonal and are sensitive to wait. As for the main dimensions (scheduling and demand free, there are different levels of acceptance, indicating that the two systems are complementary and not exclusive and therefore, the feasibility of adopting a hybrid model of operation, with the use of two templates.

Evaluation of the 12-hour shift schedule at the Fast Flux Test Facility

International Nuclear Information System (INIS)

Lewis, P.M.; Swaim, D.J.; Rosa, R.R.; Colligan, M.J.; Booth, R.J.; Swint, M.J.

1986-09-01

The objective of this report are to evaluate the effect of the change to the 12-hour/day schedule on operational performance and safety of FFTF; to evaluate the degree to which the change to the 12-hour/day schedule has met its objectives; and to gather information that may be useful to FFTF management and the US Department of Energy (DOE) in evaluating 8- and 12-hour shift schedules at other facilities. The principal conclusion of this report is that the 12-hour/day shift schedule is a reasonable alternative to an 8-hour/day schedule at FFTF. As a result of the scedule change, it seems clear that plant performance improved in two ways. The operator error rate in keeping the Technical Specification Compliance Logs was already very low on the 8-hour shift. On the 12-hour shift, the rate was even lower. Also, the operator interface with craft personnel resulted in an increase in the productivity of the craft personnel

Nonlinear Price Schedules and Tied Products.

OpenAIRE

Ormiston, Michael B; Phillips, Owen R

1988-01-01

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

Designing a prototype of the ITER pulse scheduling system

International Nuclear Information System (INIS)

Yamamoto, T.; Yonekawa, I.; Ohta, K.; Hosoyama, H.; Hashimoto, Y.; Wallander, A.; Winter, A.; Sugie, T.; Kusama, Y.; Kawano, Y.; Yoshino, R.

2012-01-01

Highlights: ► We designed a prototype of the ITER pulse scheduling system. ► Structure of ITER pulse schedules was designed. ► Validation and automatic value assignment functions were adopted. ► A prototype will be implemented in 2011. - Abstract: A prototype of the ITER pulse scheduling system that prepares and manages parameters for ITER plasma operations has been designed. Based on the analyzed requirements on the system, structure of the parameters and necessary functions were determined. Segment and module structures were tuned to the ITER requirements. Three types of validations assure sanity of the parameters. The design limits check and the operation window check verify whether the values of the parameters do not exceed the limits. The consistency check calculates dependency among parameters in accordance with logics described in a scripting language. The ITER pulse scheduling system provides interface with a physics model and simulator. Some abstract physics parameters are converted to engineering parameters with the physics simulation. The results of simulation such as plasma characteristics of specified parameters are also shown to the researchers. The tool to specify the parameters is data-driven. Therefore, it is flexible for changes of number of the parameters. A prototype is being implemented in 2011. Using the prototype, this design will be verified and refined. The evaluation of the prototype will be a basis of the final production of the ITER pulse scheduling system.

A Procedure for scheduling and setting processing priority of MC requests

CERN Document Server

Balcar, Stepan

2013-01-01

My project contains designing and programming a base of an open system, which should help with the scheduling Monte Carlo production requests needed by the CMS physicists for data analysis within the CMS collaboration. A primary requirement was to create web interface that would be portable and independent of the control logic of the system. Another point of the project was to make a scheduler for the Monte Carlo production planning and to design and program interfaces between the various logical blocks of the system. Introduction Many research groups in CERN which specialize in different areas of particle physics works with CMS. They are mostly scientists working at universities or research institutes in their countries. Their research consists in constructing models of elementary particles and subsequent experimental verification of the behavior of these models. All these groups of people create MC production requests which are to be executed using computing resources located at CERN and other institutes. T...

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

Science.gov (United States)

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

2008-01-01

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

Approximating Preemptive Stochastic Scheduling

OpenAIRE

Megow Nicole; Vredeveld Tjark

2009-01-01

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

15 CFR 714.1 - Annual declaration requirements for plant sites that produce a Schedule 3 chemical in excess of...

Science.gov (United States)

2010-01-01

... plant sites that produce a Schedule 3 chemical in excess of 30 metric tons. 714.1 Section 714.1 Commerce... SCHEDULE 3 CHEMICALS § 714.1 Annual declaration requirements for plant sites that produce a Schedule 3... in the production of a chemical in any units within the same plant through chemical reaction...

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

DEFF Research Database (Denmark)

Hansen, Anders Dohn; Clausen, Jens

2008-01-01

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

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

Science.gov (United States)

2017-10-26

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

Study on Compatibility between Converters and Casting Machines for Daily Steelmaking and Continuous Casting Scheduling

Institute of Scientific and Technical Information of China (English)

MA Feng-cai; ZHANG Qun

2009-01-01

In this paper, daily production scheduling is studied based on the Third Steelmaking Plant of Wuhan Iron and steel corporation (WISCO). To make sure the daily production plan is feasible, method of casting gToup is established, and the compatibility between two converters and three continuous casting devices in the Third Steelmaking Plant of WISCO is analyzed. The process flow chart of daily production scheduling is given in this paper. Then, algorithms and procedures for the simulation of daily production plan is developed. Using the actual data from the Third Steelmaking Plant, the feasible daily steelmaking plan and cast plan are given. The plan contains 7 groups of cast plan, figured out 54 converters, and a- bout 13,500 tons steel.

Schedule-Aware Workflow Management Systems

Science.gov (United States)

Mans, Ronny S.; Russell, Nick C.; van der Aalst, Wil M. P.; Moleman, Arnold J.; Bakker, Piet J. M.

Contemporary workflow management systems offer work-items to users through specific work-lists. Users select the work-items they will perform without having a specific schedule in mind. However, in many environments work needs to be scheduled and performed at particular times. For example, in hospitals many work-items are linked to appointments, e.g., a doctor cannot perform surgery without reserving an operating theater and making sure that the patient is present. One of the problems when applying workflow technology in such domains is the lack of calendar-based scheduling support. In this paper, we present an approach that supports the seamless integration of unscheduled (flow) and scheduled (schedule) tasks. Using CPN Tools we have developed a specification and simulation model for schedule-aware workflow management systems. Based on this a system has been realized that uses YAWL, Microsoft Exchange Server 2007, Outlook, and a dedicated scheduling service. The approach is illustrated using a real-life case study at the AMC hospital in the Netherlands. In addition, we elaborate on the experiences obtained when developing and implementing a system of this scale using formal techniques.

Revisiting Symbiotic Job Scheduling

OpenAIRE

Eyerman , Stijn; Michaud , Pierre; Rogiest , Wouter

2015-01-01

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

Implications of shorter cells in PEP

International Nuclear Information System (INIS)

Wiedemann, H.

1975-01-01

Further studies on the beam-stay-clear requirements in PEP led to the conclusion that the vertical aperture needed to be enlarged. There are two main reasons for that: Observations at SPEAR indicate that the aperture should be large enough for a fully coupled beam. Full coupling of the horizontal and vertical betatron oscillations occurs not only occasionally when the energy, tune or betatron function at the interaction point is changed but also due to the beam/endash/beam effect of two strong colliding beams. The second reason for an increased aperture requirement is the nonlinear perturbation of the particle trajectories by the sextupoles. This perturbation increases a fully coupled beam by another 50% to 80%. Both effects together with a +-5 mm allowance for closed orbit perturbation result in a vertical beam-stay-clear in the bending magnets of +-4.8 to +-5.6 cm, compared to the present +-2.0 cm. This beam-stay-clear, together with additional space for vacuum chamber, etc., leads to very costly bending magnets. In this note, a shorter cell length is proposed which would reduce considerably the vertical beam-stay-clear requirements in the bending magnets. 7 figs

Self-scheduling with Microsoft Excel.

Science.gov (United States)

Irvin, S A; Brown, H N

1999-01-01

Excessive time was being spent by the emergency department (ED) staff, head nurse, and unit secretary on a complex 6-week manual self-scheduling system. This issue, plus inevitable errors and staff dissatisfaction, resulted in a manager-lead initiative to automate elements of the scheduling process using Microsoft Excel. The implementation of this initiative included: common coding of all 8-hour and 12-hour shifts, with each 4-hour period represented by a cell; the creation of a 6-week master schedule using the "count-if" function of Excel based on current staffing guidelines; staff time-off requests then entered by the department secretary; the head nurse, with staff input, then fine-tuned the schedule to provide even unit coverage. Outcomes of these changes included an increase in staff satisfaction, time saved by the head nurse, and staff work time saved because there was less arguing about the schedule. Ultimately, the automated self-scheduling method was expanded to the entire 700-bed hospital.

Washington's marine oil spill compensation schedule - simplified resource damage assessment

International Nuclear Information System (INIS)

Geselbracht, L.; Logan, R.

1993-01-01

The Washington State Preassessment Screening and Oil Spill Compensation Schedule Rule (Chapter 173-183 Washington Administrative Code), which simplifies natural resource damage assessment for many oil spill cases, became effective in May 1992. The approach described in the rule incorporates a number of preconstructed rankings that rate environmental sensitivity and the propensity of spilled oil to cause environmental harm. The rule also provides guidance regarding how damages calculated under the schedule should be reduced to take into account actions taken by the responsible party that reduce environmental injury. To apply the compensation schedule to marine estuarine spills, the resource trustees need only collect a limited amount of information such as type of product spilled, number of gallons spilled, compensation schedule subregions the spill entered, season of greatest spill impact, percent coverage of habitats affected by the spill, and actions taken by the responsible party. The result of adding a simplified tool to the existing assortment of damage assessment approaches is that resource trustees will now be able to assess damages for most oil spill cases and shift more effort than was possible in the past to resource restoration

Integrated Harvest and Distribution Scheduling with Time Windows of Perishable Agri-Products in One-Belt and One-Road Context

Directory of Open Access Journals (Sweden)

Yiping Jiang

2018-05-01

Full Text Available The unique characteristics of perishable agri-products are a short lifespan and rapid quality deterioration. This establishes the need to significantly reduce the time from harvest to distribution. These features require reducing the processing time from harvest to distribution to being as short as possible. In this study, we focus on an integrated perishable agri-products scheduling problem that combines harvest and distribution simultaneously, with the purpose of reducing processing time and quality decay. We propose this problem as a mixed integer nonlinear programming model (MINLP to optimize the harvest time and the vehicle routing to consumers, and this MINIP is formulated as a vehicle routing problem with time windows (VRPTW. We introduce a big M method to transform the nonlinear model into a linear model, then apply CPLEX to solve the transformed model. Numerical experiments and sensitive analysis are conducted to verify the efficiency of the proposed model and to provide managerial insights.

Comparison of Multiobjective Evolutionary Algorithms for Operations Scheduling under Machine Availability Constraints

Directory of Open Access Journals (Sweden)

M. Frutos

2013-01-01

Full Text Available Many of the problems that arise in production systems can be handled with multiobjective techniques. One of those problems is that of scheduling operations subject to constraints on the availability of machines and buffer capacity. In this paper we analyze different Evolutionary multiobjective Algorithms (MOEAs for this kind of problems. We consider an experimental framework in which we schedule production operations for four real world Job-Shop contexts using three algorithms, NSGAII, SPEA2, and IBEA. Using two performance indexes, Hypervolume and R2, we found that SPEA2 and IBEA are the most efficient for the tasks at hand. On the other hand IBEA seems to be a better choice of tool since it yields more solutions in the approximate Pareto frontier.

Scheduling delay in suspected cases of oral cancer Atraso de agendamento em casos suspeitos de câncer bucal

Directory of Open Access Journals (Sweden)

Luciana Meneses Souza

2011-12-01

Full Text Available The objective of the study was to evaluate scheduling delay of dental exams in the city of São Paulo of patients suspected of having oral cancer. A cross-sectional study was performed in which telephone conversations simulated clinical situations that represented two types of patients: one presenting symptoms suggestive of oral cancer (CA, and another one suggesting the need for prostheses (PR. The scheduling delay was evaluated by the days until an appointment for care; and among public offices, by type of schedule (emergency or routine. Negative binomial regression was used (95% statistical significance. Five hundred and seventy-five public and private dental offices participated in the study. The mean scheduling delay for the CA group was 2.88 days, and for the PR group, 4.34 days (p = 0.01. The mean scheduling delay was shorter in private dental offices (2.59 days than in offices that accepted health insurance (2.74 days (p = 0.01; the delay was shorter when performed by the dentist rather than by the dental assistant, 2.45 versus 4.21 days (p = 0.01. In public services, 69% of patients in the cancer group were sent to the emergency service. Dental services were accessible for scheduling clinical examinations among patients suspected of having oral cancer.O objetivo do estudo foi avaliar o atraso de agendamento de pacientes com suspeita de câncer bucal aos exames odontológicos na cidade de São Paulo. Realizou-se estudo transversal, em que conversações telefônicas simularam situações clínicas, representando dois tipos de pacientes-padrão: um com sintomas sugestivos de câncer bucal e outro com necessidade de prótese. O atraso do agendamento foi avaliado pelo tempo de agendamento para a consulta e, no caso de estabelecimentos públicos, pelo tipo de agendamento (rotina ou urgência. Utilizou-se regressão binomial negativa (95% de nível de significância. Participaram do estudo 575 estabelecimentos públicos e privados. O tempo m

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

NARCIS (Netherlands)

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

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

Immunization Schedules for Adults

Science.gov (United States)

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

Instant Childhood Immunization Schedule

Science.gov (United States)

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

Phase II study of a 3-day schedule with topotecan and cisplatin in patients with previously untreated small cell lung cancer and extensive disease

DEFF Research Database (Denmark)

Sorensen, M.; Lassen, Ulrik Niels; Jensen, Peter Buhl

2008-01-01

INTRODUCTION: Treatment with a topoisomerase I inhibitor in combination with a platinum results in superior or equal survival compared with etoposide-based treatment in extensive disease small cell lung cancer (SCLC). Five-day topotecan is inconvenient and therefore shorter schedules of topotecan...... and cisplatin are needed. The aim of this phase II study was to establish the response rate and response duration in chemo-naive patients with SCLC receiving a 3-day topotecan and cisplatin schedule. METHODS: Simons optimal two-stage design was used. Patients with previously untreated extensive disease SCLC...... age was 59 (range 44-74), 79% had performance status 0 or 1. Thirty-one patients completed all six cycles. Grade 3/4 anemia, neutrocytopenia, and thrombocytopenia were recorded in 9.5%, 66.7%, and 21.4% of patients, respectively. Fourteen percent of patients experienced neutropenic fever. No episodes...

Nontraditional work schedules for pharmacists.

Science.gov (United States)

Mahaney, Lynnae; Sanborn, Michael; Alexander, Emily

2008-11-15

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

BIM-BASED SCHEDULING OF CONSTRUCTION

DEFF Research Database (Denmark)

Andersson, Niclas; Büchmann-Slorup, Rolf

2010-01-01

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

Optimal hydro scheduling and offering strategies considering price uncertainty and risk management

International Nuclear Information System (INIS)

Catalão, J.P.S.; Pousinho, H.M.I.; Contreras, J.

2012-01-01

Hydro energy represents a priority in the energy policy of Portugal, with the aim of decreasing the dependence on fossil fuels. In this context, optimal hydro scheduling acquires added significance in moving towards a sustainable environment. A mixed-integer nonlinear programming approach is considered to enable optimal hydro scheduling for the short-term time horizon, including the effect of head on power production, start-up costs related to the units, multiple regions of operation, and constraints on discharge variation. As new contributions to the field, market uncertainty is introduced in the model via price scenarios and risk management is included using Conditional Value-at-Risk to limit profit volatility. Moreover, plant scheduling and pool offering by the hydro power producer are simultaneously considered to solve a realistic cascaded hydro system. -- Highlights: ► A mixed-integer nonlinear programming approach is considered for optimal hydro scheduling. ► Market uncertainty is introduced in the model via price scenarios. ► Risk management is included using conditional value-at-risk. ► Plant scheduling and pool offering by the hydro power producer are simultaneously considered. ► A realistic cascaded hydro system is solved.

A shorter and more specific oral sensitization-based experimental model of food allergy in mice.

Science.gov (United States)

Bailón, Elvira; Cueto-Sola, Margarita; Utrilla, Pilar; Rodríguez-Ruiz, Judith; Garrido-Mesa, Natividad; Zarzuelo, Antonio; Xaus, Jordi; Gálvez, Julio; Comalada, Mònica

2012-07-31

Cow's milk protein allergy (CMPA) is one of the most prevalent human food-borne allergies, particularly in children. Experimental animal models have become critical tools with which to perform research on new therapeutic approaches and on the molecular mechanisms involved. However, oral food allergen sensitization in mice requires several weeks and is usually associated with unspecific immune responses. To overcome these inconveniences, we have developed a new food allergy model that takes only two weeks while retaining the main characters of allergic response to food antigens. The new model is characterized by oral sensitization of weaned Balb/c mice with 5 doses of purified cow's milk protein (CMP) plus cholera toxin (CT) for only two weeks and posterior challenge with an intraperitoneal administration of the allergen at the end of the sensitization period. In parallel, we studied a conventional protocol that lasts for seven weeks, and also the non-specific effects exerted by CT in both protocols. The shorter protocol achieves a similar clinical score as the original food allergy model without macroscopically affecting gut morphology or physiology. Moreover, the shorter protocol caused an increased IL-4 production and a more selective antigen-specific IgG1 response. Finally, the extended CT administration during the sensitization period of the conventional protocol is responsible for the exacerbated immune response observed in that model. Therefore, the new model presented here allows a reduction not only in experimental time but also in the number of animals required per experiment while maintaining the features of conventional allergy models. We propose that the new protocol reported will contribute to advancing allergy research. Copyright © 2012 Elsevier B.V. All rights reserved.

MULTICRITERIA HYBRID FLOW SHOP SCHEDULING PROBLEM: LITERATURE REVIEW, ANALYSIS, AND FUTURE RESEARCH

Directory of Open Access Journals (Sweden)

Marcia de Fatima Morais

2014-12-01

Full Text Available This research focuses on the Hybrid Flow Shop production scheduling problem, which is one of the most difficult problems to solve. The literature points to several studies that focus the Hybrid Flow Shop scheduling problem with monocriteria functions. Despite of the fact that, many real world problems involve several objective functions, they can often compete and conflict, leading researchers to concentrate direct their efforts on the development of methods that take consider this variant into consideration. The goal of the study is to review and analyze the methods in order to solve the Hybrid Flow Shop production scheduling problem with multicriteria functions in the literature. The analyses were performed using several papers that have been published over the years, also the parallel machines types, the approach used to develop solution methods, the type of method develop, the objective function, the performance criterion adopted, and the additional constraints considered. The results of the reviewing and analysis of 46 papers showed opportunities for future research on this topic, including the following: (i use uniform and dedicated parallel machines, (ii use exact and metaheuristics approaches, (iv develop lower and uppers bounds, relations of dominance and different search strategies to improve the computational time of the exact methods,  (v develop  other types of metaheuristic, (vi work with anticipatory setups, and (vii add constraints faced by the production systems itself.

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

Science.gov (United States)

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

2012-01-01

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

One long chain among shorter chains : the Flory approach revisited

OpenAIRE

Raphaël , E.; Fredrickson , G.; Pincus , P.

1992-01-01

We consider the mean square end-to-end distance of a long chain immersed in a monodisperse, concentrated solution of shorter, chemically identical chains. In contrast with the earlier work of Flory, no simplifying assumption on the wave vector dependence of the effective potential between segments is made. In order to obtain a closed form expression for the dimension of the long chain, we first derive a general expression for the mean square end-to-end distance of a flexible chain with arbitr...

Network scheduling at Belene NPP construction site

International Nuclear Information System (INIS)

Matveev, A.

2010-01-01

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

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

NARCIS (Netherlands)

Gracia, P.; Kalmijn, M.

2016-01-01

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

BR-SIPP: PETROBRAS Integrated Scheduling System; BR-SIPP: Sistema Integrado de Progamacao de Producao da PETROBRAS

Energy Technology Data Exchange (ETDEWEB)

Pereira, Cristiane S.; Joly, Marcel; Hassimotto, Marcelo K.; Magalhaes, Marcus Vinicius O. [PETROBRAS S.A., Rio de Janeiro, RJ (Brazil)

2008-07-01

The lack of a computational aided technology to support short-term scheduling activity in the oil and petrochemical sector has been identified as one of the major obstacles to the harmonic integration of production objectives subsequent to the implementation of the advanced control systems and the consolidation of important benefits at the process unit level. Such technology refers to an analytical tool able to capture plant operational information consistent with the scheduling layer demands, modeling the production system economic performance, and providing mechanisms to consider commercial, operation and technological uncertainties. In this context, PETROBRAS has continuously dedicated effort to develop, implement and enhance its own refinery scheduling solution. Nowadays at its second version, the PETROBRAS Integrated Scheduling System (BR-SIPP - INPI grant 00067400) has become the focus of corporate care, given its critical role on the link between planning objectives and plant operations, according to the hierarchical decision strategy currently adopted by PETROBRAS. This paper presents an overview of the tool and illustrates some real-world applications and main realized benefits. (author)

Future aircraft networks and schedules

Science.gov (United States)

Shu, Yan

2011-07-01

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

Range Scheduling Aid (RSA)

Science.gov (United States)

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

1991-01-01

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

Immunization Schedules for Infants and Children

Science.gov (United States)

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

Robust and Flexible Scheduling with Evolutionary Computation

DEFF Research Database (Denmark)

Jensen, Mikkel T.

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

A basic period approach to the economic lot scheduling problem with shelf life considerations

NARCIS (Netherlands)

Soman, C.A.; van Donk, D.P.; Gaalman, G.J.C.

2004-01-01

Almost all the research on the economic lot scheduling problem (ELSP) considering limited shelf life of products has assumed a common cycle approach and an unrealistic assumption of possibility of deliberately reducing the production rate. In many cases, like in food processing industry where

Irrigation Scheduling for Green Bell Peppers Using Capacitance Soil Moisture Sensors

NARCIS (Netherlands)

Zotarelli, L.; Dukes, M.D.; Scholberg, J.M.S.; Femminella, K.; Munoz-Carpena, R.

2011-01-01

Vegetable production areas are intensively managed with high inputs of fertilizer and irrigation. The objectives of this study were to evaluate the interaction between N-fertilizer rates and irrigation scheduling using soil moisture sensor irrigation controllers (SMS) on yield, irrigation water use

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

International Nuclear Information System (INIS)

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

1993-07-01

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

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

Energy Technology Data Exchange (ETDEWEB)

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

1993-07-01

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

HURON (HUman and Robotic Optimization Network) Multi-Agent Temporal Activity Planner/Scheduler

Science.gov (United States)

Hua, Hook; Mrozinski, Joseph J.; Elfes, Alberto; Adumitroaie, Virgil; Shelton, Kacie E.; Smith, Jeffrey H.; Lincoln, William P.; Weisbin, Charles R.

2012-01-01

HURON solves the problem of how to optimize a plan and schedule for assigning multiple agents to a temporal sequence of actions (e.g., science tasks). Developed as a generic planning and scheduling tool, HURON has been used to optimize space mission surface operations. The tool has also been used to analyze lunar architectures for a variety of surface operational scenarios in order to maximize return on investment and productivity. These scenarios include numerous science activities performed by a diverse set of agents: humans, teleoperated rovers, and autonomous rovers. Once given a set of agents, activities, resources, resource constraints, temporal constraints, and de pendencies, HURON computes an optimal schedule that meets a specified goal (e.g., maximum productivity or minimum time), subject to the constraints. HURON performs planning and scheduling optimization as a graph search in state-space with forward progression. Each node in the graph contains a state instance. Starting with the initial node, a graph is automatically constructed with new successive nodes of each new state to explore. The optimization uses a set of pre-conditions and post-conditions to create the children states. The Python language was adopted to not only enable more agile development, but to also allow the domain experts to easily define their optimization models. A graphical user interface was also developed to facilitate real-time search information feedback and interaction by the operator in the search optimization process. The HURON package has many potential uses in the fields of Operations Research and Management Science where this technology applies to many commercial domains requiring optimization to reduce costs. For example, optimizing a fleet of transportation truck routes, aircraft flight scheduling, and other route-planning scenarios involving multiple agent task optimization would all benefit by using HURON.

78 FR 21818 - Schedules of Controlled Substances: Placement of Methylone Into Schedule I

Science.gov (United States)

2013-04-12

..., methamphetamine, and MDMA, Schedule I and II substances. These effects included elevated body temperature... of reuptake of monoamines, and in vivo studies (microdialysis, locomotor activity, body temperature.... Yet another commenter claimed that Schedule I placement would ``cripple efforts at learning,'' make it...

Rein: Taming Tail Latency in Key-Value Stores via Multiget Scheduling

KAUST Repository

Reda, Waleed

2017-04-17

We tackle the problem of reducing tail latencies in distributed key-value stores, such as the popular Cassandra database.We focus on workloads of multiget requests, which batch together access to several data elements and parallelize read operations across the data store machines. We first analyze a production trace of a real system and quantify the skew due to multiget sizes, key popularity, and other factors. We then proceed to identify opportunities for reduction of tail latencies by recognizing the composition of aggregate requests and by carefully scheduling bottleneck operations that can otherwise create excessive queues. We design and implement a system called Rein, which reduces latency via inter-multiget scheduling using low overhead techniques. We extensively evaluate Rein via experiments in Amazon Web Services (AWS) and simulations. Our scheduling algorithms reduce the median, 95, and 99 percentile latencies by factors of 1.5, 1.5, and 1.9, respectively.

Physical activity during video capsule endoscopy correlates with shorter bowel transit time.

Science.gov (United States)

Stanich, Peter P; Peck, Joshua; Murphy, Christopher; Porter, Kyle M; Meyer, Marty M

2017-09-01

 Video capsule endoscopy (VCE) is limited by reliance on bowel motility for propulsion, and lack of physical activity has been proposed as a cause of incomplete studies. Our aim was to prospectively investigate the association between physical activity and VCE bowel transit.  Ambulatory outpatients receiving VCE were eligible for the study. A pedometer was attached at the time of VCE ingestion and step count was recorded at the end of the procedure. VCE completion was assessed by logistic regression models, which included step count (500 steps as one unit). Total transit time was analyzed by Cox proportional hazards models. The hazard ratios (HR) with 95 % confidence interval (CI) indicated the "hazard" of completion, such that HRs > 1 indicated a reduced transit time.  A total of 100 patients were included. VCE was completed in 93 patients (93 %). The median step count was 2782 steps. Step count was not significantly associated with VCE completion (odds ratio 1.45, 95 %CI 0.84, 2.49). Pedometer step count was significantly associated with shorter total, gastric, and small-bowel transit times (HR 1.09, 95 %CI 1.03, 1.16; HR 1.05, 95 %CI 1.00, 1.11; HR 1.07, 95 %CI 1.01, 1.14, respectively). Higher body mass index (BMI) was significantly associated with VCE completion (HR 1.87, 95 %CI 1.18, 2.97) and shorter bowel transit times (HR 1.05, 95 %CI 1.02, 1.08).  Increased physical activity during outpatient VCE was associated with shorter bowel transit times but not with study completion. In addition, BMI was a previously unreported clinical characteristic associated with VCE completion and should be included as a variable of interest in future studies.

Combined scheduling of electricity and heat in a microgrid with volatile wind power

DEFF Research Database (Denmark)

Xu, Lizhong; Yang, Guang Ya; Xu, Zhao

2011-01-01

An optimization model is developed for scheduling electricity and heat production in a microgrid under a day-ahead market environment considering the operation constraints and the volatility of wind power generation. The model optimizes the total operation costs from energy and heating consumption...... into a mixed-integer programming (MIP) problem. Numerical simulations present the efficacy of the proposed model for day-ahead scheduling of a microgrid with wind penetration under the deregulated environment. © 2011 State Grid Electrtic Resarch Institute Press....

Multi-objective group scheduling optimization integrated with preventive maintenance

Science.gov (United States)

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.

Decentralized Ground Staff Scheduling

DEFF Research Database (Denmark)

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

2002-01-01

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

Medicare program; replacement of reasonable charge methodology by fee schedules for parenteral and enteral nutrients, equipment, and supplies. Final rule.

Science.gov (United States)

2001-08-28

This final rule implements fee schedules for payment of parenteral and enteral nutrition (PEN) items and services furnished under the prosthetic device benefit, defined in section 1861(s)(8) of the Social Security Act. The authority for establishing these fee schedules is provided by the Balanced Budget Act of 1997, which amended the Social Security Act at section 1842(s). Section 1842(s) of the Social Security Act specifies that statewide or other area wide fee schedules may be implemented for the following items and services still subject to the reasonable charge payment methodology: medical supplies; home dialysis supplies and equipment; therapeutic shoes; parenteral and enteral nutrients, equipment, and supplies; electromyogram devices; salivation devices; blood products; and transfusion medicine. This final rule describes changes made to the proposed fee schedule payment methodology for these items and services and provides that the fee schedules for PEN items and services are effective for all covered items and services furnished on or after January 1, 2002. Fee schedules will not be implemented for electromyogram devices and salivation devices at this time since these items are not covered by Medicare. In addition, fee schedules will not be implemented for medical supplies, home dialysis supplies and equipment, therapeutic shoes, blood products, and transfusion medicine at this time since the data required to establish these fee schedules are inadequate.

Multiuser switched diversity scheduling schemes

KAUST Repository

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

2012-01-01

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

Multiuser switched diversity scheduling schemes

KAUST Repository

Shaqfeh, Mohammad

2012-09-01

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

NASA Instrument Cost/Schedule Model

Science.gov (United States)

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

2011-01-01

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

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

DEFF Research Database (Denmark)

Hansen, Anders Dohn; Clausen, Jens

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

Do shorter wavelengths improve contrast in optical mammography?

International Nuclear Information System (INIS)

Taroni, P; Pifferi, A; Torricelli, A; Spinelli, L; Danesini, G M; Cubeddu, R

2004-01-01

The detection of tumours with time-resolved transmittance imaging relies essentially on blood absorption. Previous theoretical and phantom studies have shown that both contrast and spatial resolution of optical images are affected by the optical properties of the background medium, and high absorption and scattering are generally beneficial. Based on these observations, wavelengths shorter than presently used (680-780 nm) could be profitable for optical mammography. A study was thus performed analysing time-resolved transmittance images at 637, 656, 683 and 785 nm obtained from 26 patients bearing 16 tumours and 15 cysts. The optical contrast proved to increase upon decreasing wavelengths for the detection of cancers in late-gated intensity images, with higher gain in contrast for lesions of smaller size (<1.5 cm diameter). For cysts either a progressive increase or decrease in contrast with wavelength was observed in scattering images

The triangle scheduling problem

NARCIS (Netherlands)

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

2017-01-01

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

KASS v.2.2. scheduling software for construction

Directory of Open Access Journals (Sweden)

Krzemiński Michał

2016-01-01

Full Text Available The paper presents fourth version of specialist useful software in scheduling KASS v.2.2 (Algorithm Scheduling Krzeminski System. KASS software is designed for construction scheduling, specially form flow shop models. The program is being dedicated closely for the purposes of the construction. In distinguishing to other used programs in tasks of this type operational research criteria were designed closely with the thought about construction works and about the specificity of the building production. The minimal time, the minimal slack of brigades, the minimal slacks of the chosen working brigade and costs of the transfer operation of working fronts are included in operational research criteria between work centers. It is possible to enter data into the program both by hand as well as to load the Excel from files, similarly is with results, they are presented on-screen as well as a possibility of enrolling them in the file exists Excel. An element is very valid for it since allows for further simple processing of received results. In providing software for performing operational research calculations a technique of the complete review and simulation technology are being exploited. Described algorithms a program is using which will stay in the article as well as shown computational examples will remain.

A System for Automatically Generating Scheduling Heuristics

Science.gov (United States)

Morris, Robert

1996-01-01

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

Applying dynamic priority scheduling scheme to static systems of pinwheel task model in power-aware scheduling.

Science.gov (United States)

Seol, Ye-In; Kim, Young-Kuk

2014-01-01

Power-aware scheduling reduces CPU energy consumption in hard real-time systems through dynamic voltage scaling (DVS). In this paper, we deal with pinwheel task model which is known as static and predictable task model and could be applied to various embedded or ubiquitous systems. In pinwheel task model, each task's priority is static and its execution sequence could be predetermined. There have been many static approaches to power-aware scheduling in pinwheel task model. But, in this paper, we will show that the dynamic priority scheduling results in power-aware scheduling could be applied to pinwheel task model. This method is more effective than adopting the previous static priority scheduling methods in saving energy consumption and, for the system being still static, it is more tractable and applicable to small sized embedded or ubiquitous computing. Also, we introduce a novel power-aware scheduling algorithm which exploits all slacks under preemptive earliest-deadline first scheduling which is optimal in uniprocessor system. The dynamic priority method presented in this paper could be applied directly to static systems of pinwheel task model. The simulation results show that the proposed algorithm with the algorithmic complexity of O(n) reduces the energy consumption by 10-80% over the existing algorithms.

Artificial intelligence approaches to astronomical observation scheduling

Science.gov (United States)

Johnston, Mark D.; Miller, Glenn

1988-01-01

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

Accelerated stress testing in a time-driven product development process

NARCIS (Netherlands)

Lu, Y.; Loh, H.T.; Brombacher, A.C.; Ouden, den P.H.

2000-01-01

In order to compete in the market, companies have to produce the right products with a shorter time to market and at lower costs than before. Shorter time to market requires the product development process (PDP) to change the way of working from the classical ‘wait and react’ to anticipating and

On the Road to Improved Scheduling: Reducing the Effects of Variation in Duration

DEFF Research Database (Denmark)

Lindhard, Søren; Wandahl, Søren

2013-01-01

Scheduling in onsite construction is based on commitments. Unmet commitments result in non-completions which leads to waste. Moreover, it is important that commitments are realistic to avoid both positive and negative variation in duration. Negative variation is destructive to plans and schedules...... and results in delays, while positive variation is destructive to productivity by creating unexploited gaps between activities, thus inducing unexploited capacity. By registering non-completion at three construction sites, the magnitude of activities inducing negative variation has been mapped. In total, 5424...

Planning and scheduling - A schedule's performance

International Nuclear Information System (INIS)

Whitman, N.M.

1993-01-01

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

Alternative Work Schedules: Definitions

Science.gov (United States)

Journal of the College and University Personnel Association, 1977

1977-01-01

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

Planning and Scheduling of Airline Operations

Directory of Open Access Journals (Sweden)

İlkay ORHAN

2010-02-01

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

Energy-Efficient Scheduling Problem Using an Effective Hybrid Multi-Objective Evolutionary Algorithm

Directory of Open Access Journals (Sweden)

Lvjiang Yin

2016-12-01

Full Text Available Nowadays, manufacturing enterprises face the challenge of just-in-time (JIT production and energy saving. Therefore, study of JIT production and energy consumption is necessary and important in manufacturing sectors. Moreover, energy saving can be attained by the operational method and turn off/on idle machine method, which also increases the complexity of problem solving. Thus, most researchers still focus on small scale problems with one objective: a single machine environment. However, the scheduling problem is a multi-objective optimization problem in real applications. In this paper, a single machine scheduling model with controllable processing and sequence dependence setup times is developed for minimizing the total earliness/tardiness (E/T, cost, and energy consumption simultaneously. An effective multi-objective evolutionary algorithm called local multi-objective evolutionary algorithm (LMOEA is presented to tackle this multi-objective scheduling problem. To accommodate the characteristic of the problem, a new solution representation is proposed, which can convert discrete combinational problems into continuous problems. Additionally, a multiple local search strategy with self-adaptive mechanism is introduced into the proposed algorithm to enhance the exploitation ability. The performance of the proposed algorithm is evaluated by instances with comparison to other multi-objective meta-heuristics such as Nondominated Sorting Genetic Algorithm II (NSGA-II, Strength Pareto Evolutionary Algorithm 2 (SPEA2, Multiobjective Particle Swarm Optimization (OMOPSO, and Multiobjective Evolutionary Algorithm Based on Decomposition (MOEA/D. Experimental results demonstrate that the proposed LMOEA algorithm outperforms its counterparts for this kind of scheduling problems.

Development of Watch Schedule Using Rules Approach

Science.gov (United States)

Jurkevicius, Darius; Vasilecas, Olegas

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

Technology for planning and scheduling under complex constraints

Science.gov (United States)

Alguire, Karen M.; Pedro Gomes, Carla O.

1997-02-01

Within the context of law enforcement, several problems fall into the category of planning and scheduling under constraints. Examples include resource and personnel scheduling, and court scheduling. In the case of court scheduling, a schedule must be generated considering available resources, e.g., court rooms and personnel. Additionally, there are constraints on individual court cases, e.g., temporal and spatial, and between different cases, e.g., precedence. Finally, there are overall objectives that the schedule should satisfy such as timely processing of cases and optimal use of court facilities. Manually generating a schedule that satisfies all of the constraints is a very time consuming task. As the number of court cases and constraints increases, this becomes increasingly harder to handle without the assistance of automatic scheduling techniques. This paper describes artificial intelligence (AI) technology that has been used to develop several high performance scheduling applications including a military transportation scheduler, a military in-theater airlift scheduler, and a nuclear power plant outage scheduler. We discuss possible law enforcement applications where we feel the same technology could provide long-term benefits to law enforcement agencies and their operations personnel.

Combined effects of food deprivation and food frequency on the amount and temporal distribution of schedule-induced drinking.

Science.gov (United States)

Castilla, José Luis; Pellón, Ricardo

2013-11-01

Under intermittent food schedules animals develop temporally organized behaviors throughout interfood intervals, with behaviors early in the intervals (interim) normally occurring in excess. Schedule-induced drinking (a prototype of interim, adjunctive behavior) is related to food deprivation and food frequency. This study investigated the interactions that resulted from combining different food-deprivation levels (70%, 80% or 90% free-feeding weights) with different food-occurrence frequencies (15-, 30- or 60-s interfood intervals) in a within-subjects design. Increases in food deprivation and food frequency generally led to increased licking, with greater differences due to food deprivation as interfood intervals became shorter. Distributions of licking were modestly shifted to later in the interfood interval as interfood intervals lengthened, a result that was most marked under 90% food deprivation, which also resulted in flatter distributions. It would therefore appear that food deprivation modulates the licking rate and the distribution of licking in different ways. Effects of food deprivation and food frequency are adequately explained by a theory of adjunctive behavior based on delayed food reinforcement, in contrast to alternative hypotheses. © Society for the Experimental Analysis of Behavior.

NRC comprehensive records disposition schedule

International Nuclear Information System (INIS)

1983-05-01

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

76 FR 72721 - Galvanized Steel Wire From China and Mexico; Scheduling of the Final Phase of Countervailing Duty...

Science.gov (United States)

2011-11-25

...)] Galvanized Steel Wire From China and Mexico; Scheduling of the Final Phase of Countervailing Duty and... galvanized steel wire, provided for in subheading 7217.20 of the Harmonized Tariff Schedule of the United... merchandise as galvanized steel wire which is a cold- drawn carbon quality steel product in coils, of solid...

Erratum to ''Johnson's algorithm : A key to solve optimally or approximately flowshop scheduling problems with unavailability periods'' [International Journal of Production Economics 121 (2009) 81-87

OpenAIRE

Rapine , Christophe

2013-01-01

International audience; In Allaoui H., Artiba A, ''Johnson's algorithm : A key to solve optimally or approximately flowshop scheduling problems with unavailability periods'' [International Journal of Production Economics 121 (2009)] the authors propose optimality conditions for the Johnson sequence in presence of one unavailability period on the first machine and pretend for a performance guarantee of 2 when several unavailability periods may occur. We establish in this note that these condit...

VNS (Variable Neighbourhood Search) applied to batch sequencing in operational scheduling of pipeline network; VNS (Variable Neighbourhood Search) aplicado ao sequenciamento de bateladas do 'scheduling' de operacoes de uma malha dutoviaria

Energy Technology Data Exchange (ETDEWEB)

Yamamoto, Lia; Arruda, Lucia Valeria Ramos de; Libert, Nikolas [Universidade Tecnologica Federal do Parana (UTFPR), Curitiba, PR (Brazil)

2008-07-01

This work presents the VNS heuristic technique applied on batches ordering in a real network of petroleum derivatives distribution. These ordering have great influence in operational scheduling of a pipeline network. The operational scheduling purposes the efficient utilization of the resources, resulting on a better performance. Due to the great complexity of the real network problem and the necessity of its resolution in little computational time, it was adopted a problem subdivision in assignment of resources, sequencing and timing. In the resources assignment stage, it is considered the production/consumption functions and the products tankages to determine the total batches, including its volume, flow rate and the time-windows to satisfy the demand. These data are used in the sequencing stage, where a VNS based model determines the batches ordering. In a final step, the last block, realize the temporisation considering the network operational constraints. This work shows the results from the optimization of the sequencing stage which aims the improvement of the solution quality of scheduling. (author)

CMS multicore scheduling strategy

International Nuclear Information System (INIS)

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

2014-01-01

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

Proposal of Heuristic Algorithm for Scheduling of Print Process in Auto Parts Supplier

Science.gov (United States)

Matsumoto, Shimpei; Okuhara, Koji; Ueno, Nobuyuki; Ishii, Hiroaki

We are interested in the print process on the manufacturing processes of auto parts supplier as an actual problem. The purpose of this research is to apply our scheduling technique developed in university to the actual print process in mass customization environment. Rationalization of the print process is depending on the lot sizing. The manufacturing lead time of the print process is long, and in the present method, production is done depending on worker’s experience and intuition. The construction of an efficient production system is urgent problem. Therefore, in this paper, in order to shorten the entire manufacturing lead time and to reduce the stock, we reexamine the usual method of the lot sizing rule based on heuristic technique, and we propose the improvement method which can plan a more efficient schedule.

Power generation scheduling. A free market based procedure with reserve constraints included

International Nuclear Information System (INIS)

Huse, Einar Staale

1998-01-01

This thesis deals with the short-term scheduling of electric power generation in a competitive market. This involves determination of start-ups and shut-downs, and production levels of all units in all hours of the optimization period, considering unit characteristics and system restrictions. The unit characteristics and restrictions handled are minimum and maximum production levels, fuel cost function, start-up costs, minimum up time and minimum down time. The system restrictions handled are power balance (supply equals demand in all hours) and spinning reserve requirement. The thesis has two main contributions: (1) A new organization of an hourly electric power market that simultaneously sets the price of both energy and reserve power is proposed. A power exchange is used as a trading place for electricity. Its responsibility is to balance supply and demand bids and to secure enough spinning reserve. Routines for bidding and market clearing are developed. (2) A computer programme that simulates the proposed electricity market has been implemented. The program can also be used as a new method for solving the single owner generation scheduling problem. Simulations show that the performance of the program is excellent. Simulations also show that it is possible to obtain efficient schedules through the proposed electricity market. 37 refs., 20 figs., 15 tabs

Power generation scheduling. A free market based procedure with reserve constraints included

Energy Technology Data Exchange (ETDEWEB)

Huse, Einar Staale

1999-12-31

This thesis deals with the short-term scheduling of electric power generation in a competitive market. This involves determination of start-ups and shut-downs, and production levels of all units in all hours of the optimization period, considering unit characteristics and system restrictions. The unit characteristics and restrictions handled are minimum and maximum production levels, fuel cost function, start-up costs, minimum up time and minimum down time. The system restrictions handled are power balance (supply equals demand in all hours) and spinning reserve requirement. The thesis has two main contributions: (1) A new organization of an hourly electric power market that simultaneously sets the price of both energy and reserve power is proposed. A power exchange is used as a trading place for electricity. Its responsibility is to balance supply and demand bids and to secure enough spinning reserve. Routines for bidding and market clearing are developed. (2) A computer programme that simulates the proposed electricity market has been implemented. The program can also be used as a new method for solving the single owner generation scheduling problem. Simulations show that the performance of the program is excellent. Simulations also show that it is possible to obtain efficient schedules through the proposed electricity market. 37 refs., 20 figs., 15 tabs.

Power generation scheduling. A free market based procedure with reserve constraints included

Energy Technology Data Exchange (ETDEWEB)

Huse, Einar Staale

1998-12-31

This thesis deals with the short-term scheduling of electric power generation in a competitive market. This involves determination of start-ups and shut-downs, and production levels of all units in all hours of the optimization period, considering unit characteristics and system restrictions. The unit characteristics and restrictions handled are minimum and maximum production levels, fuel cost function, start-up costs, minimum up time and minimum down time. The system restrictions handled are power balance (supply equals demand in all hours) and spinning reserve requirement. The thesis has two main contributions: (1) A new organization of an hourly electric power market that simultaneously sets the price of both energy and reserve power is proposed. A power exchange is used as a trading place for electricity. Its responsibility is to balance supply and demand bids and to secure enough spinning reserve. Routines for bidding and market clearing are developed. (2) A computer programme that simulates the proposed electricity market has been implemented. The program can also be used as a new method for solving the single owner generation scheduling problem. Simulations show that the performance of the program is excellent. Simulations also show that it is possible to obtain efficient schedules through the proposed electricity market. 37 refs., 20 figs., 15 tabs.

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

DEFF Research Database (Denmark)

Hansen, Anders Dohn; Clausen, Jens

2010-01-01

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

Data analysis with the DIANA meta-scheduling approach

International Nuclear Information System (INIS)

Anjum, A; McClatchey, R; Willers, I

2008-01-01

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

Scheduling lessons learned from the Autonomous Power System

Science.gov (United States)

Ringer, Mark J.

1992-01-01

The Autonomous Power System (APS) project at NASA LeRC is designed to demonstrate the applications of integrated intelligent diagnosis, control, and scheduling techniques to space power distribution systems. The project consists of three elements: the Autonomous Power Expert System (APEX) for Fault Diagnosis, Isolation, and Recovery (FDIR); the Autonomous Intelligent Power Scheduler (AIPS) to efficiently assign activities start times and resources; and power hardware (Brassboard) to emulate a space-based power system. The AIPS scheduler was tested within the APS system. This scheduler is able to efficiently assign available power to the requesting activities and share this information with other software agents within the APS system in order to implement the generated schedule. The AIPS scheduler is also able to cooperatively recover from fault situations by rescheduling the affected loads on the Brassboard in conjunction with the APEX FDIR system. AIPS served as a learning tool and an initial scheduling testbed for the integration of FDIR and automated scheduling systems. Many lessons were learned from the AIPS scheduler and are now being integrated into a new scheduler called SCRAP (Scheduler for Continuous Resource Allocation and Planning). This paper will service three purposes: an overview of the AIPS implementation, lessons learned from the AIPS scheduler, and a brief section on how these lessons are being applied to the new SCRAP scheduler.

Optimization of Hierarchically Scheduled Heterogeneous Embedded Systems

DEFF Research Database (Denmark)

Pop, Traian; Pop, Paul; Eles, Petru

2005-01-01

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

Sport Tournament Automated Scheduling System

OpenAIRE

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

2018-01-01

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

Workforce scheduling: A new model incorporating human factors

Directory of Open Access Journals (Sweden)

Mohammed Othman

2012-12-01

Full Text Available Purpose: The majority of a company’s improvement comes when the right workers with the right skills, behaviors and capacities are deployed appropriately throughout a company. This paper considers a workforce scheduling model including human aspects such as skills, training, workers’ personalities, workers’ breaks and workers’ fatigue and recovery levels. This model helps to minimize the hiring, firing, training and overtime costs, minimize the number of fired workers with high performance, minimize the break time and minimize the average worker’s fatigue level.Design/methodology/approach: To achieve this objective, a multi objective mixed integer programming model is developed to determine the amount of hiring, firing, training and overtime for each worker type.Findings: The results indicate that the worker differences should be considered in workforce scheduling to generate realistic plans with minimum costs. This paper also investigates the effects of human fatigue and recovery on the performance of the production systems.Research limitations/implications: In this research, there are some assumptions that might affect the accuracy of the model such as the assumption of certainty of the demand in each period, and the linearity function of Fatigue accumulation and recovery curves. These assumptions can be relaxed in future work.Originality/value: In this research, a new model for integrating workers’ differences with workforce scheduling is proposed. To the authors' knowledge, it is the first time to study the effects of different important human factors such as human personality, skills and fatigue and recovery in the workforce scheduling process. This research shows that considering both technical and human factors together can reduce the costs in manufacturing systems and ensure the safety of the workers.

40 CFR 141.702 - Sampling schedules.

Science.gov (United States)

2010-07-01

... serving at least 10,000 people must submit their sampling schedule for the initial round of source water... submitting the sampling schedule that EPA approves. (3) Systems serving fewer than 10,000 people must submit... analytical result for a scheduled sampling date due to equipment failure, loss of or damage to the sample...

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

Science.gov (United States)

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

2016-08-01

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

Routine environmental monitoring schedule, calendar year 1995

International Nuclear Information System (INIS)

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

1994-12-01

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

Interactive Dynamic Mission Scheduling for ASCA

Science.gov (United States)

Antunes, A.; Nagase, F.; Isobe, T.

The Japanese X-ray astronomy satellite ASCA (Advanced Satellite for Cosmology and Astrophysics) mission requires scheduling for each 6-month observation phase, further broken down into weekly schedules at a few minutes resolution. Two tools, SPIKE and NEEDLE, written in Lisp and C, use artificial intelligence (AI) techniques combined with a graphic user interface for fast creation and alteration of mission schedules. These programs consider viewing and satellite attitude constraints as well as observer-requested criteria and present an optimized set of solutions for review by the planner. Six-month schedules at 1 day resolution are created for an oversubscribed set of targets by the SPIKE software, originally written for HST and presently being adapted for EUVE, XTE and AXAF. The NEEDLE code creates weekly schedules at 1 min resolution using in-house orbital routines and creates output for processing by the command generation software. Schedule creation on both the long- and short-term scale is rapid, less than 1 day for long-term, and one hour for short-term.

Field Engineers' Scheduling at Oil Rigs: a Case Study

Directory of Open Access Journals (Sweden)

Y. S. Usmani

2012-02-01

Full Text Available Oil exploration and production operations face a number of challenges. Professional planners have to design solutions for various practical problems or issues. However, the time consumed is often very extensive because of the large number of possible solutions. Further, the matter of choosing the best solution remains. The present paper investigates a problem related to leading companies in the energy and chemical manufacturing sector of the oil and gas industry. Each company’s field engineers are expensive and valuable assets. Therefore, an optimized roster is rather important. In the present paper, the objective is to design a field engineers’ schedule which would be both feasible and satisfying towards the various demands of rigs, with minimum operational cost to the company. An efficient and quick optimization technique is presented to schedule the shifts of field engineers.

A multi-criteria model for maintenance job scheduling

Directory of Open Access Journals (Sweden)

Sunday A. Oke

2007-12-01

Full Text Available This paper presents a multi-criteria maintenance job scheduling model, which is formulated using a weighted multi-criteria integer linear programming maintenance scheduling framework. Three criteria, which have direct relationship with the primary objectives of a typical production setting, were used. These criteria are namely minimization of equipment idle time, manpower idle time and lateness of job with unit parity. The mathematical model constrained by available equipment, manpower and job available time within planning horizon was tested with a 10-job, 8-hour time horizon problem with declared equipment and manpower available as against the required. The results, analysis and illustrations justify multi-criteria consideration. Thus, maintenance managers are equipped with a tool for adequate decision making that guides against error in the accumulated data which may lead to wrong decision making. The idea presented is new since it provides an approach that has not been documented previously in the literature.

PRACTICAL IMPLICATIONS OF LOCATION-BASED SCHEDULING

DEFF Research Database (Denmark)

Andersson, Niclas; Christensen, Knud

2007-01-01

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

Environmental surveillance master sampling schedule

International Nuclear Information System (INIS)

Bisping, L.E.

1991-01-01

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

Environmental surveillance master sampling schedule

Energy Technology Data Exchange (ETDEWEB)

Bisping, L.E.

1991-01-01

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

Schedule and staffing of a nuclear power project

International Nuclear Information System (INIS)

Polliart, A.J.; Csik, B.

1977-01-01

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

Limited Preemptive Scheduling in Real-time Systems

OpenAIRE

Thekkilakattil, Abhilash

2016-01-01

Preemptive and non-preemptive scheduling paradigms typically introduce undesirable side effects when scheduling real-time tasks, mainly in the form of preemption overheads and blocking, that potentially compromise timeliness guarantees. The high preemption overheads in preemptive real-time scheduling may imply high resource utilization, often requiring significant over-provisioning, e.g., pessimistic Worst Case Execution Time (WCET) approximations. Non-preemptive scheduling, on the other hand...

Clinch River Breeder Reactor Plant Project: construction schedule

International Nuclear Information System (INIS)

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

1982-01-01

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

The risk of shorter fasting time for pediatric deep sedation.

Science.gov (United States)

Clark, Mathew; Birisci, Esma; Anderson, Jordan E; Anliker, Christina M; Bryant, Micheal A; Downs, Craig; Dalabih, Abdallah

2016-01-01

Current guidelines adopted by the American Academy of Pediatrics calls for prolonged fasting times before performing pediatric procedural sedation and analgesia (PSA). PSA is increasingly provided to children outside of the operating theater by sedation trained pediatric providers and does not require airway manipulation. We investigated the safety of a shorter fasting time compared to a longer and guideline compliant fasting time. We tried to identify the association between fasting time and sedation-related complications. This is a prospective observational study that included children 2 months to 18 years of age and had an American Society of Anesthesiologists physical status classification of I or II, who underwent deep sedation for elective procedures, performed by pediatric critical care providers. Procedures included radiologic imaging studies, electroencephalograms, auditory brainstem response, echocardiograms, Botox injections, and other minor surgical procedures. Subjects were divided into two groups depending on the length of their fasting time (4-6 h and >6 h). Complication rates were calculated and compared between the three groups. In the studied group of 2487 subjects, 1007 (40.5%) had fasting time of 4-6 h and the remaining 1480 (59.5%) subjects had fasted for >6 h. There were no statistically significant differences in any of the studied complications between the two groups. This study found no difference in complication rate in regard to the fasting time among our subjects cohort, which included only healthy children receiving elective procedures performed by sedation trained pediatric critical care providers. This suggests that using shorter fasting time may be safe for procedures performed outside of the operating theater that does not involve high-risk patients or airway manipulation.

Utilization Bound of Non-preemptive Fixed Priority Schedulers

Science.gov (United States)

Park, Moonju; Chae, Jinseok

It is known that the schedulability of a non-preemptive task set with fixed priority can be determined in pseudo-polynomial time. However, since Rate Monotonic scheduling is not optimal for non-preemptive scheduling, the applicability of existing polynomial time tests that provide sufficient schedulability conditions, such as Liu and Layland's bound, is limited. This letter proposes a new sufficient condition for non-preemptive fixed priority scheduling that can be used for any fixed priority assignment scheme. It is also shown that the proposed schedulability test has a tighter utilization bound than existing test methods.

Further Examination of the Reliability of the Modified Rathus Assertiveness Schedule.

Science.gov (United States)

Del Greco, Linda; And Others

1986-01-01

Examined the reliability of the 30-item Modified Rathus Assertiveness Schedule (MRAS) using the test-retest method over a three-week period. The MRAS yielded correlations of .74 using the Pearson product and Spearman Brown correlation coefficient. Correlations for males yielded .77 and .72. For females correlations for both tests were .72.…

Estimating exponential scheduling preferences

DEFF Research Database (Denmark)

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

2015-01-01

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

Group Elevator Peak Scheduling Based on Robust Optimization Model

Directory of Open Access Journals (Sweden)

ZHANG, J.

2013-08-01

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

NRC comprehensive records disposition schedule. Revision 3

International Nuclear Information System (INIS)

1998-02-01

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

NRC comprehensive records disposition schedule. Revision 3

Energy Technology Data Exchange (ETDEWEB)

NONE

1998-02-01

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

A Hybrid Task Graph Scheduler for High Performance Image Processing Workflows.

Science.gov (United States)

Blattner, Timothy; Keyrouz, Walid; Bhattacharyya, Shuvra S; Halem, Milton; Brady, Mary

2017-12-01

Designing applications for scalability is key to improving their performance in hybrid and cluster computing. Scheduling code to utilize parallelism is difficult, particularly when dealing with data dependencies, memory management, data motion, and processor occupancy. The Hybrid Task Graph Scheduler (HTGS) improves programmer productivity when implementing hybrid workflows for multi-core and multi-GPU systems. The Hybrid Task Graph Scheduler (HTGS) is an abstract execution model, framework, and API that increases programmer productivity when implementing hybrid workflows for such systems. HTGS manages dependencies between tasks, represents CPU and GPU memories independently, overlaps computations with disk I/O and memory transfers, keeps multiple GPUs occupied, and uses all available compute resources. Through these abstractions, data motion and memory are explicit; this makes data locality decisions more accessible. To demonstrate the HTGS application program interface (API), we present implementations of two example algorithms: (1) a matrix multiplication that shows how easily task graphs can be used; and (2) a hybrid implementation of microscopy image stitching that reduces code size by ≈ 43% compared to a manually coded hybrid workflow implementation and showcases the minimal overhead of task graphs in HTGS. Both of the HTGS-based implementations show good performance. In image stitching the HTGS implementation achieves similar performance to the hybrid workflow implementation. Matrix multiplication with HTGS achieves 1.3× and 1.8× speedup over the multi-threaded OpenBLAS library for 16k × 16k and 32k × 32k size matrices, respectively.

Cure Schedule for Stycast 2651/Catalyst 9.

Energy Technology Data Exchange (ETDEWEB)

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

2017-11-01

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

Job shop scheduling problem with late work criterion

Science.gov (United States)

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.

Diversity Controlling Genetic Algorithm for Order Acceptance and Scheduling Problem

Directory of Open Access Journals (Sweden)

Cheng Chen

2014-01-01

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

Increasing operating room productivity by duration categories and a newsvendor model.

Science.gov (United States)

Lehtonen, Juha-Matti; Torkki, Paulus; Peltokorpi, Antti; Moilanen, Teemu

2013-01-01

Previous studies approach surgery scheduling mainly from the mathematical modeling perspective which is often hard to apply in a practical environment. The aim of this study is to develop a practical scheduling system that considers the advantages of both surgery categorization and newsvendor model to surgery scheduling. The research was carried out in a Finnish orthopaedic specialist centre that performs only joint replacement surgery. Four surgery categorization scenarios were defined and their productivity analyzed by simulation and newsvendor model. Detailed analyses of surgery durations and the use of more accurate case categories and their combinations in scheduling improved OR productivity 11.3 percent when compared to the base case. Planning to have one OR team to work longer led to remarkable decrease in scheduling inefficiency. In surgical services, productivity and cost-efficiency can be improved by utilizing historical data in case scheduling and by increasing flexibility in personnel management. The study increases the understanding of practical scheduling methods used to improve efficiency in surgical services.

Polling, production & priorities

NARCIS (Netherlands)

Winands, E.M.M.

2007-01-01

Polling, Production & Priorities The present monograph focuses on the so-called stochastic economic lot scheduling problem (SELSP), which deals with the make-to-stock production of multiple standardized products on a single machine with limited capacity under random demands, possibly random setup

The Change of the Family Life Affected by the Shorter Working Time : From the Point of View of the Home Management

OpenAIRE

平田, 道憲

1994-01-01

In Japan, the working time has been decreasing. However, Japanese working people spend more hours per year to work than those in Western countries. The policy of the shorter working time is conducted by the Japanese Government in order that the working people get more free time. This paper examines whether the shorter working time of working members in the family enrich the time use of the other members of the family. Especially, the effect of the shorter working time of husbands to wives...

Single-machine scheduling with release dates, due dates and family setup times

NARCIS (Netherlands)

Schutten, Johannes M.J.; van de Velde, S.L.; van de Velde, S.L.; Zijm, Willem H.M.

1996-01-01

We address the NP-hard problem of scheduling n independent jobs with release dates, due dates, and family setup times on a single machine to minimize the maximum lateness. This problem arises from the constant tug-of-war going on in manufacturing between efficient production and delivery

MEDICAL STAFF SCHEDULING USING SIMULATED ANNEALING

Directory of Open Access Journals (Sweden)

Ladislav Rosocha

2015-07-01

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

Practical principles in appointment scheduling

NARCIS (Netherlands)

Kuiper, A.; Mandjes, M.

2015-01-01

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

Representativeness of shorter measurement sessions in long-term indoor air monitoring.

Science.gov (United States)

Maciejewska, M; Szczurek, A

2015-02-01

Indoor air quality (IAQ) considerably influences health, comfort and the overall performance of people who spend most of their lives in confined spaces. For this reason, there is a strong need to develop methods for IAQ assessment. The fundamental issue in the quantitative determination of IAQ is the duration of measurements. Its inadequate choice may result in providing incorrect information and this potentially leads to wrong conclusions. The most complete information may be acquired through long-term monitoring. However it is typically perceived as impractical due to time and cost load. The aim of this study was to determine whether long-term monitoring can be adequately represented by a shorter measurement session. There were considered three measurable quantities: temperature, relative humidity and carbon dioxide concentration. They are commonly recognized as indicatives for IAQ and may be readily monitored. Scaled Kullback-Leibler divergence, also called relative entropy, was applied as a measure of data representativeness. We considered long-term monitoring in a range from 1 to 9 months. Based on our work, the representative data on CO2 concentration may be acquired while performing measurements during 20% of time dedicated to long-term monitoring. In the case of temperature and relative humidity the respective time demand was 50% of long-term monitoring. From our results, in indoor air monitoring strategies, there could be considered shorter measurement sessions, while still collecting data which are representative for long-term monitoring.

What Caused the Recession of 2008? Hints from Labor Productivity

OpenAIRE

Casey Mulligan

2009-01-01

A labor market tautology says that any change in labor usage can be decomposed into a movement along a marginal productivity schedule and a shift of the schedule. I calculate this decomposition for the recession of 2008, assuming an aggregate Cobb-Douglas marginal productivity schedule, and find that all of the decline in employment and hours since December 2007 is a movement along the schedule. This finding suggests that a reduction in labor supply and/or an increase in labor market distorti...

Sport Tournament Automated Scheduling System

Directory of Open Access Journals (Sweden)

Raof R. A. A

2018-01-01

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

Optimization of operating schedule of machines in granite industry using evolutionary algorithms

International Nuclear Information System (INIS)

Loganthurai, P.; Rajasekaran, V.; Gnanambal, K.

2014-01-01

Highlights: • Operating time of machines in granite industries was studied. • Operating time has been optimized using evolutionary algorithms such as PSO, DE. • The maximum demand has been reduced. • Hence the electricity cost of the industry and feeder stress have been reduced. - Abstract: Electrical energy consumption cost plays an important role in the production cost of any industry. The electrical energy consumption cost is calculated as two part tariff, the first part is maximum demand cost and the second part is energy consumption cost or unit cost (kW h). The maximum demand cost can be reduced without affecting the production. This paper focuses on the reduction of maximum demand by proper operating schedule of major equipments. For this analysis, various granite industries are considered. The major equipments in granite industries are cutting machine, polishing machine and compressor. To reduce the maximum demand, the operating time of polishing machine is rescheduled by optimization techniques such as Differential Evolution (DE) and particle swarm optimization (PSO). The maximum demand costs are calculated before and after rescheduling. The results show that if the machines are optimally operated, the cost is reduced. Both DE and PSO algorithms reduce the maximum demand cost at the same rate for all the granite industries. However, the optimum scheduling obtained by DE reduces the feeder power flow than the PSO scheduling

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

NARCIS (Netherlands)

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

2005-01-01

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

SURVEY - Multicriteria Models for Just-in-Time Scheduling

OpenAIRE

T'Kindt , Vincent

2010-01-01

Abstract Just-in-Time manufacturing consists in organizing the production of elements in order to meet a certain number of objectives or requirements according to the so-called ?Just-in-Time philosophy?. Just-in-Time has been extensively studied in the literature for many years due to the high number of real-life situations where it can be applied. This paper aims at revisiting Just-in-Time principles and detailing how they can be applied to the scheduling stage of a manufacturi...

Scheduling nursing personnel on a microcomputer.

Science.gov (United States)

Liao, C J; Kao, C Y

1997-01-01

Suggests that with the shortage of nursing personnel, hospital administrators have to pay more attention to the needs of nurses to retain and recruit them. Also asserts that improving nurses' schedules is one of the most economic ways for the hospital administration to create a better working environment for nurses. Develops an algorithm for scheduling nursing personnel. Contrary to the current hospital approach, which schedules nurses on a person-by-person basis, the proposed algorithm constructs schedules on a day-by-day basis. The algorithm has inherent flexibility in handling a variety of possible constraints and goals, similar to other non-cyclical approaches. But, unlike most other non-cyclical approaches, it can also generate a quality schedule in a short time on a microcomputer. The algorithm was coded in C language and run on a microcomputer. The developed software is currently implemented at a leading hospital in Taiwan. The response to the initial implementation is quite promising.

Vehicle and driver scheduling for public transit.

Science.gov (United States)

2009-08-01

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

A hybrid job-shop scheduling system

Science.gov (United States)

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

1992-01-01

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

Brief-stimulus presentations on multiform tandem schedules

OpenAIRE

Reed, Phil

1994-01-01

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

Mathematical programming and financial objectives for scheduling projects

CERN Document Server

Kimms, Alf

2001-01-01

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

A customizable, scalable scheduling and reporting system.

Science.gov (United States)

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

2014-06-01

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

The Composition of the Master Schedule

Science.gov (United States)

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

2010-01-01

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

77 FR 41258 - FOIA Fee Schedule Update

Science.gov (United States)

2012-07-13

... DEFENSE NUCLEAR FACILITIES SAFETY BOARD 10 CFR Part 1703 FOIA Fee Schedule Update AGENCY: Defense Nuclear Facilities Safety Board. ACTION: Establishment of FOIA Fee Schedule. SUMMARY: The Defense Nuclear Facilities Safety Board is publishing its Freedom of Information Act (FOIA) Fee Schedule Update pursuant to...

76 FR 43819 - FOIA Fee Schedule Update

Science.gov (United States)

2011-07-22

... DEFENSE NUCLEAR FACILITIES SAFETY BOARD 10 CFR Part 1703 FOIA Fee Schedule Update AGENCY: Defense Nuclear Facilities Safety Board. ACTION: Establishment of FOIA Fee Schedule. SUMMARY: The Defense Nuclear Facilities Safety Board is publishing its Freedom of Information Act (FOIA) Fee Schedule Update pursuant to...

75 FR 7411 - Schedule of Water Charges

Science.gov (United States)

2010-02-19

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

Prescribed Travel Schedules for Fatigue Management

Science.gov (United States)

Whitmire, Alexandra; Johnston, Smith; Lockley, Steven

2011-01-01

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

Sequencing, lot sizing and scheduling in job shops: the common cycle approach

NARCIS (Netherlands)

Ouenniche, J.; Boctor, F.F.

1998-01-01

This paper deals with the multi-product, finite horizon, static demand, sequencing, lot sizing and scheduling problem in a job shop environment where the objective is to minimize the sum of setup and inventory holding costs while satisfying the demand with no backlogging. To solve this problem, we

Single-machine scheduling with release dates, due dates, and family setup times

NARCIS (Netherlands)

J.M.J. Schutten (Marco); S.L. van de Velde (Steef); W.H.M. Zijm

1996-01-01

textabstractWe address the NP-hard problem of scheduling n independent jobs with release dates, due dates, and family setup times on a single machine to minimize the maximum lateness. This problem arises from the constant tug-of-war going on in manufacturing between efficient production and delivery

A Hybrid Metaheuristic Approach for Minimizing the Total Flow Time in A Flow Shop Sequence Dependent Group Scheduling Problem

Directory of Open Access Journals (Sweden)

Antonio Costa

2014-07-01

Full Text Available Production processes in Cellular Manufacturing Systems (CMS often involve groups of parts sharing the same technological requirements in terms of tooling and setup. The issue of scheduling such parts through a flow-shop production layout is known as the Flow-Shop Group Scheduling (FSGS problem or, whether setup times are sequence-dependent, the Flow-Shop Sequence-Dependent Group Scheduling (FSDGS problem. This paper addresses the FSDGS issue, proposing a hybrid metaheuristic procedure integrating features from Genetic Algorithms (GAs and Biased Random Sampling (BRS search techniques with the aim of minimizing the total flow time, i.e., the sum of completion times of all jobs. A well-known benchmark of test cases, entailing problems with two, three, and six machines, is employed for both tuning the relevant parameters of the developed procedure and assessing its performances against two metaheuristic algorithms recently presented by literature. The obtained results and a properly arranged ANOVA analysis highlight the superiority of the proposed approach in tackling the scheduling problem under investigation.

Scheduling multimedia services in cloud computing environment

Science.gov (United States)

Liu, Yunchang; Li, Chunlin; Luo, Youlong; Shao, Yanling; Zhang, Jing

2018-02-01

Currently, security is a critical factor for multimedia services running in the cloud computing environment. As an effective mechanism, trust can improve security level and mitigate attacks within cloud computing environments. Unfortunately, existing scheduling strategy for multimedia service in the cloud computing environment do not integrate trust mechanism when making scheduling decisions. In this paper, we propose a scheduling scheme for multimedia services in multi clouds. At first, a novel scheduling architecture is presented. Then, We build a trust model including both subjective trust and objective trust to evaluate the trust degree of multimedia service providers. By employing Bayesian theory, the subjective trust degree between multimedia service providers and users is obtained. According to the attributes of QoS, the objective trust degree of multimedia service providers is calculated. Finally, a scheduling algorithm integrating trust of entities is proposed by considering the deadline, cost and trust requirements of multimedia services. The scheduling algorithm heuristically hunts for reasonable resource allocations and satisfies the requirement of trust and meets deadlines for the multimedia services. Detailed simulated experiments demonstrate the effectiveness and feasibility of the proposed trust scheduling scheme.

Scheduling nurses’ shifts at PGI Cikini Hospital

Science.gov (United States)

Nainggolan, J. C. T.; Kusumastuti, R. D.

2018-03-01

Hospitals play an essential role in the community by providing medical services to the public. In order to provide high quality medical services, hospitals must manage their resources (including nurses) effectively and efficiently. Scheduling of nurses’ work shifts, in particular, is crucial, and must be conducted carefully to ensure availability and fairness. This research discusses the job scheduling system for nurses in PGI Cikini Hospital, Jakarta with Goal Programming approach. The research objectives are to identify nurse scheduling criteria and find the best schedule that can meet the criteria. The model has hospital regulations (including government regulations) as hard constraints, and nurses’ preferences as soft constraints. We gather primary data (hospital regulations and nurses’ preferences) through interviews with three Head Nurses and distributing questionnaires to fifty nurses. The results show that on the best schedule, all hard constraints can be satisfied. However, only two out of four soft constraints are satisfied. Compared to current scheduling practice, the resulting schedule ensures the availability of nurses as it satisfies all hospital’s regulations and it has a higher level of fairness as it can accommodate some of the nurses’ preferences.

Analysis and Optimisation of Hierarchically Scheduled Multiprocessor Embedded Systems

DEFF Research Database (Denmark)

Pop, Traian; Pop, Paul; Eles, Petru

2008-01-01

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

Flow shop scheduling with heterogeneous workers

OpenAIRE

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

2014-01-01

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

An improved scheduling algorithm for linear networks

KAUST Repository

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

2017-01-01

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

An improved scheduling algorithm for linear networks

KAUST Repository

Bader, Ahmed

2017-02-09

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

Mechanisms for scheduling games with selfish players

NARCIS (Netherlands)

Hoeksma, R.P.

2015-01-01

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

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

Energy Technology Data Exchange (ETDEWEB)

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

2013-12-06

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

GSA eLibrary Schedules and Contracts

Data.gov (United States)

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

Production management (2000)

International Nuclear Information System (INIS)

Jung, Chung Yeong

2000-08-01

This book includes basic concept of production management, production system, strategy and mission of production, decision of production management, operation of decision making, life cycle of items and development, value of productions, design for reliability of productions, equipment layout and manufacturing process, quantitative forecast, schedule plan, inventory system, concept, input and output of MRP, Montekalo simulation, quality management, and automation system.

Minimizing tardiness for job shop scheduling under uncertainties

OpenAIRE

Yahouni , Zakaria; Mebarki , Nasser; Sari , Zaki

2016-01-01

International audience; —Many disturbances can occur during the execution of a manufacturing scheduling process. To cope with this drawback , flexible solutions are proposed based on the offline and the online phase of the schedule. Groups of permutable operations is one of the most studied flexible scheduling methods bringing flexibility as well as quality to a schedule. The online phase of this method is based on a human-machine system allowing to choose in real-time one schedule from a set...

Radiopharmaceutical production at Lucas Heights

International Nuclear Information System (INIS)

Druce, M.

1987-01-01

The difficult problems of operating and maintaining complex equipment, meeting despatch deadlines, ensuring product quality, production scheduling and controlling staff are discussed in relation to Australia's national radioisotope production plant

Integrated test schedule for buried waste integrated demonstration

International Nuclear Information System (INIS)

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

1992-05-01

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

14 CFR 399.81 - Unrealistic or deceptive scheduling.

Science.gov (United States)

2010-01-01

... 14 Aeronautics and Space 4 2010-01-01 2010-01-01 false Unrealistic or deceptive scheduling. 399.81... Unrealistic or deceptive scheduling. (a) It is the policy of the Board to consider unrealistic scheduling of... to the advertising of scheduled performance, it is the policy of the Board to regard as an unfair or...

LEARNING SCHEDULER PARAMETERS FOR ADAPTIVE PREEMPTION

OpenAIRE

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

2015-01-01

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

Topology-based hierarchical scheduling using deficit round robin

DEFF Research Database (Denmark)

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

2009-01-01

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

33 CFR 401.58 - Pleasure craft scheduling.

Science.gov (United States)

2010-07-01

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

Spike: Artificial intelligence scheduling for Hubble space telescope

Science.gov (United States)

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.

Routine environmental monitoring schedule, calendar year 1997

Energy Technology Data Exchange (ETDEWEB)

Markes, B.M., Westinghouse Hanford

1996-12-10

This document provides the Environmental Restorations Contractor (ERC) and the Project Hanford Management Contractor.(PHMC) a schedule in accordance with the WHC-CM-7-5, Environmental Compliance` and BHI- EE-02, Environmental Requirements, of monitoring and sampling routines for the Near-Field Monitoring (NFM) program during calendar year (CY) 1997. Every attempt will be made to consistently follow this schedule; any deviation from this schedule will be documented by an internal memorandum (DSI) explaining the reason for the deviation. The DSI will be issued by the scheduled performing organization and directed to Near-Field Monitoring. The survey frequencies for particular sites are determined by the technical judgment of Near- Field Monitoring and may depend on the site history, radiological status, use, and general conditions. Additional surveys may be requested at irregular frequencies if conditions warrant. All radioactive wastes sites are scheduled to be surveyed at least annually. Any newly discovered wastes sites not documented by this schedule will be included in the revised schedule for CY 1998. The outside perimeter road surveys of 200 East and West Area and the rail survey from the 300 Area to Columbia Center will be performed in the year 2000 per agreement with Department of Energy. Richland Field Office. This schedule does not discuss staffing needs, nor does it list the monitoring equipment to be used in completing specific routines. Personnel performing routines to meet this schedule shall communicate any need for assistance in completing these routines to Radiological Control management and Near-Field Monitoring. After each routine survey is completed, a copy of the survey record, maps, and data sheets will be forwarded to Near-Field Monitoring. These routine surveys will not be considered complete until this documentation is received. At the end of each month, the ERC and PHMC radiological control organizations shall forward a copy of the Routine

A feasibility study: Selection of a personalized radiotherapy fractionation schedule using spatiotemporal optimization

International Nuclear Information System (INIS)

Kim, Minsun; Stewart, Robert D.; Phillips, Mark H.

2015-01-01

significant increase in tumor BED but the treatment course could be shortened without a loss in tumor BED. The improvement in the tumor mean BED was more pronounced with smaller tumors (p-value = 0.08). Conclusions: Spatiotemporal optimization of patient plans has the potential to significantly improve local tumor control (larger BED/EUD) of patients with a favorable geometry, such as smaller tumors with larger distances between the tumor target and nearby OAR. In patients with a less favorable geometry and for fast growing tumors, plans optimized using spatiotemporal optimization and conventional (spatial-only) optimization are equivalent (negligible differences in tumor BED/EUD). However, spatiotemporal optimization yields shorter treatment courses than conventional spatial-only optimization. Personalized, spatiotemporal optimization of treatment schedules can increase patient convenience and help with the efficient allocation of clinical resources. Spatiotemporal optimization can also help identify a subset of patients that might benefit from nonconventional (large dose per fraction) treatments that are ineligible for the current practice of stereotactic body radiation therapy

Decay-usage scheduling in multiprocessors

NARCIS (Netherlands)

Epema, D.H.J.

1998-01-01

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

Scheduling Diet for Diabetes Mellitus Patients using Genetic Algorithm

Science.gov (United States)

Syahputra, M. F.; Felicia, V.; Rahmat, R. F.; Budiarto, R.

2017-01-01

Diabetes Melitus (DM) is one of metabolic diseases which affects on productivity and lowers the human resources quality. This disease can be controlled by maintaining and regulating balanced and healthy lifestyle especially for daily diet. However, nowadays, there is no system able to help DM patient to get any information of proper diet. Therefore, an approach is required to provide scheduling diet every day in a week with appropriate nutrition for DM patients to help them regulate their daily diet for healing this disease. In this research, we calculate the number of caloric needs using Harris-Benedict equation and propose genetic algorithm for scheduling diet for DM patient. The results show that the greater the number of individuals, the greater the more the possibility of changes in fitness score approaches the best fitness score. Moreover, the greater the created generation, the more the opportunites to obtain best individual with fitness score approaching 0 or equal to 0.

Quality-aware scheduling for key-value data stores

CERN Document Server

Xu, Chen

2015-01-01

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

Schedulability Analysis for Java Finalizers

DEFF Research Database (Denmark)

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

2010-01-01

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

Nonblocking Scheduling for Web Service Transactions

DEFF Research Database (Denmark)

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

2007-01-01

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

Flexible Work Schedules. ERIC Digest.

Science.gov (United States)

Kerka, Sandra

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

Toward an Autonomous Telescope Network: the TBT Scheduler

Science.gov (United States)

Racero, E.; Ibarra, A.; Ocaña, F.; de Lis, S. B.; Ponz, J. D.; Castillo, M.; Sánchez-Portal, M.

2015-09-01

Within the ESA SSA program, it is foreseen to deploy several robotic telescopes to provide surveillance and tracking services for hazardous objects. The TBT project will procure a validation platform for an autonomous optical observing system in a realistic scenario, consisting of two telescopes located in Spain and Australia, to collect representative test data for precursor SSA services. In this context, the planning and scheduling of the night consists of two software modules, the TBT Scheduler, that will allow the manual and autonomous planning of the night, and the control of the real-time response of the system, done by the RTS2 internal scheduler. The TBT Scheduler allocates tasks for both telescopes without human intervention. Every night it takes all the inputs needed and prepares the schedule following some predefined rules. The main purpose of the scheduler is the distribution of the time for follow-up of recently discovered targets and surveys. The TBT Scheduler considers the overall performance of the system, and combine follow-up with a priori survey strategies for both kind of objects. The strategy is defined according to the expected combined performance for both systems the upcoming night (weather, sky brightness, object accessibility and priority). Therefore, TBT Scheduler defines the global approach for the network and relies on the RTS2 internal scheduler for the final detailed distribution of tasks at each sensor.

Modelling altered fractionation schedules

International Nuclear Information System (INIS)

Fowler, J.F.

1993-01-01

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

15 CFR 713.4 - Advance declaration requirements for additionally planned production, processing, or consumption...

Science.gov (United States)

2010-01-01

... additionally planned production, processing, or consumption of Schedule 2 chemicals. 713.4 Section 713.4..., processing, or consumption of Schedule 2 chemicals. (a) Declaration requirements for additionally planned activities. (1) You must declare additionally planned production, processing, or consumption of Schedule 2...

Pittsburgh International Airport - Scheduled Passenger Traffic

Data.gov (United States)

Allegheny County / City of Pittsburgh / Western PA Regional Data Center — Here you can find Pittsburgh International Airport’s Monthly Scheduled Traffic Reports. Each of these reports contain a year-over-year (YOY) analysis of scheduled...

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

International Nuclear Information System (INIS)

Vo Ngoc Dieu; Ongsakul, Weerakorn

2009-01-01

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

DAILY SCHEDULING OF SMALL HYDRO POWER PLANTS DISPATCH WITH MODIFIED PARTICLES SWARM OPTIMIZATION

Directory of Open Access Journals (Sweden)

Sinvaldo Rodrigues Moreno

2015-04-01

Full Text Available This paper presents a new approach for short-term hydro power scheduling of reservoirs using an algorithm-based Particle Swarm Optimization (PSO. PSO is a population-based algorithm designed to find good solutions to optimization problems, its characteristics have encouraged its adoption to tackle a variety of problems in different fields. In this paper the authors consider an optimization problem related to a daily scheduling of small hydro power dispatch. The goal is construct a feasible solution that maximize the cascade electricity production, following the environmental constraints and water balance. The paper proposes an improved Particle Swarm Optimization (PSO algorithm, which takes advantage of simplicity and facility of implementation. The algorithm was successfully applied to the optimization of the daily schedule strategies of small hydro power plants, considering maximum water utilization and all constraints related to simultaneous water uses. Extensive computational tests and comparisons with other heuristics methods showed the effectiveness of the proposed approach.

Cloud Service Scheduling Algorithm Research and Optimization

Directory of Open Access Journals (Sweden)

Hongyan Cui

2017-01-01

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

A reduced feedback proportional fair multiuser scheduling scheme

KAUST Repository

Shaqfeh, Mohammad

2011-12-01

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

Where do we stand with fuzzy project scheduling?

CERN Document Server

Bonnal, Pierre; Lacoste, Germain

2004-01-01

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

Departure Queue Prediction for Strategic and Tactical Surface Scheduler Integration

Science.gov (United States)

Zelinski, Shannon; Windhorst, Robert

2016-01-01

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

Job schedulers for Big data processing in Hadoop environment: testing real-life schedulers using benchmark programs

Directory of Open Access Journals (Sweden)

Mohd Usama

2017-11-01

Full Text Available At present, big data is very popular, because it has proved to be much successful in many fields such as social media, E-commerce transactions, etc. Big data describes the tools and technologies needed to capture, manage, store, distribute, and analyze petabyte or larger-sized datasets having different structures with high speed. Big data can be structured, unstructured, or semi structured. Hadoop is an open source framework that is used to process large amounts of data in an inexpensive and efficient way, and job scheduling is a key factor for achieving high performance in big data processing. This paper gives an overview of big data and highlights the problems and challenges in big data. It then highlights Hadoop Distributed File System (HDFS, Hadoop MapReduce, and various parameters that affect the performance of job scheduling algorithms in big data such as Job Tracker, Task Tracker, Name Node, Data Node, etc. The primary purpose of this paper is to present a comparative study of job scheduling algorithms along with their experimental results in Hadoop environment. In addition, this paper describes the advantages, disadvantages, features, and drawbacks of various Hadoop job schedulers such as FIFO, Fair, capacity, Deadline Constraints, Delay, LATE, Resource Aware, etc, and provides a comparative study among these schedulers.

The role of romantic attraction and conflict resolution in predicting shorter and longer relationship maintenance among adolescents.