Application of linear scheduling method (LSM) for nuclear power plant (NPP) construction

International Nuclear Information System (INIS)

Kim, Woojoong; Ryu, Dongsoo; Jung, Youngsoo

2014-01-01

Highlights: • Mixed use of linear scheduling method with traditional CPM is suggested for NPP. • A methodology for selecting promising areas for LSM application is proposed. • A case-study is conducted to validate the proposed LSM selection methodology. • A case-study of reducing NPP construction duration by using LSM is introduced. - Abstract: According to a forecast, global energy demand is expected to increase by 56% from 2010 to 2040 (EIA, 2013). The nuclear power plant construction market is also growing with sharper competition. In nuclear power plant construction, scheduling is one of the most important functions due to its large size and complexity. Therefore, it is crucial to incorporate the ‘distinct characteristics of construction commodities and the complex characteristics of scheduling techniques’ (Jung and Woo, 2004) when selecting appropriate schedule control methods for nuclear power plant construction. However, among various types of construction scheduling techniques, the traditional critical path method (CPM) has been used most frequently in real-world practice. In this context, the purpose of this paper is to examine the viability and effectiveness of linear scheduling method (LSM) applications for specific areas in nuclear power plant construction. In order to identify the criteria for selecting scheduling techniques, the characteristics of CPM and LSM were compared and analyzed first through a literature review. Distinct characteristics of nuclear power plant construction were then explored by using a case project in order to develop a methodology to select effective areas of LSM application to nuclear power plant construction. Finally, promising areas for actual LSM application are suggested based on the proposed evaluation criteria and the case project. Findings and practical implications are discussed for further implementation

Application of linear scheduling method (LSM) for nuclear power plant (NPP) construction

Energy Technology Data Exchange (ETDEWEB)

Kim, Woojoong, E-mail: minidung@nate.com [Central Research Institute, Korea Hydro and Nuclear Power Co., Ltd, Daejeon 305-343 (Korea, Republic of); Ryu, Dongsoo, E-mail: energyboy@khnp.co.kr [Central Research Institute, Korea Hydro and Nuclear Power Co., Ltd, Daejeon 305-343 (Korea, Republic of); Jung, Youngsoo, E-mail: yjung97@mju.ac.kr [College of Architecture, Myongji University, Yongin 449-728 (Korea, Republic of)

2014-04-01

Highlights: • Mixed use of linear scheduling method with traditional CPM is suggested for NPP. • A methodology for selecting promising areas for LSM application is proposed. • A case-study is conducted to validate the proposed LSM selection methodology. • A case-study of reducing NPP construction duration by using LSM is introduced. - Abstract: According to a forecast, global energy demand is expected to increase by 56% from 2010 to 2040 (EIA, 2013). The nuclear power plant construction market is also growing with sharper competition. In nuclear power plant construction, scheduling is one of the most important functions due to its large size and complexity. Therefore, it is crucial to incorporate the ‘distinct characteristics of construction commodities and the complex characteristics of scheduling techniques’ (Jung and Woo, 2004) when selecting appropriate schedule control methods for nuclear power plant construction. However, among various types of construction scheduling techniques, the traditional critical path method (CPM) has been used most frequently in real-world practice. In this context, the purpose of this paper is to examine the viability and effectiveness of linear scheduling method (LSM) applications for specific areas in nuclear power plant construction. In order to identify the criteria for selecting scheduling techniques, the characteristics of CPM and LSM were compared and analyzed first through a literature review. Distinct characteristics of nuclear power plant construction were then explored by using a case project in order to develop a methodology to select effective areas of LSM application to nuclear power plant construction. Finally, promising areas for actual LSM application are suggested based on the proposed evaluation criteria and the case project. Findings and practical implications are discussed for further implementation.

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.

An Application-Level QoS Control Method Based on Local Bandwidth Scheduling

Directory of Open Access Journals (Sweden)

Yong Wang

2018-01-01

Full Text Available Quality of service (QoS is an important performance indicator for Web applications and bandwidth is a key factor affecting QoS. Current methods use network protocols or ports to schedule bandwidth, which require tedious manual configurations or modifications of the underlying network. Some applications use dynamic ports and the traditional port-based bandwidth control methods cannot deal with them. A new QoS control method based on local bandwidth scheduling is proposed, which can schedule bandwidth at application level in a user-transparent way and it does not require tedious manual configurations. Experimental results indicate that the new method can effectively improve the QoS for applications, and it can be easily integrated into current Web applications without the need to modify the underlying network.

The accelerated hepatitis B virus vaccination schedule among hemodialysis patients, does it work? A randomized controlled trial.

Science.gov (United States)

Imam, Mahmoud Hamada

2017-12-01

Hemodialysis patients possess particular attributes which increase the susceptibility to hepatitis B virus (HBV) infections. HBV vaccination significantly decreased the number of new HBV-infected patients. However, the conventional vaccination schedule requires a 6-months duration. This study aimed to examine the efficacy the accelerated vaccination schedule among hemodialysis patients. In this study, 202 consecutive hemodialysis patients at New Jeddah hospital were enrolled. The inclusion criteria were: (1) age was above 18 years, (2) all patients had undetectable HBV surface antigen and antibody. Exclusion criteria included: (1) patient had a positive serum HBV surface antigen and antibody using enzyme-linked immunosorbent assay; (2) patient received a previous course of HBV vaccine, (3) patient who was pregnant. Patients were sequentially randomized to receive either Hepatitis B recombinant DNA vaccine (conventional schedule) or to receive combined hepatitis A and B vaccine injection (accelerated schedule). Testing for HBV surface antibodies was done one and three months after completion of the dosage schedule. The primary outcome was the proportion of seroprotection (defined by serum HBV surface antibodies ≥ 10 mIU/ml). Adverse reactions were evaluated regarding both fever and post-injection pain scale. Patients' age ranged from 18 to 71 years.After 1 and 3 months of completion of the vaccination schedule, there was no statistical difference in the proportion of seroprotected patients among both groups. Accelerated vaccination schedule using combined hepatitis A and B vaccine may be beneficial for HBV seroprotection among hemodialysis patients.

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.

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 Method of Flow-Shop Re-Scheduling Dealing with Variation of Productive Capacity

Directory of Open Access Journals (Sweden)

Kenzo KURIHARA

2005-02-01

Full Text Available We can make optimum scheduling results using various methods that are proposed by many researchers. However, it is very difficult to process the works on time without delaying the schedule. There are two major causes that disturb the planned optimum schedules; they are (1the variation of productive capacity, and (2the variation of products' quantities themselves. In this paper, we deal with the former variation, or productive capacities, at flow-shop works. When production machines in a shop go out of order at flow-shops, we cannot continue to operate the productions and we have to stop the production line. To the contrary, we can continue to operate the shops even if some workers absent themselves. Of course, in this case, the production capacities become lower, because workers need to move from a machine to another to overcome the shortage of workers and some shops cannot be operated because of the worker shortage. We developed a new re-scheduling method based on Branch-and Bound method. We proposed an equation for calculating the lower bound for our Branch-and Bound method in a practical time. Some evaluation experiments are done using practical data of real flow-shop works. We compared our results with those of another simple scheduling method, and we confirmed the total production time of our result is shorter than that of another method by 4%.

Efficient operation scheduling for adsorption chillers using predictive optimization-based control methods

Science.gov (United States)

Bürger, Adrian; Sawant, Parantapa; Bohlayer, Markus; Altmann-Dieses, Angelika; Braun, Marco; Diehl, Moritz

2017-10-01

Within this work, the benefits of using predictive control methods for the operation of Adsorption Cooling Machines (ACMs) are shown on a simulation study. Since the internal control decisions of series-manufactured ACMs often cannot be influenced, the work focuses on optimized scheduling of an ACM considering its internal functioning as well as forecasts for load and driving energy occurrence. For illustration, an assumed solar thermal climate system is introduced and a system model suitable for use within gradient-based optimization methods is developed. The results of a system simulation using a conventional scheme for ACM scheduling are compared to the results of a predictive, optimization-based scheduling approach for the same exemplary scenario of load and driving energy occurrence. The benefits of the latter approach are shown and future actions for application of these methods for system control are addressed.

Segment scheduling method for reducing 360° video streaming latency

Science.gov (United States)

Gudumasu, Srinivas; Asbun, Eduardo; He, Yong; Ye, Yan

2017-09-01

360° video is an emerging new format in the media industry enabled by the growing availability of virtual reality devices. It provides the viewer a new sense of presence and immersion. Compared to conventional rectilinear video (2D or 3D), 360° video poses a new and difficult set of engineering challenges on video processing and delivery. Enabling comfortable and immersive user experience requires very high video quality and very low latency, while the large video file size poses a challenge to delivering 360° video in a quality manner at scale. Conventionally, 360° video represented in equirectangular or other projection formats can be encoded as a single standards-compliant bitstream using existing video codecs such as H.264/AVC or H.265/HEVC. Such method usually needs very high bandwidth to provide an immersive user experience. While at the client side, much of such high bandwidth and the computational power used to decode the video are wasted because the user only watches a small portion (i.e., viewport) of the entire picture. Viewport dependent 360°video processing and delivery approaches spend more bandwidth on the viewport than on non-viewports and are therefore able to reduce the overall transmission bandwidth. This paper proposes a dual buffer segment scheduling algorithm for viewport adaptive streaming methods to reduce latency when switching between high quality viewports in 360° video streaming. The approach decouples the scheduling of viewport segments and non-viewport segments to ensure the viewport segment requested matches the latest user head orientation. A base layer buffer stores all lower quality segments, and a viewport buffer stores high quality viewport segments corresponding to the most recent viewer's head orientation. The scheduling scheme determines viewport requesting time based on the buffer status and the head orientation. This paper also discusses how to deploy the proposed scheduling design for various viewport adaptive video

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

Measuring prostate-specific quality of life in prostate cancer patients scheduled for radiotherapy or radical prostatectomy and reference men in Germany and Canada using the Patient Oriented Prostate Utility Scale-Psychometric (PORPUS-P

Directory of Open Access Journals (Sweden)

Kuechler Thomas

2009-08-01

Full Text Available Abstract Background The PORPUS-P is a short questionnaire for measuring prostate-specific quality of life (QoL, which was designed in Canada for use in prostate cancer (PC patients. We aimed to generate a German version and compare PORPUS-P scores of German reference men from the general population, and German and Canadian patients with newly diagnosed PC who were scheduled to receive radical prostatectomy (RP or radiotherapy (RT. Methods The study sample consisted of 988 reference men, 121 German and 66 Canadian PC patients scheduled for RT, and 371 German and 68 Canadian PC patients scheduled for RP. All men completed the PORPUS-P (German postal questionnaire, Canada personal interview. Data were gathered from PC patients before the start of therapy. Results Canadian patients were better educated than the German patients, and fewer were retired. Patients scheduled to receive RT were older and more were retired. German RT patients had lower D'Amico risk scores and pre-treatment Gleason scores than RP patients, and Canadian RT patients had higher pre-treatment PSA than RP patients. Urinary and sexual dysfunction were seen in PC patients (especially RT patients, but were also common in the German reference men. Crude mean PORPUS-P scores differed statistically significant between German RT and RP and Canadian RP and RT patients, with RT patients having higher QoL scores. The differences in age-adjusted mean PORPUS-P scores between reference men and RP patients were not clinically significant, while RT patients had (clinically significantly lower scores than the reference men. Conclusion The German translation of the PORPUS-P appears to be a short and feasible tool for assessing prostate-specific QoL. Although we found a similar response pattern, Canadian and German PC patients scheduled to receive RT or RP rated their pre-treatment quality of life on different levels, which reveals the need for national reference data. Problems in several Qo

DLTAP: A Network-efficient Scheduling Method for Distributed Deep Learning Workload in Containerized Cluster Environment

Directory of Open Access Journals (Sweden)

Qiao Wei

2017-01-01

Full Text Available Deep neural networks (DNNs have recently yielded strong results on a range of applications. Training these DNNs using a cluster of commodity machines is a promising approach since training is time consuming and compute-intensive. Furthermore, putting DNN tasks into containers of clusters would enable broader and easier deployment of DNN-based algorithms. Toward this end, this paper addresses the problem of scheduling DNN tasks in the containerized cluster environment. Efficiently scheduling data-parallel computation jobs like DNN over containerized clusters is critical for job performance, system throughput, and resource utilization. It becomes even more challenging with the complex workloads. We propose a scheduling method called Deep Learning Task Allocation Priority (DLTAP which performs scheduling decisions in a distributed manner, and each of scheduling decisions takes aggregation degree of parameter sever task and worker task into account, in particularly, to reduce cross-node network transmission traffic and, correspondingly, decrease the DNN training time. We evaluate the DLTAP scheduling method using a state-of-the-art distributed DNN training framework on 3 benchmarks. The results show that the proposed method can averagely reduce 12% cross-node network traffic, and decrease the DNN training time even with the cluster of low-end servers.

Prognostic relevance of sunitinib toxicities and comparison of continuous vs. intermittent sunitinib dosing schedule in metastatic renal cell cancer patients

Directory of Open Access Journals (Sweden)

Çetin Ordu

2016-06-01

Full Text Available Aim of the study : Sunitinib-related side effects may develop as a result of the pharmacokinetic pathway affects the of the drug. Material and methods : Data on mRCC patients were obtained from the hospital archives. Outcomes of patients were evaluated in terms of related prognostic factors, sunitinib adverse events during the treatment, and two different sunitinib dosing schedules. Results : Seventy patients diagnosed with mRCC and treated with sunitinib were analyzed for prognostic factors and survival rates. During the mean follow-up of 33.5 months, 38 (54% patients were alive and 32 (46% patients died. The median time of overall survival (OS and progression-free survival (PFS was 27 months (12–61 and 19 months (5–45, respectively. In univariate analysis, good prognostic risk group according to the Memorial Sloan-Kettering Cancer Center (MSKCC, hypothyroidism as sunitinib toxicity and patients on sunitinib treatment more than 1 year were favorable prognostic factors for OS. Leukopenia and fatigue as sunitinib toxicity were poor prognostic factors for OS. PFS and OS of the patients were not significantly different when we compared intermittent (4/2 vs. continuous treatment dosing schedules. Conclusions : As a result of this trial, having hypothyroidism as an adverse effect of sunitinib was a favorable prognostic factor for OS and PFS in mRCC patients. It was also found that 4/2 and continuous dosing schedules of sunitinib did not give rise to different outcomes in mRCC patients.

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.

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)

Modified open-access scheduling for new patient evaluations at an academic chronic pain clinic increased patient access to care, but did not materially reduce their mean cancellation rate: A retrospective, observational study.

Science.gov (United States)

Sivanesan, Eellan; Lubarsky, David A; Ranasinghe, Chaturani T; Sarantopoulos, Constantine D; Epstein, Richard H

2017-09-01

To determine if open-access scheduling would reduce the cancellation rate for new patient evaluations in a chronic pain clinic by at least 50%. Retrospective, observational study using electronic health records. Chronic pain clinic of an academic anesthesia department. All patients scheduled for evaluation or follow-up appointments in the chronic pain clinic between April 1, 2014, and December 31, 2015. Open-access scheduling was instituted in April 2015 with appointments offered on a date of the patient's choosing ≥1 business day after calling, with no limit on the daily number of new patients. Mean cancellation rates for new patients were compared between the 12-month baseline period prior to and for 7months after the change, following an intervening 2-month washout period. The method of batch means (by month) and the 2-sided Student t-test were used; Pnew patient mean cancellation rate decreased from a baseline of 35.7% by 4.2% (95% confidence interval [CI] 1.4% to 6.9%; P=0.005); however, this failed to reach the 50% reduction target of 17.8%. Appointment lag time decreased by 4.7days (95% CI 2.3 to 7.0days, Pnew patient group. More new patients were seen within 1week compared to baseline (50.6% versus 19.1%; Pnew patient visits per month increased from 158.5 to 225.0 (P=0.0004). The cancellation rate and appointment lag times did not decrease for established patient visits, as expected because open-access scheduling was not implemented for this group. Access to care for new chronic pain patients improved with modified open-access scheduling. However, their mean cancellation rate only decreased from 35.7% to 31.5%, making this a marginally effective strategy to reduce cancellations. Copyright © 2017 Elsevier Inc. All rights reserved.

Methods of patient warming during abdominal surgery.

Directory of Open Access Journals (Sweden)

Li Shao

Full Text Available BACKGROUND: Keeping abdominal surgery patients warm is common and warming methods are needed in power outages during natural disasters. We aimed to evaluate the efficacy of low-cost, low-power warming methods for maintaining normothermia in abdominal surgery patients. METHODS: Patients (n = 160 scheduled for elective abdominal surgery were included in this prospective clinical study. Five warming methods were applied: heated blood transfusion/fluid infusion vs. unheated; wrapping patients vs. not wrapping; applying moist dressings, heated or not; surgical field rinse heated or not; and applying heating blankets or not. Patients' nasopharyngeal and rectal temperatures were recorded to evaluate warming efficacy. Significant differences were found in mean temperatures of warmed patients compared to those not warmed. RESULTS: When we compared temperatures of abdominal surgery patient groups receiving three specific warming methods with temperatures of control groups not receiving these methods, significant differences were revealed in temperatures maintained during the surgeries between the warmed groups and controls. DISCUSSION: The value of maintaining normothermia in patients undergoing abdominal surgery under general anesthesia is accepted. Three effective economical and practically applicable warming methods are combined body wrapping and heating blanket; combined body wrapping, heated moist dressings, and heating blanket; combined body wrapping, heated moist dressings, and warmed surgical rinse fluid, with or without heating blanket. These methods are practically applicable when low-cost method is indeed needed.

A Column Generation Approach for Solving the Patient Admission Scheduling Problem

DEFF Research Database (Denmark)

Range, Troels Martin; Lusby, Richard Martin; Larsen, Jesper

This paper addresses the Patient Admission Scheduling (PAS) problem. The PAS problem deals with assigning elective patients to beds, satisfying a number of soft and hard constraints. The problem can be seen as part of the functions of hospital management at an operational level. There exists a sm...... to produce new best solutions for ve out of six instances from a publicly available repository....

Time while waiting: patients' experiences of scheduled surgery.

Science.gov (United States)

Carr, Tracey; Teucher, Ulrich C; Casson, Alan G

2014-12-01

Research on patients' experiences of wait time for scheduled surgery has centered predominantly on the relative tolerability of perceived wait time and impacts on quality of life. We explored patients' experiences of time while waiting for three types of surgery with varied wait times--hip or knee replacement, shoulder surgery, and cardiac surgery. Thirty-two patients were recruited by their surgeons. We asked participants about their perceptions of time while waiting in two separate interviews. Using interpretative phenomenological analysis (IPA), we discovered connections between participant suffering, meaningfulness of time, and agency over the waiting period and the lived duration of time experience. Our findings reveal that chronological duration is not necessarily the most relevant consideration in determining the quality of waiting experience. Those findings helped us create a conceptual framework for lived wait time. We suggest that clinicians and policy makers consider the complexity of wait time experience to enhance preoperative patient care. © The Author(s) 2014.

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

Optimal Intermittent Dose Schedules for Chemotherapy Using Genetic Algorithm

Directory of Open Access Journals (Sweden)

Nadia ALAM

2013-08-01

Full Text Available In this paper, a design method for optimal cancer chemotherapy schedules via genetic algorithm (GA is presented. The design targets the key objective of chemotherapy to minimize the size of cancer tumor after a predefined time with keeping toxic side effects in limit. This is a difficult target to achieve using conventional clinical methods due to poor therapeutic indices of existing anti-cancer drugs. Moreover, there are clinical limitations in treatment administration to maintain continuous treatment. Besides, carefully decided rest periods are recommended to for patient’s comfort. Three intermittent drug scheduling schemes are presented in this paper where GA is used to optimize the dose quantities and timings by satisfying several treatment constraints. All three schemes are found to be effective in total elimination of cancer tumor after an agreed treatment length. The number of cancer cells is found zero at the end of the treatment for all three cases with tolerable toxicity. Finally, two of the schemes, “Fixed interval variable dose (FIVD and “Periodic dose” that are periodic in characteristic have been emphasized due to their additional simplicity in administration along with friendliness to patients. responses to the designed treatment schedules. Therefore the proposed design method is capable of planning effective, simple, patient friendly and acceptable chemotherapy schedules.

Developing a new method for modifying over-allocated multi-mode resource constraint schedules in the presence of preemptive resources

Directory of Open Access Journals (Sweden)

Aidin Delgoshaei

2016-09-01

Full Text Available The issue of resource over-allocating is a big concern for project engineers in the process of scheduling project activities. Resource over-allocating is frequently seen after initial scheduling of a project in practice and causes significant amount of efforts to modify the initial schedules. In this research, a new method is developed for modifying over-allocated schedules in a multi-mode resource constrained project scheduling problems (MRCPSPs with positive cash flows (MRCPSP-PCF. The aim is to maximize profit of the MRCPSPs or logically minimizing costs. The proposed method can be used as a macro in Microsoft Office Project® Software to modify resource over-allocated days after scheduling a project. This research considers progress payment method and preemptive resources. The proposed approach maximizes profit by scheduling activities through the resource calendar respecting to the available level of preemptive resources and activity numbers. To examine the performance of the proposed method a number of experiments derived from the literature are solved. The results are then compared with the circumstances where resource constraints are relaxed. The outcomes show that in all studied cases, the proposed algorithm can provide modified schedules with no over-allocated days. Afterward the method is applied to modify a manufacturing project in practice.

Heuristic Method for Decision-Making in Common Scheduling Problems

Directory of Open Access Journals (Sweden)

Edyta Kucharska

2017-10-01

Full Text Available The aim of the paper is to present a heuristic method for decision-making regarding an NP-hard scheduling problem with limitations related to tasks and the resources dependent on the current state of the process. The presented approach is based on the algebraic-logical meta-model (ALMM, which enables making collective decisions in successive process stages, not separately for individual objects or executors. Moreover, taking into account the limitations of the problem, it involves constructing only an acceptable solution and significantly reduces the amount of calculations. A general algorithm based on the presented method is composed of the following elements: preliminary analysis of the problem, techniques for the choice of decision at a given state, the pruning non-perspective trajectory, selection technique of the initial state for the trajectory final part, and the trajectory generation parameters modification. The paper includes applications of the presented approach to scheduling problems on unrelated parallel machines with a deadline and machine setup time dependent on the process state, where the relationship between tasks is defined by the graph. The article also presents the results of computational experiments.

A Simple Method for Dynamic Scheduling in a Heterogeneous Computing System

OpenAIRE

Žumer, Viljem; Brest, Janez

2002-01-01

A simple method for the dynamic scheduling on a heterogeneous computing system is proposed in this paper. It was implemented to minimize the parallel program execution time. The proposed method decomposes the program workload into computationally homogeneous subtasks, which may be of the different size, depending on the current load of each machine in a heterogeneous computing system.

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.

Scheduling elective surgeries: the tradeoff among bed capacity, waiting patients and operating room utilization using goal programming.

Science.gov (United States)

Li, Xiangyong; Rafaliya, N; Baki, M Fazle; Chaouch, Ben A

2017-03-01

Scheduling of surgeries in the operating rooms under limited competing resources such as surgical and nursing staff, anesthesiologist, medical equipment, and recovery beds in surgical wards is a complicated process. A well-designed schedule should be concerned with the welfare of the entire system by allocating the available resources in an efficient and effective manner. In this paper, we develop an integer linear programming model in a manner useful for multiple goals for optimally scheduling elective surgeries based on the availability of surgeons and operating rooms over a time horizon. In particular, the model is concerned with the minimization of the following important goals: (1) the anticipated number of patients waiting for service; (2) the underutilization of operating room time; (3) the maximum expected number of patients in the recovery unit; and (4) the expected range (the difference between maximum and minimum expected number) of patients in the recovery unit. We develop two goal programming (GP) models: lexicographic GP model and weighted GP model. The lexicographic GP model schedules operating rooms when various preemptive priority levels are given to these four goals. A numerical study is conducted to illustrate the optimal master-surgery schedule obtained from the models. The numerical results demonstrate that when the available number of surgeons and operating rooms is known without error over the planning horizon, the proposed models can produce good schedules and priority levels and preference weights of four goals affect the resulting schedules. The results quantify the tradeoffs that must take place as the preemptive-weights of the four goals are changed.

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

International Nuclear Information System (INIS)

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

1999-01-01

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

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

Clinical outcome of an alternative fotemustine schedule in elderly patients with recurrent glioblastoma: a mono-institutional retrospective study.

Science.gov (United States)

Lombardi, Giuseppe; Bellu, Luisa; Pambuku, Ardi; Della Puppa, Alessandro; Fiduccia, Pasquale; Farina, Miriam; D'Avella, Domenico; Zagonel, Vittorina

2016-07-01

The optimal treatment of recurrent glioblastoma (GBM) in elderly patients is unclear. Fotemustine (FTM) is a third-generation nitrosourea showing efficacy in gliomas and it has been used with different schedules in adult patients. We performed, for the first time anywhere, a mono-institutional retrospective study to analyze the clinical outcome of an alternative fotemustine schedule in elderly patients with recurrent GBM. Retrospectively, we analyzed all GBM patients 65 years or older previously treated with the combination of radiation therapy and temozolomide (TMZ), receiving an alternative FTM schedule as second-line treatment at our Oncological Center from October 2011 to October 2014 with an ECOG PS ≤ 2. FTM was administrated at 80 mg/m(2) every 2 weeks for five consecutive administrations (induction phase), and then every 4 weeks at 80 mg/m(2) as maintenance. We enrolled 44 patients, 33 males and 11 females; average age was 70 years. ECOG PS was 0-1 in 80 % of the patients. 38 patients relapsed during temozolomide (TMZ) therapy. MGMT methylation status was analyzed in 34 patients and MGMT was methylated in 53 % of the patients. The median progression free survival (PFS) and overall survival (OS) from FTM treatment was 4.1 months (95 % CI 3.1-5.2) and 7 months (95 % CI 5.2-8.4), respectively. Patients with MGMT methylated status and patients who relapsed after completing TMZ therapy had a longer PFS and OS from the beginning of FTM. Thrombocytopenia was the most frequent grade 3-4 haematological toxicity (9 %). The alternative schedule of FTM may be an active and safe treatment for elderly patients with recurrent glioblastoma, especially patients with methylated MGMT and who relapsed after completing temozolomide therapy.

Method and apparatus for scheduling broadcasts in social networks

KAUST Repository

Manzoor, Emaad Ahmed

2016-08-25

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

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

CERN Document Server

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

2014-01-01

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

Borda application of selection planning scheduling method in dock engineering consultants in Central Sulawesi province Indonesia

Directory of Open Access Journals (Sweden)

Siti Fatimah

2015-04-01

Full Text Available The aim of this paper to find out the planning scheduling method that used in dock engineering consultants as a project supervisor dock. This research use qualitative approach to find the most preferred method by engineering consultants, this research was explorative that test and find out the most preferred method. This research showed that dock engineering consultants in Palu City, Central Sulawesi most preferred curve-s method than method such as CPM, PERT, PDM, and Bar Chart. This research can help further research to determine differences and similarities the project planning scheduling method and being basic for The New Dock Engineering Consultans. This research looking for the most preferred method with limited respondents dock engineering consultans in Palu City, Central Sulawesi.

Parallel Branch-and-Bound Methods for the Job Shop Scheduling

DEFF Research Database (Denmark)

Clausen, Jens; Perregaard, Michael

1998-01-01

Job-shop scheduling (JSS) problems are among the more difficult to solve in the class of NP-complete problems. The only successful approach has been branch-and-bound based algorithms, but such algorithms depend heavily on good bound functions. Much work has been done to identify such functions...... for the JSS problem, but with limited success. Even with recent methods, it is still not possible to solve problems substantially larger than 10 machines and 10 jobs. In the current study, we focus on parallel methods for solving JSS problems. We implement two different parallel branch-and-bound algorithms...

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.

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

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.

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

DEFF Research Database (Denmark)

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

2008-01-01

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

Heuristics methods for the flow shop scheduling problem with separated setup times

Directory of Open Access Journals (Sweden)

Marcelo Seido Nagano

2012-06-01

Full Text Available This paper deals with the permutation flow shop scheduling problem with separated machine setup times. As a result of an investigation on the problem characteristics, four heuristics methods are proposed with procedures of the construction sequencing solution by an analogy with the asymmetric traveling salesman problem with the objective of minimizing makespan. Experimental results show that one of the new heuristics methods proposed provide high quality solutions in comparisons with the evaluated methods considered in the literature.

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.

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

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

Science.gov (United States)

Rash, James

2014-01-01

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

Comparing three scheduling methods using BIM models in the Last Planner System

Directory of Open Access Journals (Sweden)

Brioso Xavier

2017-12-01

Full Text Available This article presents strategies for teaching scheduling methods such as takt-time, flowlines, and point-to-point precedence relations (PTPPRs using build­ing information modeling (BIM models in the Last Planner System. This article is the extended version of the article entitled “Teaching Takt-Time, Flowline and Point-to-point Precedence Relations: A Peruvian Case Study,” which has been published in Procedia Engineering (Vol. 196, 2017, pages 666-673. A case study is conducted in final year students of civil engineering at the Pontifical Catholic University of Peru. The mock-up project is an educational building that has high repetitive processes in the struc­tural works phase. First, traditional tools such as Excel spreadsheets and 2D drawings were used to teach produc­tion system design with takt-time, flowlines, and PTPPR. Second, 3D and 4D models with Revit 2016 and Navis­works 2016 were used to integrate the previous schedules with a BIM model and to identify its strengths and weak­nesses. Finally, Vico Office was used for the automation of schedules and comparison of the methods in 4D and 5D. This article describes the lectures, workshops, and simu­lations employed, as well as the feedback from students and researchers. The success of the teaching strategy is reflected in the survey responses from students and the final perceptions of the construction management tools presented.

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

Randomized Phase III Noninferiority Study Comparing Two Radiotherapy Fractionation Schedules in Patients With Low-Risk Prostate Cancer

Science.gov (United States)

Dignam, James J.; Amin, Mahul B.; Bruner, Deborah W.; Low, Daniel; Swanson, Gregory P.; Shah, Amit B.; D’Souza, David P.; Michalski, Jeff M.; Dayes, Ian S.; Seaward, Samantha A.; Hall, William A.; Nguyen, Paul L.; Pisansky, Thomas M.; Faria, Sergio L.; Chen, Yuhchyau; Koontz, Bridget F.; Paulus, Rebecca; Sandler, Howard M.

2016-01-01

Purpose Conventional radiotherapy (C-RT) treatment schedules for patients with prostate cancer typically require 40 to 45 treatments that take place from > 8 to 9 weeks. Preclinical and clinical research suggest that hypofractionation—fewer treatments but at a higher dose per treatment—may produce similar outcomes. This trial was designed to assess whether the efficacy of a hypofractionated radiotherapy (H-RT) treatment schedule is no worse than a C-RT schedule in men with low-risk prostate cancer. Patients and Methods A total of 1,115 men with low-risk prostate cancer were randomly assigned 1:1 to C-RT (73.8 Gy in 41 fractions over 8.2 weeks) or to H-RT (70 Gy in 28 fractions over 5.6 weeks). This trial was designed to establish (with 90% power and an α of .05) that treatment with H-RT results in 5-year disease-free survival (DFS) that is not worse than C-RT by more than 7.65% (H-RT/C-RT hazard ratio [HR] < 1.52). Results A total of 1,092 men were protocol eligible and had follow-up information; 542 patients were assigned to C-RT and 550 to H-RT. Median follow-up was 5.8 years. Baseline characteristics were not different according to treatment assignment. The estimated 5-year DFS was 85.3% (95% CI, 81.9 to 88.1) in the C-RT arm and 86.3% (95% CI, 83.1 to 89.0) in the H-RT arm. The DFS HR was 0.85 (95% CI, 0.64 to 1.14), and the predefined noninferiority criterion that required that DFS outcomes be consistent with HR < 1.52 was met (P < .001). Late grade 2 and 3 GI and genitourinary adverse events were increased (HR, 1.31 to 1.59) in patients who were treated with H-RT. Conclusion In men with low-risk prostate cancer, the efficacy of 70 Gy in 28 fractions over 5.6 weeks is not inferior to 73.8 Gy in 41 fractions over 8.2 weeks, although an increase in late GI/genitourinary adverse events was observed in patients treated with H-RT. PMID:27044935

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.

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

Feasibility, Safety, and Efficacy of an Alternative Schedule of Sunitinib for the Treatment of Patients with Metastatic Renal Cell Carcinoma: A Retrospective Study.

Science.gov (United States)

Buti, Sebastiano; Donini, Maddalena; Bersanelli, Melissa; Gattara, Alessia; Leonardi, Francesco; Passalacqua, Rodolfo

2017-12-01

Standard treatment with sunitinib for patients with metastatic renal cancer provides an 'on-off' schedule (daily administration of a 50-mg capsule for 4 weeks, followed by a 2-week break; consecutive 6-week cycles). We developed an alternative intermittent schedule to reduce the toxicity and symptoms of tumor regrowth during the rest period and to allow prolonged continuation of therapy, maintaining dose intensity. The objective of this study was to provide a retrospective evaluation of the feasibility, safety, and efficacy of an alternative schedule of sunitinib in patients who did not tolerate classical treatment. Patients treated with the classical schedule with at least grade 2 toxicity or recurrence of symptoms during the rest period were switched to an alternative schedule (the same daily dose 5 consecutive days per week for 5 weeks and then the same daily dose on days 1, 3, and 5 in the sixth week; consecutive 6-week cycles). Twenty-five patients were enrolled. The median time from sunitinib initiation to schedule switch was 2.9 months. After the switch, the median therapy duration was 9.2 months. Rate of delay, corrected by cycle number, was 10% for both schedules. After the switch, 48.7% of patients obtained a toxicity reduction (hypertension -82%, stomatitis -71%, cutaneous toxicity -69%). A reduction in 'on-off symptoms' (-86%) was achieved. Overall response rate was 40% and the disease control rate was 80%. Median progression-free survival was 16.4 months and median overall survival was 41.3 months. Despite the small sample size and retrospective nature, we demonstrated the feasibility, safety, and efficacy of the alternative schedule, allowing prolonged treatment and better quality of life.

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.

A New Model for Predicting Acute Mucosal Toxicity in Head-and-Neck Cancer Patients Undergoing Radiotherapy With Altered Schedules

International Nuclear Information System (INIS)

Strigari, Lidia; Pedicini, Piernicola; D’Andrea, Marco; Pinnarò, Paola; Marucci, Laura; Giordano, Carolina; Benassi, Marcello

2012-01-01

Purpose: One of the worst radiation-induced acute effects in treating head-and-neck (HN) cancer is grade 3 or higher acute (oral and pharyngeal) mucosal toxicity (AMT), caused by the killing/depletion of mucosa cells. Here we aim to testing a predictive model of the AMT in HN cancer patients receiving different radiotherapy schedules. Methods and Materials: Various radiotherapeutic schedules have been reviewed and classified as tolerable or intolerable based on AMT severity. A modified normal tissue complication probability (NTCP) model has been investigated to describe AMT data in radiotherapy regimens, both conventional and altered in dose and overall treatment time (OTT). We tested the hypothesis that such a model could also be applied to identify intolerable treatment and to predict AMT. This AMT NTCP model has been compared with other published predictive models to identify schedules that are either tolerable or intolerable. The area under the curve (AUC) was calculated for all models, assuming treatment tolerance as the gold standard. The correlation between AMT and the predicted toxicity rate was assessed by a Pearson correlation test. Results: The AMT NTCP model was able to distinguish between acceptable and intolerable schedules among the data available for the study (AUC = 0.84, 95% confidence interval = 0.75-0.92). In the equivalent dose at 2 Gy/fraction (EQD2) vs OTT space, the proposed model shows a trend similar to that of models proposed by other authors, but was superior in detecting some intolerable schedules. Moreover, it was able to predict the incidence of ≥G3 AMT. Conclusion: The proposed model is able to predict ≥G3 AMT after HN cancer radiotherapy, and could be useful for designing altered/hypofractionated schedules to reduce the incidence of AMT.

A fast method for the unit scheduling problem with significant renewable power generation

International Nuclear Information System (INIS)

Osório, G.J.; Lujano-Rojas, J.M.; Matias, J.C.O.; Catalão, J.P.S.

2015-01-01

Highlights: • A model to the scheduling of power systems with significant renewable power generation is provided. • A new methodology that takes information from the analysis of each scenario separately is proposed. • Based on a probabilistic analysis, unit scheduling and corresponding economic dispatch are estimated. • A comparison with others methodologies is in favour of the proposed approach. - Abstract: Optimal operation of power systems with high integration of renewable power sources has become difficult as a consequence of the random nature of some sources like wind energy and photovoltaic energy. Nowadays, this problem is solved using Monte Carlo Simulation (MCS) approach, which allows considering important statistical characteristics of wind and solar power production such as the correlation between consecutive observations, the diurnal profile of the forecasted power production, and the forecasting error. However, MCS method requires the analysis of a representative amount of trials, which is an intensive calculation task that increases considerably with the number of scenarios considered. In this paper, a model to the scheduling of power systems with significant renewable power generation based on scenario generation/reduction method, which establishes a proportional relationship between the number of scenarios and the computational time required to analyse them, is proposed. The methodology takes information from the analysis of each scenario separately to determine the probabilistic behaviour of each generator at each hour in the scheduling problem. Then, considering a determined significance level, the units to be committed are selected and the load dispatch is determined. The proposed technique was illustrated through a case study and the comparison with stochastic programming approach was carried out, concluding that the proposed methodology can provide an acceptable solution in a reduced computational time

Approximate dynamic programming approaches for appointment scheduling with patient preferences.

Science.gov (United States)

Li, Xin; Wang, Jin; Fung, Richard Y K

2018-04-01

During the appointment booking process in out-patient departments, the level of patient satisfaction can be affected by whether or not their preferences can be met, including the choice of physicians and preferred time slot. In addition, because the appointments are sequential, considering future possible requests is also necessary for a successful appointment system. This paper proposes a Markov decision process model for optimizing the scheduling of sequential appointments with patient preferences. In contrast to existing models, the evaluation of a booking decision in this model focuses on the extent to which preferences are satisfied. Characteristics of the model are analysed to develop a system for formulating booking policies. Based on these characteristics, two types of approximate dynamic programming algorithms are developed to avoid the curse of dimensionality. Experimental results suggest directions for further fine-tuning of the model, as well as improving the efficiency of the two proposed algorithms. Copyright © 2018 Elsevier B.V. All rights reserved.

A QUADTREE ORGANIZATION CONSTRUCTION AND SCHEDULING METHOD FOR URBAN 3D MODEL BASED ON WEIGHT

OpenAIRE

C. Yao; G. Peng; Y. Song; M. Duan

2017-01-01

The increasement of Urban 3D model precision and data quantity puts forward higher requirements for real-time rendering of digital city model. Improving the organization, management and scheduling of 3D model data in 3D digital city can improve the rendering effect and efficiency. This paper takes the complexity of urban models into account, proposes a Quadtree construction and scheduling rendering method for Urban 3D model based on weight. Divide Urban 3D model into different rendering weigh...

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.

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

COMPARISON BETWEEN MIXED INTEGER PROGRAMMING WITH HEURISTIC METHOD FOR JOB SHOP SCHEDULING WITH SEPARABLE SEQUENCE-DEPENDENT SETUPS

Directory of Open Access Journals (Sweden)

I Gede Agus Widyadana

2001-01-01

Full Text Available The decisions to choose appropriate tools for solving industrial problems are not just tools that achieve optimal solution only but it should consider computation time too. One of industrial problems that still difficult to achieve both criteria is scheduling problem. This paper discuss comparison between mixed integer programming which result optimal solution and heuristic method to solve job shop scheduling problem with separable sequence-dependent setup. The problems are generated and the result shows that the heuristic methods still cannot satisfy optimal solution.

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.

Optimized Treatment Schedules for Chronic Myeloid Leukemia.

Directory of Open Access Journals (Sweden)

Qie He

2016-10-01

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

An exact approach for relating recovering surgical patient workload to the master surgical schedule

NARCIS (Netherlands)

Vanberkel, P.T.; Boucherie, Richardus J.; Hans, Elias W.; Hurink, Johann L.; van Lent, Wineke A.M.; van Lent, W.A.M.; van Harten, Wim H.; van Harten, Willem H.

2009-01-01

No other department influences the workload of a hospital more than the Department of Surgery and in particular, the activities in the operating room. These activities are governed by the master surgical schedule (MSS), which states which patient types receive surgery on which day. In this paper we

An exact approach for relating recovering surgical patient workload to the master surgical schedule

NARCIS (Netherlands)

Vanberkel, P.T.; Boucherie, Richardus J.; Hans, Elias W.; Hurink, Johann L.; van Lent, W.A.M.; van Harten, Willem H.

2011-01-01

No other department influences the workload of a hospital more than the Department of Surgery and in particular, the activities in the operating room. These activities are governed by the master surgical schedule (MSS), which states which patient types receive surgery on which day. In this paper, we

An improved quantum-behaved particle swarm optimization method for short-term combined economic emission hydrothermal scheduling

Energy Technology Data Exchange (ETDEWEB)

Lu, Songfeng; Sun, Chengfu; Lu, Zhengding [School of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan 430074 (China)

2010-03-15

This paper presents a modified quantum-behaved particle swarm optimization (QPSO) for short-term combined economic emission scheduling (CEES) of hydrothermal power systems with several equality and inequality constraints. The hydrothermal scheduling is formulated as a bi-objective problem: (i) minimizing fuel cost and (ii) minimizing pollutant emission. The bi-objective problem is converted into a single objective one by price penalty factor. The proposed method, denoted as QPSO-DM, combines the QPSO algorithm with differential mutation operation to enhance the global search ability. In this study, heuristic strategies are proposed to handle the equality constraints especially water dynamic balance constraints and active power balance constraints. A feasibility-based selection technique is also employed to meet the reservoir storage volumes constraints. To show the efficiency of the proposed method, different case studies are carried out and QPSO-DM is compared with the differential evolution (DE), the particle swarm optimization (PSO) with same heuristic strategies in terms of the solution quality, robustness and convergence property. The simulation results show that the proposed method is capable of yielding higher-quality solutions stably and efficiently in the short-term hydrothermal scheduling than any other tested optimization algorithms. (author)

An improved quantum-behaved particle swarm optimization method for short-term combined economic emission hydrothermal scheduling

Energy Technology Data Exchange (ETDEWEB)

Lu Songfeng [School of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan 430074 (China); Sun Chengfu, E-mail: ajason_369@sina.co [School of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan 430074 (China); Lu Zhengding [School of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan 430074 (China)

2010-03-15

This paper presents a modified quantum-behaved particle swarm optimization (QPSO) for short-term combined economic emission scheduling (CEES) of hydrothermal power systems with several equality and inequality constraints. The hydrothermal scheduling is formulated as a bi-objective problem: (i) minimizing fuel cost and (ii) minimizing pollutant emission. The bi-objective problem is converted into a single objective one by price penalty factor. The proposed method, denoted as QPSO-DM, combines the QPSO algorithm with differential mutation operation to enhance the global search ability. In this study, heuristic strategies are proposed to handle the equality constraints especially water dynamic balance constraints and active power balance constraints. A feasibility-based selection technique is also employed to meet the reservoir storage volumes constraints. To show the efficiency of the proposed method, different case studies are carried out and QPSO-DM is compared with the differential evolution (DE), the particle swarm optimization (PSO) with same heuristic strategies in terms of the solution quality, robustness and convergence property. The simulation results show that the proposed method is capable of yielding higher-quality solutions stably and efficiently in the short-term hydrothermal scheduling than any other tested optimization algorithms.

An improved quantum-behaved particle swarm optimization method for short-term combined economic emission hydrothermal scheduling

International Nuclear Information System (INIS)

Lu Songfeng; Sun Chengfu; Lu Zhengding

2010-01-01

This paper presents a modified quantum-behaved particle swarm optimization (QPSO) for short-term combined economic emission scheduling (CEES) of hydrothermal power systems with several equality and inequality constraints. The hydrothermal scheduling is formulated as a bi-objective problem: (i) minimizing fuel cost and (ii) minimizing pollutant emission. The bi-objective problem is converted into a single objective one by price penalty factor. The proposed method, denoted as QPSO-DM, combines the QPSO algorithm with differential mutation operation to enhance the global search ability. In this study, heuristic strategies are proposed to handle the equality constraints especially water dynamic balance constraints and active power balance constraints. A feasibility-based selection technique is also employed to meet the reservoir storage volumes constraints. To show the efficiency of the proposed method, different case studies are carried out and QPSO-DM is compared with the differential evolution (DE), the particle swarm optimization (PSO) with same heuristic strategies in terms of the solution quality, robustness and convergence property. The simulation results show that the proposed method is capable of yielding higher-quality solutions stably and efficiently in the short-term hydrothermal scheduling than any other tested optimization algorithms.

Scheduling rules to achieve lead-time targets in outpatient appointment systems

OpenAIRE

Sivakumar, Appa Iyer; Nguyen, Thu Ba Thi; Graves, Stephen C

2015-01-01

This paper considers how to schedule appointments for outpatients, for a clinic that is subject to appointment lead-time targets for both new and returning patients. We develop heuristic rules, which are the exact and relaxed appointment scheduling rules, to schedule each new patient appointment (only) in light of uncertainty about future arrivals. The scheduling rules entail two decisions. First, the rules need to determine whether or not a patient's request can be accepted; then, if the req...

An UAV scheduling and planning method for post-disaster survey

Science.gov (United States)

Li, G. Q.; Zhou, X. G.; Yin, J.; Xiao, Q. Y.

2014-11-01

Annually, the extreme climate and special geological environments lead to frequent natural disasters, e.g., earthquakes, floods, etc. The disasters often bring serious casualties and enormous economic losses. Post-disaster surveying is very important for disaster relief and assessment. As the Unmanned Aerial Vehicle (UAV) remote sensing with the advantage of high efficiency, high precision, high flexibility, and low cost, it is widely used in emergency surveying in recent years. As the UAVs used in emergency surveying cannot stop and wait for the happening of the disaster, when the disaster happens the UAVs usually are working at everywhere. In order to improve the emergency surveying efficiency, it is needed to track the UAVs and assign the emergency surveying task for each selected UAV. Therefore, a UAV tracking and scheduling method for post-disaster survey is presented in this paper. In this method, Global Positioning System (GPS), and GSM network are used to track the UAVs; an emergency tracking UAV information database is built in advance by registration, the database at least includes the following information, e.g., the ID of the UAVs, the communication number of the UAVs; when catastrophe happens, the real time location of all UAVs in the database will be gotten using emergency tracking method at first, then the traffic cost time for all UAVs to the disaster region will be calculated based on the UAVs' the real time location and the road network using the nearest services analysis algorithm; the disaster region is subdivided to several emergency surveying regions based on DEM, area, and the population distribution map; the emergency surveying regions are assigned to the appropriated UAV according to shortest cost time rule. The UAVs tracking and scheduling prototype is implemented using SQLServer2008, ArcEnginge 10.1 SDK, Visual Studio 2010 C#, Android, SMS Modem, and Google Maps API.

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

The role of scheduled second TACE in early-stage hepatocellular carcinoma with complete response to initial TACE

Directory of Open Access Journals (Sweden)

Jung Hee Kim

2017-03-01

Full Text Available Background/Aims We investigated the outcomes of early-stage hepatocellular carcinoma (HCC patients who showed a complete response (CR to initial transarterial chemoembolization (TACE, with a focus on the role of scheduled TACE repetition. Methods A total of 178 patients with early-stage HCC who were initially treated with TACE and showed a CR based on the modified Response Evaluation Criteria in Solid Tumors (mRECIST criteria on one month follow-up computed tomography (CT were analyzed. Among them, 90 patients underwent scheduled repetition of TACE in the absence of viable tumor on CT. Results During a median follow-up period of 4.6 years (range: 0.4-8.8 years, mortality was observed in 71 patients (39.9%. The overall recurrence-free and local recurrence-free survival rates at 1 year were 44.4% and 56.2%. In the multivariable model, scheduled repetition of TACE was an independent factor associated with survival (hazard ratio [95% confidence interval]: 0.56 [0.34-0.93], P=0.025. When stratified using Barcelona clinic liver cancer (BCLC stage, scheduled repetition of TACE was associated with a favorable survival rate in BCLC stage A patients, but not in BCLC 0 patients. Conclusions Scheduled repetition of TACE was associated with better survival for early-stage HCC patients showing a CR after initial TACE, especially in BCLC stage A patients.

Price Transparency in Primary Care: Can Patients Learn About Costs When Scheduling an Appointment?

Science.gov (United States)

Saloner, Brendan; Cope, Lisa Clemans; Hempstead, Katherine; Rhodes, Karin V; Polsky, Daniel; Kenney, Genevieve M

2017-07-01

Cost-sharing in health insurance plans creates incentives for patients to shop for lower prices, but it is unknown what price information patients can obtain when scheduling office visits. To determine whether new patients can obtain price information for a primary care visit and identify variation across insurance types, offices, and geographic areas. Simulated patient methodology in which trained interviewers posed as non-elderly adults seeking new patient primary care appointments. Caller insurance type (employer-sponsored insurance [ESI], Marketplace, or uninsured) and plan were experimentally manipulated. Callers who were offered a visit asked for price information. Unadjusted means and regression-adjusted differences by insurance, office types, and geography were calculated. Calls to a representative sample of primary care offices in ten states in 2014: Arkansas, Georgia, Iowa, Illinois, Massachusetts, Montana, New Jersey, Oregon, Pennsylvania, and Texas (N = 7865). Callers recorded whether they were able to obtain a price. If not, they recorded whether they were referred to other sources for price information. Overall, 61.8% of callers with ESI were able to obtain a price, versus 89.2% of uninsured and 47.3% of Marketplace callers (P information was also more readily available in small offices and in counties with high uninsured rates. Among callers not receiving a price, 72.1% of callers with ESI were referred to other sources (billing office or insurance company), versus 25.8% of uninsured and 50.9% of Marketplace callers (P information is often unavailable for privately insured patients seeking primary care visits at the time a visit is scheduled.

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.

The role of titration schedule of topiramate for the development of depression in patients with epilepsy.

Science.gov (United States)

Mula, Marco; Hesdorffer, Dale C; Trimble, Michael; Sander, Josemir W

2009-05-01

To determine whether a fast titration schedule of topiramate (TPM) has different effects on the occurrence of depression, in relation to other risk factors for TPM-induced depression, including history of depression (HxDEP), febrile seizures (FS), and hippocampal sclerosis (HS). Using data from a large case registry of patients prescribed TPM, two models were constructed: Model 1 examined the independent effect of rapid TPM titration after separate adjustment for FS, HxDEP, and HS. Model 2 examined effect of the cooccurrence of rapid titration on the development of depression with each of these risk factors. A total of 423 patients were included (51.8% females), mean age (SD) 35.5 (11.8) years, mean duration of epilepsy of 22.2 (11.5) years. Forty-four patients (10.4%) developed depression during TPM therapy. A rapid TPM titration was associated with 5-fold increased risk of depression that increased to 12.7-fold in the presence of both FS and rapid TPM titration, 23.3-fold in the presence of both HxDEP and rapid TPM titration, and 7.6-fold in the presence of both HS and rapid TPM titration schedule. Our study suggests that a rapid titration schedule is associated with an increased risk of developing depression during TPM therapy. HxDEP and FS are major contraindications to the use of a rapid titration, with a 23.3-fold and 12.7 fold increased risk, respectively.

Effects of gain-scheduling methods in a classical wind turbine controller on wind turbine aeroservoelastic modes and loads

DEFF Research Database (Denmark)

Tibaldi, Carlo; Henriksen, Lars Christian; Hansen, Morten Hartvig

2014-01-01

The eects of dierent gain-scheduling methods for a classical wind turbine controller, operating in full load region, on the wind turbine aeroservoelastic modes and loads are investigated in this work. The dierent techniques are derived looking at the physical problem to take into account the chan......The eects of dierent gain-scheduling methods for a classical wind turbine controller, operating in full load region, on the wind turbine aeroservoelastic modes and loads are investigated in this work. The dierent techniques are derived looking at the physical problem to take into account...

Analysis of the Juvenile Idiopathic Arthritis Immunization Schedule

Directory of Open Access Journals (Sweden)

L. S. Namazova-Baranova

2016-01-01

Full Text Available Background: The connection between vaccination and autoimmune diseases (and rheumatic pathology in particular is still a subject of discussions. When discussing the possibility of vaccinating rheumatic patients we should take into account the ultra high dangers that infectious diseases pose for such patients, including those that can be prevented by vaccination. We should also take into account the experience of using various vaccine types in rheumatic patients, which illustrates of their high safety profile.Objective: Our aim was to study the immunization schedule in children with juvenile idiopathic arthritis.Methods: The evaluation of vaccine history and other anamnestic data in juvenile idiopathic arthritis patients was based on individual medical records (individual child’s card/preventive vaccination certificate, as well as questionnaires filled by mothers.Results: It has been determined that a significant proportion of children with vaccination schedule deviations are juvenile idiopathic arthritis patients. Almost one in four children with a confirmed rheumatic diagnosis has not been immunized against the major vaccine-preventable diseases. In one non-vaccinated group, there was a case of juvenile arthritis onset after recovering from measles. A small number of patient mothers connects the manifestation of rheumatic diseases with vaccination.Conclusion: Violations of vaccination status in JIA patients require corrections according to the results of clinical studies and the recommendations of international experts.

Phase I trial of strictly time-scheduled gemcitabine and cisplatin with concurrent radiotherapy in patients with locally advanced pancreatic cancer

International Nuclear Information System (INIS)

Brunner, Thomas B.; Grabenbauer, Gerhard G.; Klein, Peter; Baum, Ulrich; Papadopoulos, Thomas; Bautz, Werner; Hohenberger, Werner; Sauer, Rolf

2003-01-01

Purpose: Maximal therapeutic gain in xenograft sarcoma and toxicity for jejunal mucosa is time dependent for concurrent gemcitabine and radiotherapy (RT). We used a time-dependent schedule to determine the maximal-tolerated dose and dose-limiting toxicities (DLTs; Grade 4 hematologic or Grade 3 other toxicity). Methods and Materials: Patients with pancreatic cancer (n=33), periampullary carcinoma (n=1), or bile duct cancer (n=2) were treated with 3-day conformal RT with 50.4 Gy (tumor, lymphatics) plus a 5.4-Gy boost. Concurrent cisplatin (20 mg/m 2 /d on Days 1-5 and 29-33) and gemcitabine (initially 600 mg/m 2 , weekly on Fridays 68 h before RT) were administered. Because of DLT, the doses were reduced to 500 mg/m 2 weekly and then 500, 400, or 300 mg/m 2 on Days 2, 5, 26, 33. Results: DLT occurred at all dose levels of gemcitabine >300 mg/m 2 . Fourteen patients were treated at the recommended Phase II dose of gemcitabine (300 mg/m 2 ) without DLT. The response to chemoradiation allowed 10 of 30 initially unresectable patients with primary pancreatic carcinoma to undergo radical surgery, including a complete response in 2 cases. Conclusions: At the recommended Phase II dose, chemoradiation with gemcitabine and cisplatin can be administered safely in pancreatic carcinoma. However, at higher dose levels, toxicity is severe and frequent. Patients with a chance for conversion to resection could benefit from this schedule

Automated medical resident rotation and shift scheduling to ensure quality resident education and patient care.

Science.gov (United States)

Smalley, Hannah K; Keskinocak, Pinar

2016-03-01

At academic teaching hospitals around the country, the majority of clinical care is provided by resident physicians. During their training, medical residents often rotate through various hospitals and/or medical services to maximize their education. Depending on the size of the training program, manually constructing such a rotation schedule can be cumbersome and time consuming. Further, rules governing allowable duty hours for residents have grown more restrictive in recent years (ACGME 2011), making day-to-day shift scheduling of residents more difficult (Connors et al., J Thorac Cardiovasc Surg 137:710-713, 2009; McCoy et al., May Clin Proc 86(3):192, 2011; Willis et al., J Surg Edu 66(4):216-221, 2009). These rules limit lengths of duty periods, allowable duty hours in a week, and rest periods, to name a few. In this paper, we present two integer programming models (IPs) with the goals of (1) creating feasible assignments of residents to rotations over a one-year period, and (2) constructing night and weekend call-shift schedules for the individual rotations. These models capture various duty-hour rules and constraints, provide the ability to test multiple what-if scenarios, and largely automate the process of schedule generation, solving these scheduling problems more effectively and efficiently compared to manual methods. Applying our models on data from a surgical residency program, we highlight the infeasibilities created by increased duty-hour restrictions placed on residents in conjunction with current scheduling paradigms.

Surgical scheduling: a lean approach to process improvement.

Science.gov (United States)

Simon, Ross William; Canacari, Elena G

2014-01-01

A large teaching hospital in the northeast United States had an inefficient, paper-based process for scheduling orthopedic surgery that caused delays and contributed to site/side discrepancies. The hospital's leaders formed a team with the goals of developing a safe, effective, patient-centered, timely, efficient, and accurate orthopedic scheduling process; smoothing the schedule so that block time was allocated more evenly; and ensuring correct site/side. Under the resulting process, real-time patient information is entered into a database during the patient's preoperative visit in the surgeon's office. The team found the new process reduced the occurrence of site/side discrepancies to zero, reduced instances of changing the sequence of orthopedic procedures by 70%, and increased patient satisfaction. Copyright © 2014 AORN, Inc. Published by Elsevier Inc. All rights reserved.

a Quadtree Organization Construction and Scheduling Method for Urban 3d Model Based on Weight

Science.gov (United States)

Yao, C.; Peng, G.; Song, Y.; Duan, M.

2017-09-01

The increasement of Urban 3D model precision and data quantity puts forward higher requirements for real-time rendering of digital city model. Improving the organization, management and scheduling of 3D model data in 3D digital city can improve the rendering effect and efficiency. This paper takes the complexity of urban models into account, proposes a Quadtree construction and scheduling rendering method for Urban 3D model based on weight. Divide Urban 3D model into different rendering weights according to certain rules, perform Quadtree construction and schedule rendering according to different rendering weights. Also proposed an algorithm for extracting bounding box extraction based on model drawing primitives to generate LOD model automatically. Using the algorithm proposed in this paper, developed a 3D urban planning&management software, the practice has showed the algorithm is efficient and feasible, the render frame rate of big scene and small scene are both stable at around 25 frames.

A QUADTREE ORGANIZATION CONSTRUCTION AND SCHEDULING METHOD FOR URBAN 3D MODEL BASED ON WEIGHT

Directory of Open Access Journals (Sweden)

C. Yao

2017-09-01

Full Text Available The increasement of Urban 3D model precision and data quantity puts forward higher requirements for real-time rendering of digital city model. Improving the organization, management and scheduling of 3D model data in 3D digital city can improve the rendering effect and efficiency. This paper takes the complexity of urban models into account, proposes a Quadtree construction and scheduling rendering method for Urban 3D model based on weight. Divide Urban 3D model into different rendering weights according to certain rules, perform Quadtree construction and schedule rendering according to different rendering weights. Also proposed an algorithm for extracting bounding box extraction based on model drawing primitives to generate LOD model automatically. Using the algorithm proposed in this paper, developed a 3D urban planning&management software, the practice has showed the algorithm is efficient and feasible, the render frame rate of big scene and small scene are both stable at around 25 frames.

A Dynamic Resource Scheduling Method Based on Fuzzy Control Theory in Cloud Environment

Directory of Open Access Journals (Sweden)

Zhijia Chen

2015-01-01

Full Text Available The resources in cloud environment have features such as large-scale, diversity, and heterogeneity. Moreover, the user requirements for cloud computing resources are commonly characterized by uncertainty and imprecision. Hereby, to improve the quality of cloud computing service, not merely should the traditional standards such as cost and bandwidth be satisfied, but also particular emphasis should be laid on some extended standards such as system friendliness. This paper proposes a dynamic resource scheduling method based on fuzzy control theory. Firstly, the resource requirements prediction model is established. Then the relationships between resource availability and the resource requirements are concluded. Afterwards fuzzy control theory is adopted to realize a friendly match between user needs and resources availability. Results show that this approach improves the resources scheduling efficiency and the quality of service (QoS of cloud computing.

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

Directory of Open Access Journals (Sweden)

Tian-Soon Lee

2019-01-01

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

Prophylactic treatment with a potent corticosteroid cream ameliorates radiodermatitis, independent of radiation schedule

DEFF Research Database (Denmark)

Ulff, Eva; Maroti, Marianne; Serup, Jörgen

2017-01-01

BACKGROUND AND PURPOSE: The study will test the hypothesis that preventive topical steroid treatment instituted from start of radiotherapy can ameliorate acute radiation dermatitis. Subgroups of increased risk of dermatitis are included. MATERIAL AND METHODS: A double blinded randomized trial...... of acute radiation dermatitis in breast cancer patients treated with adjuvant RT, independent of RT schedule. Preventive application of a potent corticosteroid cream should be used in the routine and instituted at the start of RT....... schedules as well as for anatomical sites, skin type, breast size and BMI. Patients treated the irradiated area during the radiation period and two weeks following cessation of radiation. RESULTS: Patients receiving hypofraction RT developed less skin reactions than those treated with conventional RT...

Patient Safety Activity Under the Social Insurance Medical Fee Schedule in Japan: An Overview of the 2010 Nationwide Survey.

Science.gov (United States)

Hirose, Masahiro; Kawamura, Toshihiko; Igawa, Mikio; Imanaka, Yuichi

2017-11-16

Little is known about patient safety performance under the social insurance medical fee schedule in Japan. The Health Ministry in Japan introduced the preferential patient safety countermeasure fee (PPSCF) to promote patient safety in 2006 and revised the PPSCF system in 2010. This study aims to address the patient safety performance status at hospitals implementing the PPSCF. A nationwide questionnaire survey targeting 2674 hospitals with the PPSCF was performed in 2010 to 2011. The 627 participant hospitals were divided into the following three groups: 178 hospitals implementing PPSCF 1 with 400 beds or more (group A), 286 hospitals implementing PPSCF 1 with 399 beds or fewer (group B), and 163 hospitals implementing PPSCF 2 (group C). The mean numbers (standard errors) of patient safety managers were 1.45 (0.07) in group A, 1.12 (0.04) in group B, and 0.37 (0.12) in group C (P fee schedule in Japan.

Manufacturing Scheduling Using Colored Petri Nets and Reinforcement Learning

Directory of Open Access Journals (Sweden)

Maria Drakaki

2017-02-01

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

Mathematical modeling identifies optimum lapatinib dosing schedules for the treatment of glioblastoma patients.

Directory of Open Access Journals (Sweden)

Shayna Stein

2018-01-01

Full Text Available Human primary glioblastomas (GBM often harbor mutations within the epidermal growth factor receptor (EGFR. Treatment of EGFR-mutant GBM cell lines with the EGFR/HER2 tyrosine kinase inhibitor lapatinib can effectively induce cell death in these models. However, EGFR inhibitors have shown little efficacy in the clinic, partly because of inappropriate dosing. Here, we developed a computational approach to model the in vitro cellular dynamics of the EGFR-mutant cell line SF268 in response to different lapatinib concentrations and dosing schedules. We then used this approach to identify an effective treatment strategy within the clinical toxicity limits of lapatinib, and developed a partial differential equation modeling approach to study the in vivo GBM treatment response by taking into account the heterogeneous and diffusive nature of the disease. Despite the inability of lapatinib to induce tumor regressions with a continuous daily schedule, our modeling approach consistently predicts that continuous dosing remains the best clinically feasible strategy for slowing down tumor growth and lowering overall tumor burden, compared to pulsatile schedules currently known to be tolerated, even when considering drug resistance, reduced lapatinib tumor concentrations due to the blood brain barrier, and the phenotypic switch from proliferative to migratory cell phenotypes that occurs in hypoxic microenvironments. Our mathematical modeling and statistical analysis platform provides a rational method for comparing treatment schedules in search for optimal dosing strategies for glioblastoma and other cancer types.

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

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

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.

Diverse task scheduling for individualized requirements in cloud manufacturing

Science.gov (United States)

Zhou, Longfei; Zhang, Lin; Zhao, Chun; Laili, Yuanjun; Xu, Lida

2018-03-01

Cloud manufacturing (CMfg) has emerged as a new manufacturing paradigm that provides ubiquitous, on-demand manufacturing services to customers through network and CMfg platforms. In CMfg system, task scheduling as an important means of finding suitable services for specific manufacturing tasks plays a key role in enhancing the system performance. Customers' requirements in CMfg are highly individualized, which leads to diverse manufacturing tasks in terms of execution flows and users' preferences. We focus on diverse manufacturing tasks and aim to address their scheduling issue in CMfg. First of all, a mathematical model of task scheduling is built based on analysis of the scheduling process in CMfg. To solve this scheduling problem, we propose a scheduling method aiming for diverse tasks, which enables each service demander to obtain desired manufacturing services. The candidate service sets are generated according to subtask directed graphs. An improved genetic algorithm is applied to searching for optimal task scheduling solutions. The effectiveness of the scheduling method proposed is verified by a case study with individualized customers' requirements. The results indicate that the proposed task scheduling method is able to achieve better performance than some usual algorithms such as simulated annealing and pattern search.

Iron deficiency and preoperative anaemia in patients scheduled for elective hip- and knee arthroplasty - an observational study

DEFF Research Database (Denmark)

Jans, Ø; Nielsen, C S; Khan, N

2018-01-01

BACKGROUND AND OBJECTIVES: Preoperative anaemia is prevalent in elderly patients scheduled for major orthopaedic surgery and is associated with increased transfusion risk and postoperative morbidity. New guidelines recommend preoperative correction of anaemia and iron deficiency in all patients......-five (10·8%) and 243 (27·6%) of the study population were WHO anaemic or had a Hb Transfusion was more common in anaemic vs. non-anaemic patients 43 vs. 13%; (P 13 g/dl 28 vs. 11% (P

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.

A Hyper-Heuristic Ensemble Method for Static Job-Shop Scheduling.

Science.gov (United States)

Hart, Emma; Sim, Kevin

2016-01-01

We describe a new hyper-heuristic method NELLI-GP for solving job-shop scheduling problems (JSSP) that evolves an ensemble of heuristics. The ensemble adopts a divide-and-conquer approach in which each heuristic solves a unique subset of the instance set considered. NELLI-GP extends an existing ensemble method called NELLI by introducing a novel heuristic generator that evolves heuristics composed of linear sequences of dispatching rules: each rule is represented using a tree structure and is itself evolved. Following a training period, the ensemble is shown to outperform both existing dispatching rules and a standard genetic programming algorithm on a large set of new test instances. In addition, it obtains superior results on a set of 210 benchmark problems from the literature when compared to two state-of-the-art hyper-heuristic approaches. Further analysis of the relationship between heuristics in the evolved ensemble and the instances each solves provides new insights into features that might describe similar instances.

Shiftwork Scheduling for the 1990s.

Science.gov (United States)

Coleman, Richard M.

1989-01-01

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

Location-based Scheduling

DEFF Research Database (Denmark)

Andersson, Niclas; Christensen, Knud

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

A Review Of Fault Tolerant Scheduling In Multicore Systems

Directory of Open Access Journals (Sweden)

Shefali Malhotra

2015-05-01

Full Text Available Abstract In this paper we have discussed about various fault tolerant task scheduling algorithm for multi core system based on hardware and software. Hardware based algorithm which is blend of Triple Modulo Redundancy and Double Modulo Redundancy in which Agricultural Vulnerability Factor is considered while deciding the scheduling other than EDF and LLF scheduling algorithms. In most of the real time system the dominant part is shared memory.Low overhead software based fault tolerance approach can be implemented at user-space level so that it does not require any changes at application level. Here redundant multi-threaded processes are used. Using those processes we can detect soft errors and recover from them. This method gives low overhead fast error detection and recovery mechanism. The overhead incurred by this method ranges from 0 to 18 for selected benchmarks. Hybrid Scheduling Method is another scheduling approach for real time systems. Dynamic fault tolerant scheduling gives high feasibility rate whereas task criticality is used to select the type of fault recovery method in order to tolerate the maximum number of faults.

Calcium-phosphate and parathyroid intradialytic profiles: A potential aid for tailoring the dialysate calcium content of patients on different hemodialysis schedules.

Science.gov (United States)

Ferraresi, Martina; Pia, Anna; Guzzo, Gabriella; Vigotti, Federica Neve; Mongilardi, Elena; Nazha, Marta; Aroasio, Emiliano; Gonella, Cinzia; Avagnina, Paolo; Piccoli, Giorgina Barbara

2015-10-01

Severe hyperparathyroidism is a challenge on hemodialysis. The definition of dialysate calcium (Ca) is a pending issue with renewed importance in cases of individualized dialysis schedules and of portable home dialysis machines with low-flow dialysate. Direct measurement of calcium mass transfer is complex and is imprecisely reflected by differences in start-to-end of dialysis Ca levels. The study was performed in a dialysis unit dedicated to home hemodialysis and to critical patients with wide use of daily and tailored schedules. The Ca-phosphate (P)-parathyroid hormone (PTH) profile includes creatinine, urea, total and ionized Ca, albumin, sodium, potassium, P, PTH levels at start, mid, and end of dialysis. "Severe" secondary hyperparathyroidism was defined as PTH > 300 pg/mL for ≥3 months. Four schedules were tested: conventional dialysis (polysulfone dialyzer 1.8-2.1 m(2) ), with dialysate Ca 1.5 or 1.75 mmol/L, NxStage (Ca 1.5 mmol/L), and NxStage plus intradialytic Ca infusion. Dosages of vitamin D, calcium, phosphate binders, and Ca mimetic agents were adjusted monthly. Eighty Ca-P-PTH profiles were collected in 12 patients. Serum phosphate was efficiently reduced by all techniques. No differences in start-to-end PTH and Ca levels on dialysis were observed in patients with PTH levels dialysis on all schedules except on Nxstage (P dialysis, in "severe" secondary hyperparathyroid patients in order to increase the therapeutic potentials of the new dialysis techniques. © 2015 International Society for Hemodialysis.

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.

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

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

Production Planning and Planting Pattern Scheduling Information System for Horticulture

Science.gov (United States)

Vitadiar, Tanhella Zein; Farikhin; Surarso, Bayu

2018-02-01

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

Short-term hydro-thermal scheduling using particle swarm optimization method

International Nuclear Information System (INIS)

Yu, Binghui; Yuan, Xiaohui; Wang, Jinwen

2007-01-01

The approaches based on different particle swarm optimization (PSO) techniques are applied to solve the short-term hydro-thermal scheduling problem. In the proposed methods, many constraints of the hydro-thermal system, such as power balance, water balance, reservoir volume limits and the operation limits of hydro and thermal plants, are considered. The feasibility of the proposed algorithm is demonstrated through an example system, and the results are compared with the results of a genetic algorithm and evolutionary programming approaches. The experimental results show that all the PSO algorithms have the ability to achieve nearly global solutions, but a local version of PSO with inertia weight appears to be the best amongst all the PSOs in terms of high quality solution

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

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

Interoceanic canal excavation scheduling via computer simulation

Energy Technology Data Exchange (ETDEWEB)

Baldonado, Orlino C [Holmes and Narver, Inc., Los Angeles, CA (United States)

1970-05-15

The computer simulation language GPSS/360 was used to simulate the schedule of several nuclear detonation programs for the interoceanic canal project. The effects of using different weather restriction categories due to air blast and fallout were investigated. The effect of increasing the number of emplacement and stemming crews and the effect of varying the reentry period after detonating a row charge or salvo were also studied. Detonation programs were simulated for the proposed Routes 17A and 25E. The study demonstrates the method of using computer simulation so that a schedule and its associated constraints can be assessed for feasibility. Since many simulation runs can be made for a given set of detonation program constraints, one readily obtains an average schedule for a range of conditions. This provides a method for analyzing time-sensitive operations so that time and cost-effective operational schedules can be established. A comparison of the simulated schedules with those that were published shows them to be similar. (author)

Interoceanic canal excavation scheduling via computer simulation

International Nuclear Information System (INIS)

Baldonado, Orlino C.

1970-01-01

The computer simulation language GPSS/360 was used to simulate the schedule of several nuclear detonation programs for the interoceanic canal project. The effects of using different weather restriction categories due to air blast and fallout were investigated. The effect of increasing the number of emplacement and stemming crews and the effect of varying the reentry period after detonating a row charge or salvo were also studied. Detonation programs were simulated for the proposed Routes 17A and 25E. The study demonstrates the method of using computer simulation so that a schedule and its associated constraints can be assessed for feasibility. Since many simulation runs can be made for a given set of detonation program constraints, one readily obtains an average schedule for a range of conditions. This provides a method for analyzing time-sensitive operations so that time and cost-effective operational schedules can be established. A comparison of the simulated schedules with those that were published shows them to be similar. (author)

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.

Developing an efficient scheduling template of a chemotherapy treatment unit: A case study.

Science.gov (United States)

Ahmed, Z; Elmekkawy, Ty; Bates, S

2011-01-01

time of a emergency room.3 A 20---day field observation revealed that the availability of the staff physician and interaction affects the patient wait time. Jyväskylä et al.4 used simulation to test different process scenarios, allocate resources and perform activity---based cost analysis in the Emergency Department (ED) at the Central Hospital. The simulation also supported the study of a new operational method, named "triage-team" method without interrupting the main system. The proposed triage team method categorises the entire patient according to the urgency to see the doctor and allows the patient to complete the necessary test before being seen by the doctor for the first time. The simulation study showed that it will decrease the throughput time of the patient and reduce the utilisation of the specialist and enable the ordering all the tests the patient needs right after arrival, thus quickening the referral to treatment. Santibáñez et al.5 developed a discrete event simulation model of British Columbia Cancer Agency"s ambulatory care unit which was used to study the impact of scenarios considering different operational factors (delay in starting clinic), appointment schedule (appointment order, appointment adjustment, add---ons to the schedule) and resource allocation. It was found that the best outcomes were obtained when not one but multiple changes were implemented simultaneously. Sepúlveda et al.6 studied the M. D. Anderson Cancer Centre Orlando, which is a cancer treatment facility and built a simulation model to analyse and improve flow process and increase capacity in the main facility. Different scenarios were considered like, transferring laboratory and pharmacy areas, adding an extra blood draw room and applying different scheduling techniques of patients. The study shows that by increasing the number of short---term (four hours or less) patients in the morning could increase chair utilisation. Discrete event simulation also helps improve a

Baseline incidence and severity of renal insufficiency evaluated by estimated glomerular filtration rates in patients scheduled for contrast-enhanced CT

International Nuclear Information System (INIS)

Utsunomiya, Daisuke; Yanaga, Yumi; Oda, Seitaro; Namimoto, Tomohiro; Yamashita, Yasuyuki; Awai, Kazuo; Funama, Yoshinori

2011-01-01

Background Although pre-existing renal insufficiency (RI) is the most important risk factor for contrast-induced nephropathy (CIN), the background distribution of baseline renal function has not been investigated thoroughly in patients scheduled for contrast-enhanced CT. Purpose To investigate the incidence and severity of baseline RI evaluated by estimated glomerular filtration rates (eGFR) in patients who underwent contrast-enhanced CT at an academic center. Material and Methods A total of 6586 patients (3630 men and 2956 women; mean age 57.0 ± 11.9 years) who underwent contrast-enhanced CT between January and December 2008 were retrospectively studied. Of these, 829 had cardiovascular diseases (CVD), 5116 had oncologic diseases, 178 had diabetes mellitus (DM), and 1572 had chronic liver disease (CLD). The eGFR (mL/min/1.73 m 2 ) was calculated from their serum creatinine level. Mild, moderate-a, moderate-b, and severe RI were recorded at 60 2 at baseline was high in patients with advanced age, CVD and DM and in patients without oncologic disease

Efficient Academic Scheduling at the U.S. Naval Academy

National Research Council Canada - National Science Library

Zane, David

2003-01-01

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

Automatic scheduling of maintenance work in nuclear power plants

International Nuclear Information System (INIS)

Kasahara, T.; Nishizawa, Y.; Kato, K.; Kiguchi, T.

1987-01-01

An automatic scheduling method for maintenance work in nuclear power plants has been developed using an AI technique. The purpose of this method is to help plant operators by adjusting the time schedule of various kinds of maintenance work so that incorrect ordering or timing of plant manipulations does not cause undersirable results, such as a plant trip. The functions of the method were tested by off-line simulations. The results show that the method can produce a satisfactory schedule of plant component manipulations without interference between the tasks and plant conditions

Clinical and haemodynamic evaluation of chronic thromboembolic pulmonary hypertension patients scheduled for pulmonary thromboendarterectomy: Is schistosomiasis hypertension an important confounding factor?

Directory of Open Access Journals (Sweden)

Mario Terra-Filho

2010-01-01

Full Text Available INTRODUCTION: Chronic thromboembolic pulmonary hypertension is a disease affecting approximately 4,000 people per year in the United States. The incidence rate in Brazil, however, is unknown. The estimated survival for patients with chronic thromboembolic pulmonary hypertension without treatment is approximately three years. Pulmonary thromboendarterectomy for select patients is a potentially curative procedure when correctly applied. In Brazil, the clinical and hemodynamic profiles of chronic thromboembolic pulmonary hypertension patients have yet to be described. OBJECTIVES: To evaluate the clinical and hemodynamic characteristics of chronic thromboembolic pulmonary hypertension patients scheduled for pulmonary thromboendarterectomy in a referral center for chronic thromboembolic pulmonary hypertension treatment in Brazil. METHODS: From December 2006 to November 2009, patients were evaluated and scheduled for pulmonary thromboendarterectomy. The subjects were classified according to gender, age and functional class and were tested for thrombofilia and brain natriuretic peptide levels. RESULTS: Thirty-five consecutive chronic thromboembolic pulmonary hypertension patients were evaluated. Two patients tested positive for schistosomiasis, and 31 were enrolled in the study (19 female, 12 male. The majority of patients were categorized in functional classes III and IV. Hemodynamic data showed a mean pulmonary vascular resistance (PVR of 970.8 ± 494.36 dynas·s·cm-5 and a low cardiac output of 3.378 ± 1.13 L/min. Linear regression revealed a direct relation between cardiac output and pulmonary vascular resistance. Paradoxical septal movement was strongly correlated with pulmonary vascular resistance and cardiac output (p=0.001. Brain natriuretic peptide serum levels were elevated in 19 of 27 patients. CONCLUSIONS: In a referral center for pulmonary hypertension in Brazil, chronic thromboembolic pulmonary hypertension patients evaluated for

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.

Schedulability of Herschel revisited using statistical model checking

DEFF Research Database (Denmark)

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

2015-01-01

-approximation technique. We can safely conclude that the system is schedulable for varying values of BCET. For the cases where deadlines are violated, we use polyhedra to try to confirm the witnesses. Our alternative method to confirm non-schedulability uses statistical model-checking (SMC) to generate counter...... and blocking times of tasks. Consequently, the method may falsely declare deadline violations that will never occur during execution. This paper is a continuation of previous work of the authors in applying extended timed automata model checking (using the tool UPPAAL) to obtain more exact schedulability...... analysis, here in the presence of non-deterministic computation times of tasks given by intervals [BCET,WCET]. Computation intervals with preemptive schedulers make the schedulability analysis of the resulting task model undecidable. Our contribution is to propose a combination of model checking techniques...

Enhancement of the grafting efficiency by the new method of fetal liver-bone marrow scheduled transplantation

International Nuclear Information System (INIS)

Xiang Yingsong; Yang Rujun; Yang Ping; Cai Jianming; Min Rui

2000-01-01

To enhance the grafting efficiency of bone marrow transplantation, lethally Irradiated recipient Kunming mice were transplantation with fetal liver-bone marrow scheduled transplantation. (FL-BMST) The numbers of WBC, nucleated cells were near to normal level 17 d after irradiation in FL-BMST group transplantation with 1 x 10 6 bone marrow cells, the indexes of CFU-E, CFU-GM, CFU-F, CFU-S, were returned to normal; the degree of GVHD in the FL-BMST group was slighter than that in sing bone marrow transplantation group; and the survival rate of mice was 60%, which was significantly higher than that of routine single bone marrow transplantation group. 'Niches' vacated each time could be fully used and be improved, be increased by fetal liver-bone marrow scheduled transplantation, so the homing of stem cells was increased, and the number of transplanted bone marrow cells could be decreased. So this new method was a better method than routine bone singe marrow transplantation

CP Methods for Scheduling and Routing with Time-Dependent Task Costs

DEFF Research Database (Denmark)

Tierney, Kevin; Kelareva, Elena; Kilby, Philip

2013-01-01

a cost function, and Mixed Integer Programming (MIP) are often used for solving such problems. However, Constraint Programming (CP), particularly with Lazy Clause Genera- tion (LCG), has been found to be faster than MIP for some scheduling problems with time-varying action costs. In this paper, we...... compare CP and LCG against a solve-and-improve approach for two recently introduced problems in maritime logistics with time-varying action costs: the Liner Shipping Fleet Repositioning Problem (LSFRP) and the Bulk Port Cargo Throughput Optimisation Problem (BPCTOP). We present a novel CP model...... for the LSFRP, which is faster than all previous methods and outperforms a simplified automated planning model without time-varying costs. We show that a LCG solver is faster for solving the BPCTOP than a standard finite domain CP solver with a simplified model. We find that CP and LCG are effective methods...

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.

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.

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

Hybrid IP/CP Methods for Solving Sports Scheduling Problems

DEFF Research Database (Denmark)

Rasmussen, Rasmus Vinther

2006-01-01

The field of sports scheduling comprises a challenging research areawith a great variety of hard combinatorial optimization problems andchallenging practical applications. This dissertation gives acomprehensive survey of the area and a number of new contributionsare presented. First a general sol...

Schedulability using native non-preemptive groups on an AUTOSAR/OSEK platform

NARCIS (Netherlands)

Hatvani, L.; Bril, R.J.

To combine the relative strengths of fully preemptive and non-preemptive fixed priority scheduling, we can use limited preemptive scheduling methods. One such method is fixed-priority threshold scheduling (FPTS). This approach defines dual priorities for every task, a priority assigned to the

Simulation-based Advance Patient Scheduling of Operating Theatres

DEFF Research Database (Denmark)

Andersen, Anders Reenberg; Stidsen, Thomas Jacob Riis; Nielsen, Bo Friis

2017-01-01

Daily scheduling of surgical operations is a complicated and recurrent problem in the literature on health care optimization. In this study, we present an often overlooked approach to this problem that incorporates a rolling and overlapping planning horizon. The basis of our modeling approach is ...

The Effect of Biologically Effective Dose and Radiation Treatment Schedule on Overall Survival in Stage I Non-Small Cell Lung Cancer Patients Treated With Stereotactic Body Radiation Therapy

Energy Technology Data Exchange (ETDEWEB)

Stahl, John M. [Department of Therapeutic Radiology, Yale School of Medicine, New Haven, Connecticut (United States); Ross, Rudi [21st Century Oncology, Fort Myers, Florida (United States); Harder, Eileen M.; Mancini, Brandon R. [Department of Therapeutic Radiology, Yale School of Medicine, New Haven, Connecticut (United States); Soulos, Pamela R. [Cancer Outcomes, Public Policy and Effectiveness Research (COPPER) Center, Yale School of Medicine, New Haven, Connecticut (United States); Finkelstein, Steven E.; Shafman, Timothy D.; Dosoretz, Arie P. [21st Century Oncology, Fort Myers, Florida (United States); Evans, Suzanne B.; Husain, Zain A.; Yu, James B. [Department of Therapeutic Radiology, Yale School of Medicine, New Haven, Connecticut (United States); Gross, Cary P. [Cancer Outcomes, Public Policy and Effectiveness Research (COPPER) Center, Yale School of Medicine, New Haven, Connecticut (United States); Decker, Roy H., E-mail: roy.decker@yale.edu [Department of Therapeutic Radiology, Yale School of Medicine, New Haven, Connecticut (United States)

2016-12-01

Purpose: To determine the effect of biologically effective dose (BED{sub 10}) and radiation treatment schedule on overall survival (OS) in patients with early-stage non-small cell lung cancer (NSCLC) undergoing stereotactic body radiation therapy (SBRT). Methods and Materials: Using data from 65 treatment centers in the United States, we retrospectively reviewed the records of T1-2 N0 NSCLC patients undergoing SBRT alone from 2006 to 2014. Biologically relevant covariates, including dose per fraction, number of fractions, and time between fractions, were used to quantify BED{sub 10} and radiation treatment schedule. The linear-quadratic equation was used to calculate BED{sub 10} and to generate a dichotomous dose variable of <105 Gy versus ≥105 Gy BED{sub 10}. The primary outcome was OS. We used the Kaplan-Meier method, the log–rank test, and Cox proportional hazards regression with propensity score matching to determine whether prescription BED{sub 10} was associated with OS. Results: We identified 747 patients who met inclusion criteria. The median BED{sub 10} was 132 Gy, and 59 (7.7%) had consecutive-day fractions. Median follow-up was 41 months, and 452 patients (60.5%) had died by the conclusion of the study. The 581 patients receiving ≥105 Gy BED{sub 10} had a median survival of 28 months, whereas the 166 patients receiving <105 Gy BED{sub 10} had a median survival of 22 months (log–rank, P=.01). Radiation treatment schedule was not a significant predictor of OS on univariable analysis. After adjusting for T stage, sex, tumor histology, and Eastern Cooperative Oncology Group performance status, BED{sub 10} ≥105 Gy versus <105 Gy remained significantly associated with improved OS (hazard ratio 0.78, 95% confidence interval 0.62-0.98, P=.03). Propensity score matching on imbalanced variables within high- and low-dose cohorts confirmed a survival benefit with higher prescription dose. Conclusions: We found that dose escalation to 105 Gy BED

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

Purpose: To investigate the impact of using spatiotemporal optimization, i.e., intensity-modulated spatial optimization followed by fractionation schedule optimization, to select the patient-specific fractionation schedule that maximizes the tumor biologically equivalent dose (BED) under dose constraints for multiple organs-at-risk (OARs). Methods: Spatiotemporal optimization was applied to a variety of lung tumors in a phantom geometry using a range of tumor sizes and locations. The optimal fractionation schedule for a patient using the linear-quadratic cell survival model depends on the tumor and OAR sensitivity to fraction size (α/β), the effective tumor doubling time (T d ), and the size and location of tumor target relative to one or more OARs (dose distribution). The authors used a spatiotemporal optimization method to identify the optimal number of fractions N that maximizes the 3D tumor BED distribution for 16 lung phantom cases. The selection of the optimal fractionation schedule used equivalent (30-fraction) OAR constraints for the heart (D mean ≤ 45 Gy), lungs (D mean ≤ 20 Gy), cord (D max ≤ 45 Gy), esophagus (D max ≤ 63 Gy), and unspecified tissues (D 05 ≤ 60 Gy). To assess plan quality, the authors compared the minimum, mean, maximum, and D 95 of tumor BED, as well as the equivalent uniform dose (EUD) for optimized plans to conventional intensity-modulated radiation therapy plans prescribing 60 Gy in 30 fractions. A sensitivity analysis was performed to assess the effects of T d (3–100 days), tumor lag-time (T k = 0–10 days), and the size of tumors on optimal fractionation schedule. Results: Using an α/β ratio of 10 Gy, the average values of tumor max, min, mean BED, and D 95 were up to 19%, 21%, 20%, and 19% larger than those from conventional prescription, depending on T d and T k used. Tumor EUD was up to 17% larger than the conventional prescription. For fast proliferating tumors with T d less than 10 days, there was no

On Coding of Scheduling Information in OFDM

OpenAIRE

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

2009-01-01

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

A real-time Excel-based scheduling solution for nursing staff reallocation.

Science.gov (United States)

Tuominen, Outi Anneli; Lundgren-Laine, Heljä; Kauppila, Wiveka; Hupli, Maija; Salanterä, Sanna

2016-09-30

Aim This article describes the development and testing of an Excel-based scheduling solution for the flexible allocation and reallocation of nurses to cover sudden, unplanned absences among permanent nursing staff. Method A quasi-experimental, one group, pre- and post-test study design was used ( Box 1 ) with total sampling. Participants (n=17) were selected purposefully by including all ward managers (n=8) and assistant ward managers (n=9) from one university hospital department. The number of sudden absences among the nursing staff was identified during two 4-week data collection periods (pre- and post-test). Results During the use of the paper-based scheduling system, 121 absences were identified; during the use of the Excel-based system, 106 were identified. The main reasons for the use of flexible 'floating' nurses were sick leave (n=66) and workload (n=31). Other reasons (n=29) included patient transfer to another hospital, scheduling errors and the start or end of employment. Conclusion The Excel-based scheduling solution offered better support in obtaining substitute labour inside the organisation, with smaller employment costs. It also reduced the number of tasks ward managers had to carry out during the process of reallocating staff.

Discordance between 'actual' and 'scheduled' check-in times at a heart failure clinic.

Science.gov (United States)

Gorodeski, Eiran Z; Joyce, Emer; Gandesbery, Benjamin T; Blackstone, Eugene H; Taylor, David O; Tang, W H Wilson; Starling, Randall C; Hachamovitch, Rory

2017-01-01

A 2015 Institute Of Medicine statement "Transforming Health Care Scheduling and Access: Getting to Now", has increased concerns regarding patient wait times. Although waiting times have been widely studied, little attention has been paid to the role of patient arrival times as a component of this phenomenon. To this end, we investigated patterns of patient arrival at scheduled ambulatory heart failure (HF) clinic appointments and studied its predictors. We hypothesized that patients are more likely to arrive later than scheduled, with progressively later arrivals later in the day. Using a business intelligence database we identified 6,194 unique patients that visited the Cleveland Clinic Main Campus HF clinic between January, 2015 and January, 2017. This clinic served both as a tertiary referral center and a community HF clinic. Transplant and left ventricular assist device (LVAD) visits were excluded. Punctuality was defined as the difference between 'actual' and 'scheduled' check-in times, whereby negative values (i.e., early punctuality) were patients who checked-in early. Contrary to our hypothesis, we found that patients checked-in late only a minority of the time (38% of visits). Additionally, examining punctuality by appointment hour slot we found that patients scheduled after 8AM had progressively earlier check-in times as the day progressed (P < .001 for trend). In both a Random Forest-Regression framework and linear regression models the most important risk-adjusted predictors of early punctuality were: later in the day appointment hour slot, patient having previously been to the hospital, age in the early 70s, and white race. Patients attending a mixed population ambulatory HF clinic check-in earlier than scheduled times, with progressive discrepant intervals throughout the day. This finding may have significant implications for provider utilization and resource planning in order to maximize clinic efficiency. The impact of elective early arrival on

Chemotherapy appointment scheduling under uncertainty using mean-risk stochastic integer programming.

Science.gov (United States)

Alvarado, Michelle; Ntaimo, Lewis

2018-03-01

Oncology clinics are often burdened with scheduling large volumes of cancer patients for chemotherapy treatments under limited resources such as the number of nurses and chairs. These cancer patients require a series of appointments over several weeks or months and the timing of these appointments is critical to the treatment's effectiveness. Additionally, the appointment duration, the acuity levels of each appointment, and the availability of clinic nurses are uncertain. The timing constraints, stochastic parameters, rising treatment costs, and increased demand of outpatient oncology clinic services motivate the need for efficient appointment schedules and clinic operations. In this paper, we develop three mean-risk stochastic integer programming (SIP) models, referred to as SIP-CHEMO, for the problem of scheduling individual chemotherapy patient appointments and resources. These mean-risk models are presented and an algorithm is devised to improve computational speed. Computational results were conducted using a simulation model and results indicate that the risk-averse SIP-CHEMO model with the expected excess mean-risk measure can decrease patient waiting times and nurse overtime when compared to deterministic scheduling algorithms by 42 % and 27 %, respectively.

Nonstandard Work Schedules, Couple Desynchronization, and Parent-Child Interaction : A Mixed-Methods Analysis

NARCIS (Netherlands)

Taeht, Kadri; Mills, Melinda

Many children live in households where either one or both parents work nonstandard schedules in the evening, night, or weekend. This study tests two competing hypotheses of whether nonstandard schedules result in lower levels of parent-child interaction or in more time with children. Using the first

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.

Planning and Scheduling for Fleets of Earth Observing Satellites

Science.gov (United States)

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

2001-01-01

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

Methods and time schedule for follow-up of intracranial aneurysms treated with endovascular embolization: a systematic review.

Science.gov (United States)

Serafin, Zbigniew; Strześniewski, Piotr; Lasek, Władysław; Beuth, Wojciech

2011-01-01

To review the diagnostic value of angiographic methods and the optimal timetable for follow-up imaging of patients after endovascular treatment of intracranial aneurysms. A comprehensive computer-aided search for relevant primary papers was performed using the MEDLINE, PubMed, Embase, and Cochrane Collaboration database from January 1991 to March 2011. Original papers were included that reported either diagnostic value of angiographic modalities for follow-up vs. digital subtracted angiography (DSA) or comparison of aneurysm occlusion rate in delayed vs. early follow-up. The systematic review identified 35 relevant studies: 3 on the diagnostic value of three-dimensional (3D) DSA, 30 on the performance of magnetic resonance angiography (MRA), and 3 on time schedules for follow-up. 3D DSA had sensitivity of 100%, and specificity of 58.3-94.7%. Magnetic resonance angiography had sensitivity of 28.4-100%, and specificity of 50.0-100%. The proportion of aneurysms that recanalized between the early follow-up examination at 6 months and the delayed imaging at 1.5-6.0 years was 0-2.5%. Magnetic resonance angiography seems to be the best imaging method for the follow-up. In selected cases, when invasive angiography is necessary, 3D DSA should be considered to improve the diagnostic accuracy. Most patients who present with stable and adequate aneurysm occlusion at 6 months after coiling may not require further follow-up. Key words: intracranial aneurysm, embolization, coils, digital subtracted angiography, magnetic resonance, computed tomography.

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.

Scheduling Accessory Assists Patients with Cognitive Disorders

Science.gov (United States)

2007-01-01

Recom Technologies Inc. received initial funding from NASA to research the commercial potential of an artificially intelligent planning reaction model to serve as a tool to help individuals suffering from various forms and levels of brain impairment. In 1993, the chief of the Artificial Intelligence Research Branch at Ames Research Center suggested collaborative research with Santa Clara Valley Medical Center. This partnership led to further development of the technology and funding to support clinical research from the U.S. Department of Education's National Institute on Disability and Rehabilitation Research. In 1996, Attention Control Systems Inc. was founded to market the finished device, called the Planning and Execution Assistant and Trainer (PEAT). PEAT is a pocket-sized PDA-like device with a graphical display, touchscreen controls, an electronic calendar, an address book, and a built-in phone, that cues users to start or stop scheduled activities, monitors their progress, and adjusts schedules as necessary in response to delays or calendar changes. It uses an automatic planning model developed for NASA to adjust daily plans when a situation changes. PEAT is sold as a complete system that includes software, hardware, documentation, and technical support. In addition to the flagship Pocket PEAT device, there is PEAT Phone, PC PEAT, and PEAT Link. Clinical studies of PEAT continue at Santa Clara Valley Medical Center

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.

Robust Optimization for Household Load Scheduling with Uncertain Parameters

Directory of Open Access Journals (Sweden)

Jidong Wang

2018-04-01

Full Text Available Home energy management systems (HEMS face many challenges of uncertainty, which have a great impact on the scheduling of home appliances. To handle the uncertain parameters in the household load scheduling problem, this paper uses a robust optimization method to rebuild the household load scheduling model for home energy management. The model proposed in this paper can provide the complete robust schedules for customers while considering the disturbance of uncertain parameters. The complete robust schedules can not only guarantee the customers’ comfort constraints but also cooperatively schedule the electric devices for cost minimization and load shifting. Moreover, it is available for customers to obtain multiple schedules through setting different robust levels while considering the trade-off between the comfort and economy.

Residency Applicants Prefer Online System for Scheduling Interviews

Directory of Open Access Journals (Sweden)

Wills, Charlotte

2015-03-01

Full Text Available Introduction: Residency coordinators may be overwhelmed when scheduling residency interviews. Applicants often have to coordinate interviews with multiple programs at once, and relying on verbal or email confirmation may delay the process. Our objective was to determine applicant mean time to schedule and satisfaction using online scheduling. Methods: This pilot study is a retrospective analysis performed on a sample of applicants offered interviews at an urban county emergency medicine residency. Applicants were asked their estimated time to schedule with the online system compared to their average time using other methods. In addition, they were asked on a five-point anchored scale to rate their satisfaction. Results: Of 171 applicants, 121 completed the survey (70.8%. Applicants were scheduling an average of 13.3 interviews. Applicants reported scheduling interviews using the online system in mean of 46.2 minutes (median 10, range 1-1800 from the interview offer as compared with a mean of 320.2 minutes (median 60, range 3-2880 for other programs not using this system. This difference was statistically significant. In addition, applicants were more likely to rate their satisfaction using the online system as “satisfied” (83.5% vs 16.5%. Applicants were also more likely to state that they preferred scheduling their interviews using the online system rather than the way other programs scheduled interviews (74.2% vs 4.1% and that the online system aided them coordinating travel arrangements (52.1% vs 4.1%. Conclusion: An online interview scheduling system is associated with higher satisfaction among applicants both in coordinating travel arrangements and in overall satisfaction. [West J Emerg Med. 2015;16(2:352-354.

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

Energy Technology Data Exchange (ETDEWEB)

Kim, Minsun, E-mail: mk688@uw.edu; Stewart, Robert D. [Department of Radiation Oncology, University of Washington, Seattle, Washington 98195-6043 (United States); Phillips, Mark H. [Departments of Radiation Oncology and Neurological Surgery, University of Washington, Seattle, Washington 98195-6043 (United States)

2015-11-15

Purpose: To investigate the impact of using spatiotemporal optimization, i.e., intensity-modulated spatial optimization followed by fractionation schedule optimization, to select the patient-specific fractionation schedule that maximizes the tumor biologically equivalent dose (BED) under dose constraints for multiple organs-at-risk (OARs). Methods: Spatiotemporal optimization was applied to a variety of lung tumors in a phantom geometry using a range of tumor sizes and locations. The optimal fractionation schedule for a patient using the linear-quadratic cell survival model depends on the tumor and OAR sensitivity to fraction size (α/β), the effective tumor doubling time (T{sub d}), and the size and location of tumor target relative to one or more OARs (dose distribution). The authors used a spatiotemporal optimization method to identify the optimal number of fractions N that maximizes the 3D tumor BED distribution for 16 lung phantom cases. The selection of the optimal fractionation schedule used equivalent (30-fraction) OAR constraints for the heart (D{sub mean} ≤ 45 Gy), lungs (D{sub mean} ≤ 20 Gy), cord (D{sub max} ≤ 45 Gy), esophagus (D{sub max} ≤ 63 Gy), and unspecified tissues (D{sub 05} ≤ 60 Gy). To assess plan quality, the authors compared the minimum, mean, maximum, and D{sub 95} of tumor BED, as well as the equivalent uniform dose (EUD) for optimized plans to conventional intensity-modulated radiation therapy plans prescribing 60 Gy in 30 fractions. A sensitivity analysis was performed to assess the effects of T{sub d} (3–100 days), tumor lag-time (T{sub k} = 0–10 days), and the size of tumors on optimal fractionation schedule. Results: Using an α/β ratio of 10 Gy, the average values of tumor max, min, mean BED, and D{sub 95} were up to 19%, 21%, 20%, and 19% larger than those from conventional prescription, depending on T{sub d} and T{sub k} used. Tumor EUD was up to 17% larger than the conventional prescription. For fast proliferating

Construction schedules slack time minimizing

Science.gov (United States)

Krzemiński, Michał

2017-07-01

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

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.

Scheduling Network Traffic for Grid Purposes

DEFF Research Database (Denmark)

Gamst, Mette

This thesis concerns scheduling of network traffic in grid context. Grid computing consists of a number of geographically distributed computers, which work together for solving large problems. The computers are connected through a network. When scheduling job execution in grid computing, data...... transmission has so far not been taken into account. This causes stability problems, because data transmission takes time and thus causes delays to the execution plan. This thesis proposes the integration of job scheduling and network routing. The scientific contribution is based on methods from operations...... research and consists of six papers. The first four considers data transmission in grid context. The last two solves the data transmission problem, where the number of paths per data connection is bounded from above. The thesis shows that it is possible to solve the integrated job scheduling and network...

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.

Discordance between 'actual' and 'scheduled' check-in times at a heart failure clinic.

Directory of Open Access Journals (Sweden)

Eiran Z Gorodeski

Full Text Available A 2015 Institute Of Medicine statement "Transforming Health Care Scheduling and Access: Getting to Now", has increased concerns regarding patient wait times. Although waiting times have been widely studied, little attention has been paid to the role of patient arrival times as a component of this phenomenon. To this end, we investigated patterns of patient arrival at scheduled ambulatory heart failure (HF clinic appointments and studied its predictors. We hypothesized that patients are more likely to arrive later than scheduled, with progressively later arrivals later in the day.Using a business intelligence database we identified 6,194 unique patients that visited the Cleveland Clinic Main Campus HF clinic between January, 2015 and January, 2017. This clinic served both as a tertiary referral center and a community HF clinic. Transplant and left ventricular assist device (LVAD visits were excluded. Punctuality was defined as the difference between 'actual' and 'scheduled' check-in times, whereby negative values (i.e., early punctuality were patients who checked-in early. Contrary to our hypothesis, we found that patients checked-in late only a minority of the time (38% of visits. Additionally, examining punctuality by appointment hour slot we found that patients scheduled after 8AM had progressively earlier check-in times as the day progressed (P < .001 for trend. In both a Random Forest-Regression framework and linear regression models the most important risk-adjusted predictors of early punctuality were: later in the day appointment hour slot, patient having previously been to the hospital, age in the early 70s, and white race.Patients attending a mixed population ambulatory HF clinic check-in earlier than scheduled times, with progressive discrepant intervals throughout the day. This finding may have significant implications for provider utilization and resource planning in order to maximize clinic efficiency. The impact of elective early

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

Science.gov (United States)

Sembiring, N.; Nasution, A. H.

2018-02-01

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

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.

A new distributed systems scheduling algorithm: a swarm intelligence approach

Science.gov (United States)

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

2011-12-01

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

Illicit online marketing of lorcaserin before DEA scheduling.

Science.gov (United States)

Liang, Bryan A; Mackey, Tim K; Archer-Hayes, Ashley N; Shinn, Linda M

2013-05-01

Antiobesity drugs have been marketed illicitly by "no prescription" online pharmacies after approval and scheduling by the drug enforcement agency. We assess whether antiobesity drug Belviq® (lorcaserin HCl) was available from illicit online vendors before DEA-scheduling when sales are unauthorized. Online searches of "buy Belviq no prescription" examining first five result pages marketing the drug. Searches were performed from 11/5/2012-12/8/2012, prior to DEA scheduing. Belviq® is actively marketed by "no prescription" online vendors despite official unavailability and prescription requirements. Approaches included direct-to-consumer advertising using descriptive website URLs; linking to illicit marketers; and directing customers to other weight-loss websites for additional marketing. Finally, large quantities were marketed by business-to-business vendors. Illicit online "no prescription" pharmacies are marketing unauthorized, suspect antiobesity drugs before DEA scheduling and permitted marketing. Regulators must legally intercede to ensure patient safety, and providers must educate patients about online-sourcing risks. Copyright © 2013 The Obesity Society.

Future aircraft networks and schedules

Science.gov (United States)

Shu, Yan

2011-07-01

computational results of these large-scale instances. To validate the models and solution algorithms developed, this thesis also compares the daily flight schedules that it designs with the schedules of the existing airlines. Furthermore, it creates instances that represent different economic and fuel-prices conditions and derives schedules under these different conditions. In addition, it discusses the implication of using new aircraft in the future flight schedules. Finally, future research in three areas---model, computational method, and simulation for validation---is proposed.

Knowledge-based scheduling of arrival aircraft

Science.gov (United States)

Krzeczowski, K.; Davis, T.; Erzberger, H.; Lev-Ram, I.; Bergh, C.

1995-01-01

A knowledge-based method for scheduling arrival aircraft in the terminal area has been implemented and tested in real-time simulation. The scheduling system automatically sequences, assigns landing times, and assigns runways to arrival aircraft by utilizing continuous updates of aircraft radar data and controller inputs. The scheduling algorithms is driven by a knowledge base which was obtained in over two thousand hours of controller-in-the-loop real-time simulation. The knowledge base contains a series of hierarchical 'rules' and decision logic that examines both performance criteria, such as delay reduction, as well as workload reduction criteria, such as conflict avoidance. The objective of the algorithms is to devise an efficient plan to land the aircraft in a manner acceptable to the air traffic controllers. This paper will describe the scheduling algorithms, give examples of their use, and present data regarding their potential benefits to the air traffic system.

Job shop scheduling by local search

NARCIS (Netherlands)

Vaessens, R.J.M.; Aarts, E.H.L.; Lenstra, J.K.

1994-01-01

We survey solution methods for the job shop scheduling problem with an emphasis on local search. We discuss both cleterministic and randomized local search methods as well as the applied neighborhoods. We compare the computational performance of the various methods in terms of their effectiveness

Genetic algorithm to solve the problems of lectures and practicums scheduling

Science.gov (United States)

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

2018-02-01

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

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.

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.

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.

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 case study: the initiative to improve RN scheduling at Hamilton Health Sciences.

Science.gov (United States)

Wallace, Laurel-Anne; Pierson, Sharon

2008-01-01

In 2003, Hamilton Health Sciences embarked on an initiative to improve and standardize nursing schedules and scheduling practices. The scheduling project was one of several initiatives undertaken by a corporate-wide Nursing Resource Group established to enhance the work environment and patient care and to ensure appropriate utilization of nursing resources across the organization's five hospitals. This article focuses on major activities undertaken in the scheduling initiative. The step-by-step approach described, plus examples of the scheduling resources developed and samples of extended-tour schedules, will all provide insight, potential strategies and practical help for nursing administrators, human resources (HR) personnel and others interested in improving nurse scheduling.

Adaptive Gain Scheduled Semiactive Vibration Control Using a Neural Network

Directory of Open Access Journals (Sweden)

Kazuhiko Hiramoto

2018-01-01

Full Text Available We propose an adaptive gain scheduled semiactive control method using an artificial neural network for structural systems subject to earthquake disturbance. In order to design a semiactive control system with high control performance against earthquakes with different time and/or frequency properties, multiple semiactive control laws with high performance for each of multiple earthquake disturbances are scheduled with an adaptive manner. Each semiactive control law to be scheduled is designed based on the output emulation approach that has been proposed by the authors. As the adaptive gain scheduling mechanism, we introduce an artificial neural network (ANN. Input signals of the ANN are the measured earthquake disturbance itself, for example, the acceleration, velocity, and displacement. The output of the ANN is the parameter for the scheduling of multiple semiactive control laws each of which has been optimized for a single disturbance. Parameters such as weight and bias in the ANN are optimized by the genetic algorithm (GA. The proposed design method is applied to semiactive control design of a base-isolated building with a semiactive damper. With simulation study, the proposed adaptive gain scheduling method realizes control performance exceeding single semiactive control optimizing the average of the control performance subject to various earthquake disturbances.

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

Evaluation of Selected Resource Allocation and Scheduling Methods in Heterogeneous Many-Core Processors and Graphics Processing Units

Directory of Open Access Journals (Sweden)

Ciznicki Milosz

2014-12-01

Full Text Available Heterogeneous many-core computing resources are increasingly popular among users due to their improved performance over homogeneous systems. Many developers have realized that heterogeneous systems, e.g. a combination of a shared memory multi-core CPU machine with massively parallel Graphics Processing Units (GPUs, can provide significant performance opportunities to a wide range of applications. However, the best overall performance can only be achieved if application tasks are efficiently assigned to different types of processor units in time taking into account their specific resource requirements. Additionally, one should note that available heterogeneous resources have been designed as general purpose units, however, with many built-in features accelerating specific application operations. In other words, the same algorithm or application functionality can be implemented as a different task for CPU or GPU. Nevertheless, from the perspective of various evaluation criteria, e.g. the total execution time or energy consumption, we may observe completely different results. Therefore, as tasks can be scheduled and managed in many alternative ways on both many-core CPUs or GPUs and consequently have a huge impact on the overall computing resources performance, there are needs for new and improved resource management techniques. In this paper we discuss results achieved during experimental performance studies of selected task scheduling methods in heterogeneous computing systems. Additionally, we present a new architecture for resource allocation and task scheduling library which provides a generic application programming interface at the operating system level for improving scheduling polices taking into account a diversity of tasks and heterogeneous computing resources characteristics.

The scheduling of repeat cesarean section operations: prospective management protocol experience.

Science.gov (United States)

Read, J A

1985-03-01

There are benefits to patients and a busy obstetric service if repeat cesarean section operations are performed on a scheduled basis. Optimum management avoids prematurity and reduces the need for amniocentesis. Over a period of 20 months repeat cesarean sections were performed at Tripler Army Medical Center while a protocol with the following elements was used: (1) known last menstrual period; (2) landmarks: positive urine human chorionic gonadotropin test by 6 weeks, Doppler fetal heart tone by 12 weeks, date determination by examination before 10 weeks, fetoscope fetal heart tone by 20 weeks, and date determination by size before 30 weeks; (3) date determination by midtrimester sonogram(s); (4) normal third-trimester glucose screening; (5) biparietal diameter of 9.2 or 9.5 cm before scheduling. With two or more clinical landmarks and one date by sonogram or one landmark and date by two sonograms, elective repeat cesarean section was scheduled at 39 weeks if the biparietal diameter was greater than or equal to 9.2 cm (127). If dates by sonogram were less than dates by last menstrual period but greater than 1 week or if last menstrual period was unknown, dates by sonogram and landmarks corresponding to dates by sonogram were used to electively schedule, with biparietal diameters of 9.2 or 9.5 cm respectively required (28). If protocol criteria were not met or earlier delivery was indicated (e.g., vertical scar or diabetes), amniocentesis was performed (42), except when not possible, advisable, or refused when patients either elected labor (20) or were scheduled if three or more criteria for 40+ weeks were met (18). Of 225 patients (70.5%) scheduled by protocol (173), amniocentesis (34), or medical indication (18), 188 (58.9%) were delivered without labor. In the 147 patients (46.1%) delivered electively by protocol without labor or amniocentesis, there were no cases of respiratory distress syndrome and the mean birth weight was 3517 gm. With early care and better

Multi-Satellite Observation Scheduling for Large Area Disaster Emergency Response

Science.gov (United States)

Niu, X. N.; Tang, H.; Wu, L. X.

2018-04-01

an optimal imaging plan, plays a key role in coordinating multiple satellites to monitor the disaster area. In the paper, to generate imaging plan dynamically according to the disaster relief, we propose a dynamic satellite task scheduling method for large area disaster response. First, an initial robust scheduling scheme is generated by a robust satellite scheduling model in which both the profit and the robustness of the schedule are simultaneously maximized. Then, we use a multi-objective optimization model to obtain a series of decomposing schemes. Based on the initial imaging plan, we propose a mixed optimizing algorithm named HA_NSGA-II to allocate the decomposing results thus to obtain an adjusted imaging schedule. A real disaster scenario, i.e., 2008 Wenchuan earthquake, is revisited in terms of rapid response using satellite resources and used to evaluate the performance of the proposed method with state-of-the-art approaches. We conclude that our satellite scheduling model can optimize the usage of satellite resources so as to obtain images in disaster response in a more timely and efficient manner.

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

Assessment of the Pre-operative Nutritional Status of Patients who were Scheduled for Elective Surgery and Determination of Nutritional Support Requirements

Directory of Open Access Journals (Sweden)

Bahri Özer

2016-12-01

Full Text Available Aim: We aimed to evaluate the nutritional status with clinical, antropometric and laboratory methods in patients who were scheduled for elective surgery. Methods: Retrospective evaluation of 90 patients in a period of 4 years was performed. Patients with tumors (group 1 were compared with controls (group 2 in regard to nutritional status. Student t-test, Mann-Whitney U test and chi-square test were used for statistical analysis. Results: The mean age of patients in group 1 (3 males, 8 females and group 2 (35 males, 44 females was 62.8±11.0 and 47.7±16.2 years, respectively. The mean body mass index (BMI was 30.1±6.6. Triceps thickness and circumference of the upper mid-arm were 2.2±0.8 and 28.6±4.2 cm, respectively. All patients had a Subjective Global Assessment (SGA score A, but two patients were classified as having moderate nutritional risk according to Nutritional Risk Screening (NRS 2002. The mean length of hospital stay was 2.6±2.4 days. Complications were observed in four patients of group 2 and in two patients of group 1. Gender, SGA score, albumin, prealbumin, BMI, triceps thickness, circumference of the upper mid-arm and complication rates were statistically similar between the groups. There was a statistically significant difference in age, NRS 2002, gastrointestinal system findings, length of hospital stay, sedimentation and fasting blood glucose levels between the groups. Conclusion: Patients with nutritional risk can be detected using the NRS 2002. Nutritional support was necessary in 2% of all cases and in 18% of group 1 patients. However, advantages of antropometric measurements, biochemical tests, BMI and SGA could not be shown.

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

Solving a chemical batch scheduling problem by local search

NARCIS (Netherlands)

Brucker, P.; Hurink, Johann L.

1999-01-01

A chemical batch scheduling problem is modelled in two different ways as a discrete optimization problem. Both models are used to solve the batch scheduling problem in a two-phase tabu search procedure. The method is tested on real-world data.

Filling the Holes: Work Schedulers as Job Crafters of Employment Practice in Long-Term Health Care

Science.gov (United States)

Kossek, Ellen Ernst; Piszczek, Matthew M.; Mcalpine, Kristie L.; Hammer, Leslie B.; Burke, Lisa

2016-01-01

Although work schedulers serve an organizational role influencing decisions about balancing conflicting stakeholder interests over schedules and staffing, scheduling has primarily been described as an objective activity or individual job characteristic. The authors use the lens of job crafting to examine how schedulers in 26 health care facilities enact their roles as they “fill holes” to schedule workers. Qualitative analysis of interview data suggests that schedulers expand their formal scope and influence to meet their interpretations of how to manage stakeholders (employers, workers, and patients). The authors analyze variations in the extent of job crafting (cognitive, physical, relational) to broaden role repertoires. They find evidence that some schedulers engage in rule-bound interpretation to avoid role expansion. They also identify four types of schedulers: enforcers, patient-focused schedulers, employee-focused schedulers, and balancers. The article adds to the job-crafting literature by showing that job crafting is conducted not only to create meaningful work but also to manage conflicting demands and to mediate among the competing labor interests of workers, clients, and employers. PMID:27721517

Efficacy and Safety of Regorafenib With 2/1 Schedule for Patients ≥ 75 Years With Metastatic Colorectal Cancer (mCRC) After Failure of 2 Lines of Chemotherapy.

Science.gov (United States)

Petrioli, Roberto; Chirra, Martina; Messuti, Luciana; Fiaschi, Anna Ida; Savelli, Vinno; Martellucci, Ignazio; Francini, Edoardo

2018-02-21

In the CORRECT (patients with metastatic COloRectal Cancer treated with REgorafenib or plaCebo after failure of standard Therapy) trial, regorafenib was proven to extend survival of patients with metastatic colorectal cancer (mCRC) that progressed after all available therapies. Grade 3 to 4 toxicity occurred in 54% of patients, and data on the activity and tolerability of regorafenib in elderly patients were scarce. The aim of this study was to evaluate the efficacy and safety of an alternative schedule, 2-week-on treatment and 1 week-off (2/1 schedule), of regorafenib for elderly patients with mCRC. Patients ≥ 75 years with mCRC who progressed after oxaliplatin- and irinotecan-based chemotherapy received regorafenib on a 2/1 schedule. Potentially frail subjects were identified by G8 screening tool and excluded. The 2-month disease-control rate was the primary endpoint, and the secondary endpoints included safety, progression-free survival (PFS), overall survival (OS), and objective response rate. Between February 2014 and May 2017, 23 patients with mCRC were recruited at our institution. No partial or complete responses were observed, and the stable disease and disease-control rate were 52.2%. The median PFS was 4.8 months (95% confidence interval, 3.8-6.3 months), and the median OS was 8.9 months (95% confidence interval, 6.9-10.6 months). Adverse events were uncommon, and the most frequent grade 3 toxicity adverse events were hand-foot skin reaction (9%) and fatigue (9%). Toxicity-related dose reductions and discontinuations occurred in 5 and 2 patients, respectively. Regorafenib administered with a modified 2/1 schedule to patients who were aged ≥ 75 years and non-frail with treatment-refractory mCRC seems to be tolerable and achieve encouraging results in terms of PFS and OS. Copyright © 2018. Published by Elsevier Inc.

Environmental surveillance master sampling schedule

International Nuclear Information System (INIS)

Bisping, L.E.

1997-01-01

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

Performance comparison of some evolutionary algorithms on job shop scheduling problems

Science.gov (United States)

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

2016-09-01

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

Next Generation CANDU: Conceptual Design for a Short Construction Schedule

International Nuclear Information System (INIS)

Hopwood, Jerry M.; Love, Ian J.W.; Elgohary, Medhat; Fairclough, Neville

2002-01-01

Atomic Energy of Canada Ltd. (AECL) has very successful experience in implementing new construction methods at the Qinshan (Phase III) twin unit CANDU 6 plant in China. This paper examines the construction method that must be implemented during the conceptual design phase of a project if short construction schedules are to be met. A project schedule of 48 months has been developed for the nth unit of NG (Next Generation) CANDU with a 42 month construction period from 1. Concrete to In-Service. An overall construction strategy has been developed involving paralleling project activities that are normally conducted in series. Many parts of the plant will be fabricated as modules and be installed using heavy lift cranes. The Reactor Building (RB), being on the critical path, has been the focus of considerable assessment, looking at alternative ways of applying the construction strategy to this building. A construction method has been chosen which will result in excess of 80% of internal work being completed as modules or as very streamlined traditional construction. This method is being further evaluated as the detailed layout proceeds. Other areas of the plant have been integrated into the schedule and new construction methods are being applied to these so that further modularization and even greater paralleling of activities will be achieved. It is concluded that the optimized construction method is a requirement, which must be implemented through all phases of design to make a 42 month construction schedule a reality. If the construction methods are appropriately chosen, the schedule reductions achieved will make nuclear more competitive. (authors)

An evaluation of the sociodemographic determinants of dental anxiety in patients scheduled for intra-alveolar extraction

Directory of Open Access Journals (Sweden)

Peter E. Egbor

2014-09-01

Full Text Available Background: Studies on anxiety in patients having intra-alveolar extraction as well as the effect of patient's sociodemographic characteristics influencing level of associated anxiety are few in our environment. The aim of this study was to statistically analyze the sociodemographic determinants of dental anxiety in patients scheduled for intra-alveolar extraction. Methods: A cross-sectional study was conducted among 93 consecutive patients attending the outpatient clinic of the Department of Maxillofacial Surgery, University of Benin Teaching Hospital for intra-alveolar extraction in the months of November and December 2013. An interview-based questionnaire, Corah Dental Anxiety Scale Revised (DAS-R, was administered to evaluate levels of dental anxiety. Sociodemographic characteristics of the subjects were recorded. Descriptive statistics and regression models were done with the independent variables (sociodemographic factors and the dependent variable being the DAS-R. A P<0.05 was considered significant. Results: The internal consistency of the scale used as determined by Cronbach alpha was 0.76. Mean DAS score was 8.12±2.58. Dental anxiety and age of subjects showed significant inverse relationship. Females had a higher mean DAS score (8.76 than the males (7.37 (P=0.006. Residence (urban/rural was not statistically significant. Singles reported the highest DAS score (9.41 (P=0.006. The educational level attained was significantly related to dental anxiety (P=0.005. Those with secondary school education had the highest DAS score (9.26. Class V social status had the highest mean anxiety score (P=0.012. Stepwise linear regression showed that the best predictors for dental anxiety were sex (P=0.008 and marital status (P=0.026. Conclusion: This present study demonstrates that sex and marital status are the predictive factors for dental anxiety in the overall management of patients indicated for intra-alveolar extraction.

Pre-emptive resource-constrained multimode project scheduling using genetic algorithm: A dynamic forward approach

Directory of Open Access Journals (Sweden)

Aidin Delgoshaei

2016-09-01

Full Text Available Purpose: The issue resource over-allocating is a big concern for project engineers in the process of scheduling project activities. Resource over-allocating drawback is frequently seen after scheduling of a project in practice which causes a schedule to be useless. Modifying an over-allocated schedule is very complicated and needs a lot of efforts and time. In this paper, a new and fast tracking method is proposed to schedule large scale projects which can help project engineers to schedule the project rapidly and with more confidence. Design/methodology/approach: In this article, a forward approach for maximizing net present value (NPV in multi-mode resource constrained project scheduling problem while assuming discounted positive cash flows (MRCPSP-DCF is proposed. The progress payment method is used and all resources are considered as pre-emptible. The proposed approach maximizes NPV using unscheduled resources through resource calendar in forward mode. For this purpose, a Genetic Algorithm is applied to solve. Findings: The findings show that the proposed method is an effective way to maximize NPV in MRCPSP-DCF problems while activity splitting is allowed. The proposed algorithm is very fast and can schedule experimental cases with 1000 variables and 100 resources in few seconds. The results are then compared with branch and bound method and simulated annealing algorithm and it is found the proposed genetic algorithm can provide results with better quality. Then algorithm is then applied for scheduling a hospital in practice. Originality/value: The method can be used alone or as a macro in Microsoft Office Project® Software to schedule MRCPSP-DCF problems or to modify resource over-allocated activities after scheduling a project. This can help project engineers to schedule project activities rapidly with more accuracy in practice.

Physician Payment Methods and the Patient-Centered Medical Home: Comment on "A Troubled Asset Relief Program for the Patient-Centered Medical Home".

Science.gov (United States)

Quinn, Kevin

This commentary analyzes the patient-centered medical home (PCMH) model within a framework of the 8 basic payment methods in health care. PCMHs are firmly within the fee-for-service tradition. Changes to the process and structure of the Resource Based Relative Value Scale, which underlies almost all physician fee schedules, could make PCMHs more financially viable. Of the alternative payment methods being considered, shared savings models are unlikely to transform medical practice whereas capitation models place unrealistic expectations on providers to accept epidemiological risk. Episode payment may strike a feasible balance for PCMHs, with newly available episode definitions presenting opportunities not previously available.

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

International Nuclear Information System (INIS)

Finnegan, J.M.

1986-01-01

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

The impact of alternative pricing methods for drugs in California Workers’ Compensation System: Fee-schedule pricing

Science.gov (United States)

Wilson, Leslie; Turkistani, Fatema A.; Huang, Wei; Tran, Dang M.; Lin, Tracy Kuo

2018-01-01

Introduction California’s Workers’ Compensation System (CAWCS) Department of Industrial Relations questioned the adequacy of the current Medi-Cal fee-schedule pricing and requested analysis of alternatives that maximize price availability and maintain budget neutrality. Objectives To compare CAWCS pharmacy-dispensed (PD) drug prices under alternative fee schedules, and identify combinations of alternative benchmarks that have prices available for the largest percentage of PD drugs and that best reach budget neutrality. Methods Claims transaction-level data (2011–2013) from CAWCS were used to estimate total annual PD pharmaceutical payments. Medi-Cal pricing data was from the Workman’s Compensation Insurance System (WCIS). Average Wholesale Prices (AWP), Wholesale Acquisition Costs (WAC), Direct Prices (DP), Federal Upper Limit (FUL) prices, and National Average Drug Acquisition Costs (NADAC) were from Medi-Span. We matched National Drug Codes (NDCs), pricing dates, and drug quantity for comparisons. We report pharmacy-dispensed (PD) claims frequency, reimbursement matching rate, and paid costs by CAWCS as the reference price against all alternative price benchmarks. Results Of 12,529,977 CAWCS claims for pharmaceutical products 11.6% (1,462,814) were for PD drugs. Prescription drug cost for CAWCS was over $152M; $63.9M, $47.9M, and $40.6M in 2011–2013. Ninety seven percent of these CAWCS PD claims had a Medi-Cal price. Alternative mechanisms provided a price for fewer claims; NADAC 94.23%, AWP 90.94%, FUL 73.11%, WAC 66.98%, and DP 14.33%. Among CAWCS drugs with no Medi-Cal price in PD claims, AWP, WAC, NADAC, DP, and FUL provided prices for 96.7%, 63.14%, 24.82%, 20.83%, and 15.08% of claims. Overall CAWCS paid 100.52% of Medi-Cal, 60% of AWP, 97% of WAC, 309.53% of FUL, 103.83% of DP, and 136.27% of NADAC. Conclusions CAWCS current Medi-Cal fee-schedule price list for PD drugs is more complete than all alternative fee-schedules. However, all

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.

Staffing, overtime, and shift scheduling project

International Nuclear Information System (INIS)

Lewis, P.M.

1989-01-01

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

Thinking Outside the Block: An Innovative Alternative to 4X4 Block Scheduling.

Science.gov (United States)

Frank, Myra

2002-01-01

Introduces a 4x1 block scheduling method that was developed as an alternative to 4x4 block scheduling. Schedules Fridays for summer school, test preparation, and enrichment and elective courses. Includes suggestions on how to alleviate drawbacks of the 4x1 block schedule. (YDS)

Outcome of intraoperative goal-directed therapy using Vigileo/FloTrac in high-risk patients scheduled for major abdominal surgeries: A prospective randomized trial

Directory of Open Access Journals (Sweden)

Mohammed A. Elgendy

2017-07-01

Conclusion: The applied protocol for intraoperative GDT provided significant reduction of PO morbidities, ICU and hospital LOS but couldn‘t significantly reduce mortality rates in high risk patients scheduled for major abdominal surgeries.

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.

Cost-efficient scheduling of FAST observations

Science.gov (United States)

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

2018-03-01

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

Computer-aided resource planning and scheduling for radiological services

Science.gov (United States)

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

1996-05-01

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

Project Scheduling Based on Risk of Gas Transmission Pipe

Science.gov (United States)

Silvianita; Nurbaity, A.; Mulyadi, Y.; Suntoyo; Chamelia, D. M.

2018-03-01

The planning of a project has a time limit on which must be completed before or right at a predetermined time. Thus, in a project planning, it is necessary to have scheduling management that is useful for completing a project to achieve maximum results by considering the constraints that will exists. Scheduling management is undertaken to deal with uncertainties and negative impacts of time and cost in project completion. This paper explains about scheduling management in gas transmission pipeline project Gresik-Semarang to find out which scheduling plan is most effectively used in accordance with its risk value. Scheduling management in this paper is assissted by Microsoft Project software to find the critical path of existing project scheduling planning data. Critical path is the longest scheduling path with the fastest completion time. The result is found a critical path on project scheduling with completion time is 152 days. Furthermore, the calculation of risk is done by using House of Risk (HOR) method and it is found that the critical path has a share of 40.98 percent of all causes of the occurence of risk events that will be experienced.

Compilation time analysis to minimize run-time overhead in preemptive scheduling on multiprocessors

Science.gov (United States)

Wauters, Piet; Lauwereins, Rudy; Peperstraete, J.

1994-10-01

This paper describes a scheduling method for hard real-time Digital Signal Processing (DSP) applications, implemented on a multi-processor. Due to the very high operating frequencies of DSP applications (typically hundreds of kHz) runtime overhead should be kept as small as possible. Because static scheduling introduces very little run-time overhead it is used as much as possible. Dynamic pre-emption of tasks is allowed if and only if it leads to better performance in spite of the extra run-time overhead. We essentially combine static scheduling with dynamic pre-emption using static priorities. Since we are dealing with hard real-time applications we must be able to guarantee at compile-time that all timing requirements will be satisfied at run-time. We will show that our method performs at least as good as any static scheduling method. It also reduces the total amount of dynamic pre-emptions compared with run time methods like deadline monotonic scheduling.

PROMSYS, Plant Equipment Maintenance and Inspection Scheduling

International Nuclear Information System (INIS)

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

1986-01-01

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

48 CFR 915.404-4-71-5 - Fee schedules.

Science.gov (United States)

2010-10-01

... METHODS AND CONTRACT TYPES CONTRACTING BY NEGOTIATION Contract Pricing 915.404-4-71-5 Fee schedules. (a... subcontracting, normal contractor services performed by the government or another contractor: (1) The target fee...) The target fee schedule provides for 45 percent of the contract work to be subcontracted for such...

Application of cultural algorithm to generation scheduling of hydrothermal systems

International Nuclear Information System (INIS)

Yuan Xiaohui; Yuan Yanbin

2006-01-01

The daily generation scheduling of hydrothermal power systems plays an important role in the operation of electric power systems for economics and security, which is a large scale dynamic non-linear constrained optimization problem. It is difficult to solve using traditional optimization methods. This paper proposes a new cultural algorithm to solve the optimal daily generation scheduling of hydrothermal power systems. The approach takes the water transport delay time between connected reservoirs into consideration and can conveniently deal with the complicated hydraulic coupling simultaneously. An example is used to verify the correctness and effectiveness of the proposed cultural algorithm, comparing with both the Lagrange method and the genetic algorithm method. The simulation results demonstrate that the proposed algorithm has rapid convergence speed and higher solution precision. Thus, an effective method is provided to solve the optimal daily generation scheduling of hydrothermal systems

Reduction in depressive symptoms in primary prevention ICD scheduled patients - One year prospective study.

Science.gov (United States)

Amiaz, Revital; Asher, Elad; Rozen, Guy; Czerniak, Efrat; Levi, Linda; Weiser, Mark; Glikson, Michael

2017-09-01

Implantable Cardioverter Defibrillators (ICDs), have previously been associated with the onset of depression and anxiety. The aim of this one-year prospective study was to evaluate the rate of new onset psychopathological symptoms after elective ICD implantation. A total of 158 consecutive outpatients who were scheduled for an elective ICD implantation were diagnosed and screened based on the Mini International Neuropsychiatric Interview (MINI). Depression and anxiety were evaluated using the Hamilton Rating Scales for Depression (HAM-D) and Anxiety (HAM-A). Patient's attitude toward the ICD device was evaluated using a Visual Analog Scale (VAS). Patients' mean age was 64±12.4years; 134 (85%) were men, with the majority of patients performing the procedure for reasons of 'primary prevention'. According to the MINI diagnosis at baseline, three (2%) patients suffered from major depressive disorder and ten (6%) from dysthymia. Significant improvement in HAM-D mean scores was found between baseline, three months and one year after implantation (6.50±6.4; 4.10±5.3 and 2.7±4.6, respectively F(2100)=16.42; pdepressive symptoms, while the overall mindset toward the ICD device was positive and improved during the one-year follow-up. Copyright © 2017 Elsevier Inc. All rights reserved.

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

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

Freezing the Master Production Schedule Under Rolling Planning Horizons

OpenAIRE

V. Sridharan; William L. Berry; V. Udayabhanu

1987-01-01

The stability of the Master Production Schedule (MPS) is a critical issue in managing production operations with a Material Requirements Planning System. One method of achieving stability is to freeze some portion or all of the MPS. While freezing the MPS can limit the number of schedule changes, it can also produce an increase in production and inventory costs. This paper examines three decision variables in freezing the MPS: the freezing method, the freeze interval length, and the planning ...

Taking the lag out of jet lag through model-based schedule design.

Science.gov (United States)

Dean, Dennis A; Forger, Daniel B; Klerman, Elizabeth B

2009-06-01

Travel across multiple time zones results in desynchronization of environmental time cues and the sleep-wake schedule from their normal phase relationships with the endogenous circadian system. Circadian misalignment can result in poor neurobehavioral performance, decreased sleep efficiency, and inappropriately timed physiological signals including gastrointestinal activity and hormone release. Frequent and repeated transmeridian travel is associated with long-term cognitive deficits, and rodents experimentally exposed to repeated schedule shifts have increased death rates. One approach to reduce the short-term circadian, sleep-wake, and performance problems is to use mathematical models of the circadian pacemaker to design countermeasures that rapidly shift the circadian pacemaker to align with the new schedule. In this paper, the use of mathematical models to design sleep-wake and countermeasure schedules for improved performance is demonstrated. We present an approach to designing interventions that combines an algorithm for optimal placement of countermeasures with a novel mode of schedule representation. With these methods, rapid circadian resynchrony and the resulting improvement in neurobehavioral performance can be quickly achieved even after moderate to large shifts in the sleep-wake schedule. The key schedule design inputs are endogenous circadian period length, desired sleep-wake schedule, length of intervention, background light level, and countermeasure strength. The new schedule representation facilitates schedule design, simulation studies, and experiment design and significantly decreases the amount of time to design an appropriate intervention. The method presented in this paper has direct implications for designing jet lag, shift-work, and non-24-hour schedules, including scheduling for extreme environments, such as in space, undersea, or in polar regions.

System and method for optimal load and source scheduling in context aware homes

Science.gov (United States)

Shetty, Pradeep; Foslien Graber, Wendy; Mangsuli, Purnaprajna R.; Kolavennu, Soumitri N.; Curtner, Keith L.

2018-01-23

A controller for controlling energy consumption in a home includes a constraints engine to define variables for multiple appliances in the home corresponding to various home modes and persona of an occupant of the home. A modeling engine models multiple paths of energy utilization of the multiple appliances to place the home into a desired state from a current context. An optimal scheduler receives the multiple paths of energy utilization and generates a schedule as a function of the multiple paths and a selected persona to place the home in a desired state.

Association of primary tumour FDG uptake with clinical, histopathological and molecular characteristics in breast cancer patients scheduled for neoadjuvant chemotherapy

Energy Technology Data Exchange (ETDEWEB)

Koolen, B.B.; Aukema, T.S. [Netherlands Cancer Institute-Antoni van Leeuwenhoek Hospital, Department of Nuclear Medicine, Amsterdam (Netherlands); Netherlands Cancer Institute-Antoni van Leeuwenhoek Hospital, Department of Surgical Oncology, Amsterdam (Netherlands); Vrancken Peeters, M.J.T.F.D.; Rutgers, E.J.T. [Netherlands Cancer Institute-Antoni van Leeuwenhoek Hospital, Department of Surgical Oncology, Amsterdam (Netherlands); Wesseling, J.; Lips, E.H. [Netherlands Cancer Institute-Antoni van Leeuwenhoek Hospital, Department of Pathology and Experimental Therapy, Amsterdam (Netherlands); Vogel, W.V.; Valdes Olmos, R.A. [Netherlands Cancer Institute-Antoni van Leeuwenhoek Hospital, Department of Nuclear Medicine, Amsterdam (Netherlands); Werkhoven, E. van [Netherlands Cancer Institute-Antoni van Leeuwenhoek Hospital, Department of Biometrics, Amsterdam (Netherlands); Gilhuijs, K.G.A. [Netherlands Cancer Institute-Antoni van Leeuwenhoek Hospital, Department of Radiology, Amsterdam (Netherlands); University Medical Centre Utrecht, Department of Radiology, Utrecht (Netherlands); Rodenhuis, S. [Netherlands Cancer Institute-Antoni van Leeuwenhoek Hospital, Department of Medical Oncology, Amsterdam (Netherlands)

2012-12-15

The aim of this study was to evaluate the association of primary tumour {sup 18}F-fluorodeoxyglucose (FDG) uptake with clinical, histopathological and molecular characteristics of breast cancer patients scheduled for neoadjuvant chemotherapy. Second, we wished to establish for which patients pretreatment positron emission tomography (PET)/CT could safely be omitted because of low FDG uptake. PET/CT was performed in 214 primary stage II or III breast cancer patients in the prone position with hanging breasts. Tumour FDG uptake was qualitatively evaluated to determine the possibility of response monitoring with PET/CT and was quantitatively assessed using maximum standardized uptake values (SUV{sub max}). FDG uptake was compared with age, TNM stage, histology, hormone and human epidermal growth factor receptor 2 status, grade, Ki-67 and molecular subtype in univariable and multivariable analyses. In 203 tumours (95 %) FDG uptake was considered sufficient for response monitoring. No subgroup of patients with consistently low tumour FDG uptake could be identified. In a univariable analysis, SUV{sub max} was significantly higher in patients with distant metastases at staging examination, non-lobular carcinomas, tumours with negative hormone receptors, triple negative tumours, grade 3 tumours, and in tumours with a high proliferation index (Ki-67 expression). After multiple linear regression analysis, triple negative and grade 3 tumours were significantly associated with a higher SUV{sub max}. Primary tumour FDG uptake in breast cancer patients scheduled for neoadjuvant chemotherapy is significantly higher in tumours with prognostically unfavourable characteristics. Based on tumour characteristics associated with low tumour FDG uptake, this study was unable to identify a subgroup of patients unlikely to benefit from pretreatment PET/CT. (orig.)

Cure Schedule for Stycast 2651/Catalyst 11.

Energy Technology Data Exchange (ETDEWEB)

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

2017-11-01

The Henkel technical data sheet (TDS) for Stycast 2651/Catalyst 11 lists three alternate cure schedules for the material, each of which would result in a different state of reaction and different material properties. Here, a cure schedule that attains full reaction of the material is defined. The use of this cure schedule will eliminate variance in material properties due to changes in the cure state of the material, and the cure schedule will serve as the method to make material prior to characterizing properties. The following recommendation was motivated by (1) a desire to cure at a single temperature for ease of manufacture and (2) a desire to keep the cure temperature low (to minimize residual stress build-up associated with the cooldown from the cure temperature to room temperature) without excessively limiting the cure reaction due to vitrification (i.e., material glass transition temperature, T_g, exceeding cure temperature).

Safety of a 3-weekly schedule of carboplatin plus pegylated liposomal doxorubicin as first line chemotherapy in patients with ovarian cancer: preliminary results of the MITO-2 randomized trial

Directory of Open Access Journals (Sweden)

D'Arco Alfonso

2006-08-01

Full Text Available Abstract Background The MITO-2 (Multicentre Italian Trials in Ovarian cancer study is a randomized phase III trial comparing carboplatin plus paclitaxel to carboplatin plus pegylated liposomal doxorubicin in first-line chemotherapy of patients with ovarian cancer. Due to the paucity of published phase I data on the 3-weekly experimental schedule used, an early safety analysis was planned. Methods Patients with ovarian cancer (stage Ic-IV, aged 2, every 3 weeks or to carboplatin AUC 5 plus pegylated liposomal doxorubicin 30 mg/m2, every 3 weeks. Treatment was planned for 6 cycles. Toxicity was coded according to the NCI-CTC version 2.0. Results The pre-planned safety analysis was performed in July 2004. Data from the first 50 patients treated with carboplatin plus pegylated liposomal doxorubicin were evaluated. Median age was 60 years (range 34–75. Forty-three patients (86% completed 6 cycles. Two thirds of the patients had at least one cycle delayed due to toxicity, but 63% of the cycles were administered on time. In most cases the reason for chemotherapy delay was neutropenia or other hematological toxicity. No delay due to palmar-plantar erythrodysesthesia (PPE was recorded. No toxic death was recorded. Reported hematological toxicities were: grade (G 3 anemia 16%, G3/G4 neutropenia 36% and 10% respectively, G3/4 thrombocytopenia 22% and 4% respectively. Non-haematological toxicity was infrequent: pulmonary G1 6%, heart rhythm G1 4%, liver toxicity G1 6%, G2 4% and G3 2%. Complete hair loss was reported in 6% of patients, and G1 neuropathy in 2%. PPE was recorded in 14% of the cases (G1 10%, G2 2%, G3 2%. Conclusion This safety analysis shows that the adopted schedule of carboplatin plus pegylated liposomal doxorubicin given every 3 weeks is feasible as first line treatment in ovarian cancer patients, although 37% of the cycles were delayed due to haematological toxicity. Toxicities that are common with standard combination of carboplatin

Job Scheduling with Efficient Resource Monitoring in Cloud Datacenter

Directory of Open Access Journals (Sweden)

Shyamala Loganathan

2015-01-01

Full Text Available Cloud computing is an on-demand computing model, which uses virtualization technology to provide cloud resources to users in the form of virtual machines through internet. Being an adaptable technology, cloud computing is an excellent alternative for organizations for forming their own private cloud. Since the resources are limited in these private clouds maximizing the utilization of resources and giving the guaranteed service for the user are the ultimate goal. For that, efficient scheduling is needed. This research reports on an efficient data structure for resource management and resource scheduling technique in a private cloud environment and discusses a cloud model. The proposed scheduling algorithm considers the types of jobs and the resource availability in its scheduling decision. Finally, we conducted simulations using CloudSim and compared our algorithm with other existing methods, like V-MCT and priority scheduling algorithms.

PLACEMENT APPLICATIONS SCHEDULING LECTURE IN INTERNATIONAL PROGRAM UNIKOM BASED ANDROID

Directory of Open Access Journals (Sweden)

Andri Sahata Sitanggang

2017-12-01

Full Text Available One who determines life of a classroom namely mapping scheduling courses especially at college. The process scheduling has included time or schedule of a class of available, room available, lecture who is scheduled for, and schedule for lecturer going to teach. Hopefully with a scheduling it will facilitate the students and teachers in obtaining information lecture schedule. With the emergence of the android application ( is implanted in mobile phones , the public can now use the internet so fast that is based .So with that researchers give one a technology based solutions to build android application .This is because one of the technology has given the functions which may make it easier for students and university lecturers in terms of access to information. In building this application used method of the prototype consisting 2 access namely access user and admin , where module user consisting of modules register , login , scheduling module , while for admin given module login , register and arrangement information scheduling courses both the administration and lecturers .Application made will be integrated with internet so that this program is real-time application.

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.

Heuristic algorithm for single resource constrained project scheduling problem based on the dynamic programming

Directory of Open Access Journals (Sweden)

Stanimirović Ivan

2009-01-01

Full Text Available We introduce a heuristic method for the single resource constrained project scheduling problem, based on the dynamic programming solution of the knapsack problem. This method schedules projects with one type of resources, in the non-preemptive case: once started an activity is not interrupted and runs to completion. We compare the implementation of this method with well-known heuristic scheduling method, called Minimum Slack First (known also as Gray-Kidd algorithm, as well as with Microsoft Project.

A Mechanized Decision Support System for Academic Scheduling.

Science.gov (United States)

1986-03-01

an operational system called software. The first step in the development phase is Design . Designers destribute software control by factoring the Data...SUBJECT TERMS (Continue on reverse if necessary and identify by block number) ELD GROUP SUB-GROUP Scheduling, Decision Support System , Software Design ...scheduling system . It will also examine software - design techniques to identify the most appropriate method- ology for this problem. " - Chapter 3 will

Seizure threshold and the half-age method in bilateral electroconvulsive therapy in Japanese patients.

Science.gov (United States)

Yasuda, Kazuyuki; Kobayashi, Kaoru; Yamaguchi, Masayasu; Tanaka, Koichi; Fujii, Tomokazu; Kitahara, Yuichi; Tamaoki, Toshio; Matsushita, Yutaka; Nunomura, Akihiko; Motohashi, Nobutaka

2015-01-01

Seizure threshold (ST) in electroconvulsive therapy (ECT) has not been reported previously in Japanese patients. We investigated ST in bilateral ECT in Japanese patients using the dose-titration method. The associations between demographic and clinical characteristics and ST were analyzed to identify the predictors of ST. Finally, the validity of the half-age method for the stimulus dose was evaluated. Fifty-four Japanese patients with mood disorder, schizophrenia, and other psychotic disorders received an acute course of bilateral ECT using a brief-pulse device. ST was determined at the first session using a fixed titration schedule. ST was correlated with age, sex, body mass index, history of previous ECT, and psychotropic drugs on multiple regression analysis. Furthermore, the rate of accomplished seizures was calculated using the half-age method. Mean ST was 136 mC. ST was influenced by age, sex, history of previous ECT, and medication with benzodiazepines. The accomplished seizure rate using the half-age method was 72%, which was significantly lower in men and subjects on benzodiazepines. ST in Japanese patients was equal to or slightly higher than that previously reported in other ethnic groups, which might be attributable, at least in part, to high prevalence of and large-dose benzodiazepine prescription. Higher age, male gender, no history of ECT, and benzodiazepines were related to higher ST. The half-age method was especially useful in female patients and subjects without benzodiazepine medication. © 2014 The Authors. Psychiatry and Clinical Neurosciences © 2014 Japanese Society of Psychiatry and Neurology.

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.

Taking the lag out of jet lag through model-based schedule design.

Directory of Open Access Journals (Sweden)

Dennis A Dean

2009-06-01

Full Text Available Travel across multiple time zones results in desynchronization of environmental time cues and the sleep-wake schedule from their normal phase relationships with the endogenous circadian system. Circadian misalignment can result in poor neurobehavioral performance, decreased sleep efficiency, and inappropriately timed physiological signals including gastrointestinal activity and hormone release. Frequent and repeated transmeridian travel is associated with long-term cognitive deficits, and rodents experimentally exposed to repeated schedule shifts have increased death rates. One approach to reduce the short-term circadian, sleep-wake, and performance problems is to use mathematical models of the circadian pacemaker to design countermeasures that rapidly shift the circadian pacemaker to align with the new schedule. In this paper, the use of mathematical models to design sleep-wake and countermeasure schedules for improved performance is demonstrated. We present an approach to designing interventions that combines an algorithm for optimal placement of countermeasures with a novel mode of schedule representation. With these methods, rapid circadian resynchrony and the resulting improvement in neurobehavioral performance can be quickly achieved even after moderate to large shifts in the sleep-wake schedule. The key schedule design inputs are endogenous circadian period length, desired sleep-wake schedule, length of intervention, background light level, and countermeasure strength. The new schedule representation facilitates schedule design, simulation studies, and experiment design and significantly decreases the amount of time to design an appropriate intervention. The method presented in this paper has direct implications for designing jet lag, shift-work, and non-24-hour schedules, including scheduling for extreme environments, such as in space, undersea, or in polar regions.

Interprovider Communication Using a Scheduled Provider Alert-Response Communication System in 3 Inpatient Neurology Units.

Science.gov (United States)

Siegler, James E; Finegan, Dan; Kasner, Scott E; Price, Raymond S

2017-10-01

Nonemergent communications between nursing staff and residents often occur randomly throughout the workday at teaching institutions, resulting in inefficiency and interruptions of scheduled resident educational conferences or periods of overnight rest. The aim of this study was to determine whether a quality improvement communication strategy can reduce interruptive notifications during scheduled resident didactic sessions. We conducted a prospective, mixed-methods trial of a communication strategy between nurses and residents in 3 neurology units of an academic institution. We measured content and volume of notifications from nurses to residents during scheduled conferences and overnight and categorized these notifications according to levels of urgency. We implemented an intervention requiring multidisciplinary evening work rounds between the on-call resident and charge nurse and batching of nonemergent communications. Survey data were collected. The total census during the 6-month study period was 728 patients. Of the 704 resident-reported nursing notifications, 50% could be safely deferred until change of shift. After the intervention, there was a 52% decrement of notifications (0.52 vs 0.25 notifications per patient, P communication system reduced interruptive calls during educational conferences and overnight by half. This intervention was perceived as safe and effective and resulted in higher satisfaction among participants.

Robust Optimization-Based Generation Self-Scheduling under Uncertain Price

Directory of Open Access Journals (Sweden)

Xiao Luo

2011-01-01

Full Text Available This paper considers generation self-scheduling in electricity markets under uncertain price. Based on the robust optimization (denoted as RO methodology, a new self-scheduling model, which has a complicated max-min optimization structure, is set up. By using optimal dual theory, the proposed model is reformulated to an ordinary quadratic and quadratic cone programming problems in the cases of box and ellipsoidal uncertainty, respectively. IEEE 30-bus system is used to test the new model. Some comparisons with other methods are done, and the sensitivity with respect to the uncertain set is analyzed. Comparing with the existed uncertain self-scheduling approaches, the new method has twofold characteristics. First, it does not need a prediction of distribution of random variables and just requires an estimated value and the uncertain set of power price. Second, the counterpart of RO corresponding to the self-scheduling is a simple quadratic or quadratic cone programming. This indicates that the reformulated problem can be solved by many ordinary optimization algorithms.

Scheduled, intermittent stimulation of the thalamus reduces tics in Tourette syndrome.

Science.gov (United States)

Rossi, P Justin; Opri, Enrico; Shute, Jonathan B; Molina, Rene; Bowers, Dawn; Ward, Herbert; Foote, Kelly D; Gunduz, Aysegul; Okun, Michael S

2016-08-01

Personalized, scheduled deep brain stimulation in Tourette syndrome (TS) may permit clinically meaningful tic reduction while reducing side effects and increasing battery life. Here, we evaluate scheduled DBS applied to TS at two-year follow-up. Five patients underwent bilateral centromedian thalamic (CM) region DBS. A cranially contained constant-current device delivering stimulation on a scheduled duty cycle, as opposed to the standard continuous DBS paradigm was utilized. Baseline vs. 24-month outcomes were collected and analyzed, and a responder analysis was performed. A 40% improvement in the Modified Rush Tic Rating Scale (MRTRS) total score or Yale Global Tic Severity Scale (YGTSS) total score defined a full responder. Three of the 4 patients followed to 24 months reached full responder criteria and had a mean stimulation time of 1.85 h per day. One patient lost to follow-up evaluated at the last time point (month 18) was a non-responder. Patients exhibited improvements in MRTRS score beyond the improvements previously reported for the 6 month endpoint; on average, MRTRS total score was 15.6% better at 24 months than at 6 months and YGTSS total score was 14.8% better. Combining the patients into a single cohort revealed significant improvements in the MRTRS total score (-7.6 [5.64]; p = 0.02). Electrical stimulation of the centromedian thalamic region in a scheduled paradigm was effective in suppressing tics, particularly phonic tics. Full responders were able to achieve the positive DBS effect with a mean of 2.3 ± 0.9 (SEM) hours of DBS per day. Copyright © 2016 Elsevier Ltd. All rights reserved.

A Form 990 Schedule H conundrum: how much of your bad debt might be charity?

Science.gov (United States)

Bailey, Shari; Franklin, David; Hearle, Keith

2010-04-01

IRS Form 990 Schedule H requires hospitals to estimate the amount of bad debt expense attributable to patients eligible for charity under the hospital's charity care policy. Responses to Schedule H, Part III.A.3 open up the entire patient collection process to examination by the IRS, state officials, and the public. Using predictive analytics can help hospitals efficiently identify charity-eligible patients when answering Part III.A.3.

Production planning and scheduling in refinery industry

International Nuclear Information System (INIS)

Persson, Jan.

1999-01-01

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

Production planning and scheduling in refinery industry

Energy Technology Data Exchange (ETDEWEB)

Persson, Jan

1999-07-01

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

Production planning and scheduling in refinery industry

Energy Technology Data Exchange (ETDEWEB)

Persson, Jan

1999-06-01

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

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

Thermal Unit Commitment Scheduling Problem in Utility System by Tabu Search Embedded Genetic Algorithm Method

Directory of Open Access Journals (Sweden)

C. Christober Asir Rajan

2008-06-01

Full Text Available The objective of this paper is to find the generation scheduling such that the total operating cost can be minimized, when subjected to a variety of constraints. This also means that it is desirable to find the optimal unit commitment in the power system for the next H hours. A 66-bus utility power system in India demonstrates the effectiveness of the proposed approach; extensive studies have also been performed for different IEEE test systems consist of 24, 57 and 175 buses. Numerical results are shown comparing the cost solutions and computation time obtained by different intelligence and conventional methods.

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

Modafinil reduces patient-reported tiredness after sedation/analgesia but does not improve patient psychomotor skills.

NARCIS (Netherlands)

Galvin, E.; Boesjes, H.; Hol, J.; Ubben, J.F.; Klein-Nulend, J.; Verbrugge, S.J.

2010-01-01

BACKGROUND: Early recovery of patients following sedation/analgesia and anesthesia is important in ambulatory practice. The aim of this study was to assess whether modafinil, used for the treatment of narcolepsy, improves recovery following sedation/analgesia. METHODS: Patients scheduled for

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.

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.

Optimal Scheduling of Residential Microgrids Considering Virtual Energy Storage System

Directory of Open Access Journals (Sweden)

Weiliang Liu

2018-04-01

Full Text Available The increasingly complex residential microgrids (r-microgrid consisting of renewable generation, energy storage systems, and residential buildings require a more intelligent scheduling method. Firstly, aiming at the radiant floor heating/cooling system widely utilized in residential buildings, the mathematical relationship between the operative temperature and heating/cooling demand is established based on the equivalent thermodynamic parameters (ETP model, by which the thermal storage capacity is analyzed. Secondly, the radiant floor heating/cooling system is treated as virtual energy storage system (VESS, and an optimization model based on mixed-integer nonlinear programming (MINLP for r-microgrid scheduling is established which takes thermal comfort level and economy as the optimization objectives. Finally, the optimal scheduling results of two typical r-microgrids are analyzed. Case studies demonstrate that the proposed scheduling method can effectively employ the thermal storage capacity of radiant floor heating/cooling system, thus lowering the operating cost of the r-microgrid effectively while ensuring the thermal comfort level of users.

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.

Optimal scheduling for distribution network with redox flow battery storage

International Nuclear Information System (INIS)

Hosseina, Majid; Bathaee, Seyed Mohammad Taghi

2016-01-01

Highlights: • A novel method for optimal scheduling of storages in radial network is presented. • Peak shaving and load leveling are the main objectives. • Vanadium redox flow battery is considered as the energy storage unit. • Real data is used for simulation. - Abstract: There are many advantages to utilize storages in electric power system. Peak shaving, load leveling, load frequency control, integration of renewable, energy trading and spinning reserve are the most important of them. Batteries, especially redox flow batteries, are one of the appropriate storages for utilization in distribution network. This paper presents a novel, heuristic and practical method for optimal scheduling in distribution network with flow battery storage. This heuristic method is more suitable for scheduling and operation of distribution networks which require installation of storages. Peak shaving and load leveling is considered as the main objective in this paper. Several indices are presented in this paper for determine the place of storages and also scheduling for optimal use of energy in them. Simulations of this paper are based on real information of distribution network substation that located in Semnan, Iran.

Optimal OFDMA Downlink Scheduling Under a Control Signaling Cost Constraint

OpenAIRE

Larsson, Erik G.

2010-01-01

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

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.

EFFICIENT MULTI-OBJECTIVE EVOLUTIONARY ALGORITHM FOR JOB SHOP SCHEDULING

Institute of Scientific and Technical Information of China (English)

Lei Deming; Wu Zhiming

2005-01-01

A new representation method is first presented based on priority rules. According to this method, each entry in the chromosome indicates that in the procedure of the Giffler and Thompson (GT) algorithm, the conflict occurring in the corresponding machine is resolved by the corresponding priority rule. Then crowding-measure multi-objective evolutionary algorithm (CMOEA) is designed,in which both archive maintenance and fitness assignment use crowding measure. Finally the comparisons between CMOEA and SPEA in solving 15 scheduling problems demonstrate that CMOEA is suitable to job shop scheduling.

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

An improved formulation of the underground mine scheduling ...

African Journals Online (AJOL)

2014-06-12

Jun 12, 2014 ... the mine scheduling optimisation problem for both open pit and ... that involves the iterative solving of the linear programming ... methods is discussed in §4 and the concept of a mining-method-dependent grade tonnage.

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.

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

Analysis for Involvement of TPP Operating in Accordance with Heating Schedule to Passing Through Failures of Electric Load Schedules

Directory of Open Access Journals (Sweden)

V. I. Nazarov

2013-01-01

Full Text Available The paper describes technical and economic evaluation of various methods pertaining to passing through failures of electric load at TPP which is operating in accordance with heating schedule.

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

Load scheduling for decentralized CHP plants

DEFF Research Database (Denmark)

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

) an interactive decision support tool by which optimal schedules can be found given the forecasts or user-defined modifications of the forecasts, and (iii) an automatic on-line system for monitoring when conditions have changed so that rescheduling is appropriate. In this report the focus is on methods applicable...... be obtained. Furthermore, we believe that all relevant forecasting methods are far too complicated to allow for this integration; both uncertainties originating from the dependence of heat load on climate and from meteorological forecasts need to be taken into account. Instead we suggest that the decision....... By letting the system find optimal schedules for each of these realizations the operator can gain some insight into the importance of the uncertainties. It is shown that with modern personal computers (e.g. 1 GHz Pentium III), operating systems (e.g. RedHat Linux 6.0), and compilers (e.g. GNU C 2...

Research on optimizing pass schedule of tandem cold mill

International Nuclear Information System (INIS)

Lu, C.; Wang, J.S.; Zhao, Q.L.; Liu, X.H.; Wang, G.D.

2000-01-01

In this paper, research on pass schedule of tandem cold mill (TCM) is carried out. According to load (reduction, rolling force, motor power) balance, non-linear equations set with variables of inter-stand thickness is constructed. The pass schedule optimization is carried out by solving the non-linear equations set. As the traditional method, the Newton-Raphson method is used for solving the non-linear equations set. In this paper a new simple method is brought up. On basis of the monotone relations between thickness and load, the inter-stands thickness is adjusted dynamically. The solution of non-linear equations set can be converged by iterative calculation. This method can avoid the derivative calculation used by traditional method. So, this method is simple and calculation speed is high. It is suitable for on-line control. (author)

A comparison of two exact methods for passenger railway rolling stock (re)scheduling

DEFF Research Database (Denmark)

Haahr, Jørgen Thorlund; Wagenaar, Joris C.; Veelenturf, Lucas P.

2016-01-01

The assignment of rolling stock units to timetable services in passenger railways is an important optimization problem that has been addressed by many papers in different forms. Solution approaches have been proposed for different planning phases: strategic, tactical, operational, and real...... is solved using a column and row generation approach. In this paper, we benchmark the performance of the methods on networks of two countries (Denmark and The Netherlands). We use the approaches to make daily schedules and we test their real time applicability by performing tests with different disruption...... scenarios. The computational experiments demonstrate that both models can be used on both networks and are able to find optimal rolling stock circulations in the different planning phases. Furthermore, the results show that both approaches are sufficiently fast to be used in a real-time setting....

Integrated network design and scheduling problems :

Energy Technology Data Exchange (ETDEWEB)

Nurre, Sarah G.; Carlson, Jeffrey J.

2014-01-01

We consider the class of integrated network design and scheduling problems. These problems focus on selecting and scheduling operations that will change the characteristics of a network, while being speci cally concerned with the performance of the network over time. Motivating applications of INDS problems include infrastructure restoration after extreme events and building humanitarian distribution supply chains. While similar models have been proposed, no one has performed an extensive review of INDS problems from their complexity, network and scheduling characteristics, information, and solution methods. We examine INDS problems under a parallel identical machine scheduling environment where the performance of the network is evaluated by solving classic network optimization problems. We classify that all considered INDS problems as NP-Hard and propose a novel heuristic dispatching rule algorithm that selects and schedules sets of arcs based on their interactions in the network. We present computational analysis based on realistic data sets representing the infrastructures of coastal New Hanover County, North Carolina, lower Manhattan, New York, and a realistic arti cial community CLARC County. These tests demonstrate the importance of a dispatching rule to arrive at near-optimal solutions during real-time decision making activities. We extend INDS problems to incorporate release dates which represent the earliest an operation can be performed and exible release dates through the introduction of specialized machine(s) that can perform work to move the release date earlier in time. An online optimization setting is explored where the release date of a component is not known.

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

Maternal Nonstandard Work Schedules and Breastfeeding Behaviors.

Science.gov (United States)

Zilanawala, Afshin

2017-06-01

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

Integrating Preventive Maintenance Scheduling As Probability Machine Failure And Batch Production Scheduling

Directory of Open Access Journals (Sweden)

Zahedi Zahedi

2016-06-01

Full Text Available This paper discusses integrated model of batch production scheduling and machine maintenance scheduling. Batch production scheduling uses minimize total actual flow time criteria and machine maintenance scheduling uses the probability of machine failure based on Weibull distribution. The model assumed no nonconforming parts in a planning horizon. The model shows an increase in the number of the batch (length of production run up to a certain limit will minimize the total actual flow time. Meanwhile, an increase in the length of production run will implicate an increase in the number of PM. An example was given to show how the model and algorithm work.

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.

Job shop scheduling with makespan objective: A heuristic approach

Directory of Open Access Journals (Sweden)

Mohsen Ziaee

2014-04-01

Full Text Available Job shop has been considered as one of the most challenging scheduling problems and there are literally tremendous efforts on reducing the complexity of solution procedure for solving job shop problem. This paper presents a heuristic method to minimize makespan for different jobs in a job shop scheduling. The proposed model is based on a constructive procedure to obtain good quality schedules, very quickly. The performance of the proposed model of this paper is examined on standard benchmarks from the literature in order to evaluate its performance. Computational results show that, despite its simplicity, the proposed heuristic is computationally efficient and practical approach for the problem.

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.

Management implications for the perioperative surgical home related to inpatient case cancellations and add-on case scheduling on the day of surgery.

Science.gov (United States)

Epstein, Richard H; Dexter, Franklin

2015-07-01

The American Society of Anesthesiologists has embraced the concept of the Perioperative Surgical Home as a means through which anesthesiologists can add value to the health systems in which they practice. One key listed element of the Perioperative Surgical Home is to support "scheduling initiatives to reduce cancellations and increase efficiency." In this study, we explored the potential benefits of the Perioperative Surgical Home with respect to inpatient cancellations and add-on case scheduling. We evaluated 6 hypotheses related to the timing of inpatient cancellations and preoperative anesthesia evaluations. Inpatient cancellations were studied during 26 consecutive 4-week intervals between July 2012 and June 2014 at a tertiary care academic hospital. All timestamps related to scheduling, rescheduling, and cancellation activities were retrieved from the operating room (OR) case scheduling system. Timestamps when patients were seen by anesthesia residents were obtained from the preoperative evaluation system database. Batch mean methods were used to calculate means and SE. For cases cancelled, we determined whether, for "most" (>50%) cancellations, a subsequent procedure (of any type) was performed on the patient within 7 days of the cancellation. Comparisons with most and other fractions were assessed using the 1 group, 1-sided Student t test. We evaluated whether a few procedures were highly represented among the cancelled cases via the Herfindahl (Simpson's) index, comparing it with Data from 24,735 scheduled inpatient cases were assessed. Cases cancelled after 7 AM on the day before or at any time on the scheduled day of surgery accounted for 22.6% ± 0.5% (SE) of the scheduled minutes all scheduled cases, and 26.8% ± 0.4% of the case volume (i.e., number of cases). Most (83.1% ± 0.6%, P 50%, P = 0.12), implying that the indication for the cancelled procedure no longer existed or the patient/family decided not to proceed with surgery. When only

DLTAP: A Network-efficient Scheduling Method for Distributed Deep Learning Workload in Containerized Cluster Environment

OpenAIRE

Qiao Wei; Li Ying; Wu Zhong-Hai

2017-01-01

Deep neural networks (DNNs) have recently yielded strong results on a range of applications. Training these DNNs using a cluster of commodity machines is a promising approach since training is time consuming and compute-intensive. Furthermore, putting DNN tasks into containers of clusters would enable broader and easier deployment of DNN-based algorithms. Toward this end, this paper addresses the problem of scheduling DNN tasks in the containerized cluster environment. Efficiently scheduling ...

Evaluation of nutritional screening tools among patients scheduled for heart valve surgery.

Science.gov (United States)

Lomivorotov, Vladimir V; Efremov, Sergey M; Boboshko, Vladimir A; Nikolaev, Dmitry A; Vedernikov, Pavel E; Shilova, Anna N; Lomivorotov, Vladimir N; Karaskov, Alexander M

2013-03-01

The study aim was to detect the most sensitive nutritional screening tool and to assess its prognostic value with regards to an adverse clinical course in patients with heart valve disease undergoing cardiopulmonary bypass (CPB). This prospective cohort study included 441 adult patients who were screened using four nutritional screening tools: Nutritional Risk Screening 2002 (NRS-2002); Malnutrition Universal Screening Tool (MUST); Mini Nutritional Assessment (MNA); and Short Nutritional Assessment Questionnaire (SNAQ). Nutritional assessment was performed using a Subjective Global Assessment (SGA). In-hospital mortality, postoperative complications, and duration of hospital stay were each analyzed. With regards to the detection of malnutrition, the sensitivities of MUST, SNAQ, MNA and NRS-2002 were 100%, 92%, 84.6% and 43.6%, respectively. Malnutrition identified by MUST and MNA were associated with postoperative complications (OR 1.63, p = 0.033 and OR 1.6, p = 0.035) and prolonged hospitalization (OR 1.57, p = 0.048 and OR 1.7, p = 0.02). According to multivariate logistic regression analysis, along with well-known age and duration of CPB, malnutrition identified by MUST and MNA was associated with a risk of development of complications (OR 1.6, p = 0.049 and OR 1.6, p = 0.04, respectively). The sensitivities of SNAQ, MUST, NRS-2002 and MNA with regards to postoperative complications were 26.8%, 28.8%, 10%, and 31.6%, respectively. The MUST tool is preferable with regards to the detection of malnutrition. Both, MUST and MNA independently predicted postoperative complications. SNAQ and NRS-2002 proved insensitive with regards to the postoperative course among patients with heart valve disease who were scheduled for cardiothoracic surgery.

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

An Improved Recovery Algorithm for Decayed AES Key Schedule Images

Science.gov (United States)

Tsow, Alex

A practical algorithm that recovers AES key schedules from decayed memory images is presented. Halderman et al. [1] established this recovery capability, dubbed the cold-boot attack, as a serious vulnerability for several widespread software-based encryption packages. Our algorithm recovers AES-128 key schedules tens of millions of times faster than the original proof-of-concept release. In practice, it enables reliable recovery of key schedules at 70% decay, well over twice the decay capacity of previous methods. The algorithm is generalized to AES-256 and is empirically shown to recover 256-bit key schedules that have suffered 65% decay. When solutions are unique, the algorithm efficiently validates this property and outputs the solution for memory images decayed up to 60%.

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.

CQPSO scheduling algorithm for heterogeneous multi-core DAG task model

Science.gov (United States)

Zhai, Wenzheng; Hu, Yue-Li; Ran, Feng

2017-07-01

Efficient task scheduling is critical to achieve high performance in a heterogeneous multi-core computing environment. The paper focuses on the heterogeneous multi-core directed acyclic graph (DAG) task model and proposes a novel task scheduling method based on an improved chaotic quantum-behaved particle swarm optimization (CQPSO) algorithm. A task priority scheduling list was built. A processor with minimum cumulative earliest finish time (EFT) was acted as the object of the first task assignment. The task precedence relationships were satisfied and the total execution time of all tasks was minimized. The experimental results show that the proposed algorithm has the advantage of optimization abilities, simple and feasible, fast convergence, and can be applied to the task scheduling optimization for other heterogeneous and distributed environment.

Phase I and pharmacokinetic trial of carboplatin and albumin-bound paclitaxel, ABI-007 (Abraxane®) on three treatment schedules in patients with solid tumors

Science.gov (United States)

Stinchcombe, Thomas E.; Socinski, Mark A.; Walko, Christine M.; O’Neil, Bert H.; Collichio, Frances A.; Ivanova, Anastasia; Mu, Hua; Hawkins, Michael J.; Goldberg, Richard M.; Lindley, Celeste; Dees, E Claire

2010-01-01

Purpose Albumin-bound paclitaxel, ABI-007 (Abraxane ®), has a different toxicity profile than solvent-based paclitaxel, including a lower rate of severe neutropenia. The combination of ABI-007 and carboplatin may have significant activity in a variety of tumor types including non-small and small cell lung cancer, ovarian cancer, and breast cancer. The purpose of this study was to determine the maximum tolerated dose (MTD) of ABI-007, on three different schedules in combination with carboplatin. Methods Forty-one patients with solid tumors were enrolled, and received ABI-007 in combination with carboplatin AUC of 6 on day 1. Group A received ABI-007 at doses ranging from 220 to 340 mg/m2 on day 1 every 21 days; group B received ABI-007 at 100 or 125 mg/m2 on days 1, 8, and 15 every 28 days; and group C received ABI-007 125 or 150 mg/m2 on days 1 and 8 every 21 days. Dose-limiting toxicities were assessed after the first cycle. Doses were escalated in cohorts of three to six patients. Fifteen patients participated in a pharmacokinetic study investigating the effects of the sequence of infusion. ABI-007 was infused first followed by carboplatin in cycle 1, and vice versa in cycle 2. Results The MTD of ABI-007 in combination with carboplatin was 300, 100, and 125 mg/m2 in groups A, B, and C, respectively. Myelosuppression was the primary dose limiting toxicity. No unexpected or new toxicities were reported. Sequence of infusion did not affect either the pharmacokinetics of ABI-007 or the degree of neutropenia. Responses were seen in melanoma, lung, bladder, esophageal, pancreatic, breast cancer, and cancer of unknown primary. Conclusions The recommended dose for phase II studies of ABI-007 in combination with carboplatin (AUC of 6) is 300, 100, 125 mg/m2 for the schedules A, B, and C, respectively. The combination of ABI-007 and carboplatin is well tolerated and active in this heavily pretreated patient population. PMID:17285317

A subjective scheduler for subjective dedicated networks

Science.gov (United States)

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

2017-09-01

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

A simple method of alignment for pelvic irradiation in obese patients

International Nuclear Information System (INIS)

Sweigart, Kenneth

2002-01-01

Administering radiation therapy to obese pelvic patients can pose a difficult challenge to even the veteran radiation therapist. Daily reproducibility can be achieved with the sacrifice of additional time and filming. We have developed a technique which has shown consistent reproducibility of the radiation treatments with a minimum of inconvenience to busy schedules

Supporting Real-Time Operations and Execution through Timeline and Scheduling Aids

Science.gov (United States)

Marquez, Jessica J.; Pyrzak, Guy; Hashemi, Sam; Ahmed, Samia; McMillin, Kevin Edward; Medwid, Joseph Daniel; Chen, Diana; Hurtle, Esten

2013-01-01

Since 2003, the NASA Ames Research Center has been actively involved in researching and advancing the state-of-the-art of planning and scheduling tools for NASA mission operations. Our planning toolkit SPIFe (Scheduling and Planning Interface for Exploration) has supported a variety of missions and field tests, scheduling activities for Mars rovers as well as crew on-board International Space Station and NASA earth analogs. The scheduled plan is the integration of all the activities for the day/s. In turn, the agents (rovers, landers, spaceships, crew) execute from this schedule while the mission support team members (e.g., flight controllers) follow the schedule during execution. Over the last couple of years, our team has begun to research and validate methods that will better support users during realtime operations and execution of scheduled activities. Our team utilizes human-computer interaction principles to research user needs, identify workflow processes, prototype software aids, and user test these. This paper discusses three specific prototypes developed and user tested to support real-time operations: Score Mobile, Playbook, and Mobile Assistant for Task Execution (MATE).

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

Prospective Randomized Controlled Study on the Efficacy of Multimedia Informed Consent for Patients Scheduled to Undergo Green-Light High-Performance System Photoselective Vaporization of the Prostate

Directory of Open Access Journals (Sweden)

Dong Yeub Ham

2016-04-01

Full Text Available Purpose: The aim of this study was to evaluate the efficacy of a multimedia informed consent (IC presentation on the understanding and satisfaction of patients who were scheduled to receive 120-W green-light high-performance system photoselective vaporization of the prostate (HPS-PVP. Materials and Methods: A multimedia IC (M-IC presentation for HPS-PVP was developed. Forty men with benign prostatic hyperplasia who were scheduled to undergo HPS-PVP were prospectively randomized to a conventional written IC group (W-IC group, n=20 or the M-IC group (n=20. The allocated IC was obtained by one certified urologist, followed by a 15-question test (maximum score, 15 to evaluate objective understanding, and questionnaires on subjective understanding (range, 0∼10 and satisfaction (range, 0∼10 using a visual analogue scale. Results: Demographic characteristics, including age and the highest level of education, did not significantly differ between the two groups. No significant differences were found in scores reflecting the objective understanding of HPS-PVP (9.9±2.3 vs. 10.6±2.8, p=0.332 or in subjective understanding scores (7.5±2.1 vs. 8.6±1.7, p=0.122; however, the M-IC group showed higher satisfaction scores than the W-IC group (7.4±1.7 vs. 8.4±1.5, p=0.033. After adjusting for age and educational level, the M-IC group still had significantly higher satisfaction scores. Conclusions: M-IC did not enhance the objective knowledge of patients regarding this surgical procedure. However, it improved the satisfaction of patients with the IC process itself.

Prospective Randomized Controlled Study on the Efficacy of Multimedia Informed Consent for Patients Scheduled to Undergo Green-Light High-Performance System Photoselective Vaporization of the Prostate

Science.gov (United States)

Ham, Dong Yeub; Choi, Woo Suk; Song, Sang Hoon; Ahn, Young-Joon; Park, Hyoung Keun; Kim, Hyeong Gon

2016-01-01

Purpose The aim of this study was to evaluate the efficacy of a multimedia informed consent (IC) presentation on the understanding and satisfaction of patients who were scheduled to receive 120-W green-light high-performance system photoselective vaporization of the prostate (HPS-PVP). Materials and Methods A multimedia IC (M-IC) presentation for HPS-PVP was developed. Forty men with benign prostatic hyperplasia who were scheduled to undergo HPS-PVP were prospectively randomized to a conventional written IC group (W-IC group, n=20) or the M-IC group (n=20). The allocated IC was obtained by one certified urologist, followed by a 15-question test (maximum score, 15) to evaluate objective understanding, and questionnaires on subjective understanding (range, 0~10) and satisfaction (range, 0~10) using a visual analogue scale. Results Demographic characteristics, including age and the highest level of education, did not significantly differ between the two groups. No significant differences were found in scores reflecting the objective understanding of HPS-PVP (9.9±2.3 vs. 10.6±2.8, p=0.332) or in subjective understanding scores (7.5±2.1 vs. 8.6±1.7, p=0.122); however, the M-IC group showed higher satisfaction scores than the W-IC group (7.4±1.7 vs. 8.4±1.5, p=0.033). After adjusting for age and educational level, the M-IC group still had significantly higher satisfaction scores. Conclusions M-IC did not enhance the objective knowledge of patients regarding this surgical procedure. However, it improved the satisfaction of patients with the IC process itself. PMID:27169129

An original accelerated radiotherapy schedule in stage III to IV head and neck cancers. Results in a multicenter setting

International Nuclear Information System (INIS)

Allal, A.S.

2000-01-01

Background: Accelerated radiotherapy delivery has recently been shown to be effective in overcoming repopulation during fractionated radiotherapy. The therapeutic ratio may be particularly favorable for 5-week regimens. This study reports the feasibility and results of a particular accelerated schedule in Stage III to IV head and neck carcinomas used in a multicenter setting. Patients and Methods: Seventy-four patients with Stage III (26 patients) or IV (48 patients) head and neck carcinomas were treated with a 5-week accelerated schedule (69.9 to 69.8 Gy in 41 to 40 fractions over a period of 35 to 36 days). Treatment began with 20 Gy in 10 daily fractions to initial involved sites, followed by bi-fractionated radiotherapy (2x1.6 Gy to 1.66 Gy/day) to a larger head and neck volume. Thirty-six (49%) patients received induction chemotherapy (median 3 cycles, range 1 to 4 cycles). Results: Grade 3 or 4 (RTOG) confluent mucositis was observed in 57 patients (77%) and Grade 3 dysphagia in 33 patients (44%). Grade 3 or 4 (RTOG-EORTC) late complications were scored in 10.5% of cases. The 5-year actuarial locoregional control rate was 56% (95% CI: 42 to 71). The 5-year overall actuarial survival was 32% (95% CI: 18 to 46). Induction chemotherapy was not associated with a more favorable outcome. Conclusions: This study demonstrates the feasibility of this schedule in a multicenter setting. The oncologic results appear similar to those obtained by other accelerated regimens, while the rate of late complications seems acceptable. Five-week accelerated regimens warrant further evaluation, particularly in conjunction with concomitant chemotherapy, in the framework of prospective trials. (orig.) [de

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

Novel Hybrid Scheduling Technique for Sensor Nodes with Mixed Criticality Tasks

Directory of Open Access Journals (Sweden)

Mihai-Victor Micea

2017-06-01

Full Text Available Sensor networks become increasingly a key technology for complex control applications. Their potential use in safety- and time-critical domains has raised the need for task scheduling mechanisms specially adapted to sensor node specific requirements, often materialized in predictable jitter-less execution of tasks characterized by different criticality levels. This paper offers an efficient scheduling solution, named Hybrid Hard Real-Time Scheduling (H2RTS, which combines a static, clock driven method with a dynamic, event driven scheduling technique, in order to provide high execution predictability, while keeping a high node Central Processing Unit (CPU utilization factor. From the detailed, integrated schedulability analysis of the H2RTS, a set of sufficiency tests are introduced and demonstrated based on the processor demand and linear upper bound metrics. The performance and correct behavior of the proposed hybrid scheduling technique have been extensively evaluated and validated both on a simulator and on a sensor mote equipped with ARM7 microcontroller.

Novel Hybrid Scheduling Technique for Sensor Nodes with Mixed Criticality Tasks.

Science.gov (United States)

Micea, Mihai-Victor; Stangaciu, Cristina-Sorina; Stangaciu, Valentin; Curiac, Daniel-Ioan

2017-06-26

Sensor networks become increasingly a key technology for complex control applications. Their potential use in safety- and time-critical domains has raised the need for task scheduling mechanisms specially adapted to sensor node specific requirements, often materialized in predictable jitter-less execution of tasks characterized by different criticality levels. This paper offers an efficient scheduling solution, named Hybrid Hard Real-Time Scheduling (H²RTS), which combines a static, clock driven method with a dynamic, event driven scheduling technique, in order to provide high execution predictability, while keeping a high node Central Processing Unit (CPU) utilization factor. From the detailed, integrated schedulability analysis of the H²RTS, a set of sufficiency tests are introduced and demonstrated based on the processor demand and linear upper bound metrics. The performance and correct behavior of the proposed hybrid scheduling technique have been extensively evaluated and validated both on a simulator and on a sensor mote equipped with ARM7 microcontroller.

Modeling of Agile Intelligent Manufacturing-oriented Production Scheduling System

Institute of Scientific and Technical Information of China (English)

Zhong-Qi Sheng; Chang-Ping Tang; Ci-Xing Lv

2010-01-01

Agile intelligent manufacturing is one of the new manufacturing paradigms that adapt to the fierce globalizing market competition and meet the survival needs of the enterprises, in which the management and control of the production system have surpassed the scope of individual enterprise and embodied some new features including complexity, dynamicity, distributivity, and compatibility. The agile intelligent manufacturing paradigm calls for a production scheduling system that can support the cooperation among various production sectors, the distribution of various resources to achieve rational organization, scheduling and management of production activities. This paper uses multi-agents technology to build an agile intelligent manufacturing-oriented production scheduling system. Using the hybrid modeling method, the resources and functions of production system are encapsulated, and the agent-based production system model is established. A production scheduling-oriented multi-agents architecture is constructed and a multi-agents reference model is given in this paper.

Nuclear power plant maintenance scheduling dilemma: a genetic algorithm approach

International Nuclear Information System (INIS)

Mahdavi, M.H.; Modarres, M.

2004-01-01

There are huge numbers of components scheduled for maintenance when a nuclear power plant is shut down. Among these components, a number of them are safety related which their operability as well as reliability when plant becomes up is main concerns. Not performing proper maintenance on this class of components/system would impose substantial risk on operating the NPP. In this paper a new approach based on genetic algorithms is presented to optimize the NPP maintenance schedule during shutdown. following this approach the cost incurred by maintenance activities for each schedule is balanced with the risk imposed by the maintenance scheduling plan to the plant operation status when it is up. The risk model implemented in the GA scheduler as its evaluation function is developed on the basis of the probabilistic risk assessment methodology. the Ga optimizers itself is shown to be superior compared to other optimization methods such as the monte carlo technique

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

Algorithm of composing the schedule of construction and installation works

Science.gov (United States)

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

2017-10-01

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

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

Optimal trajectory planning and train scheduling for urban rail transit systems

CERN Document Server

Wang, Yihui; van den Boom, Ton; De Schutter, Bart

2016-01-01

This book contributes to making urban rail transport fast, punctual and energy-efficient –significant factors in the importance of public transportation systems to economic, environmental and social requirements at both municipal and national levels. It proposes new methods for shortening passenger travel times and for reducing energy consumption, addressing two major topics: (1) train trajectory planning: the authors derive a nonlinear model for the operation of trains and present several approaches for calculating optimal and energy-efficient trajectories within a given schedule; and (2) train scheduling: the authors develop a train scheduling model for urban rail systems and optimization approaches with which to balance total passenger travel time with energy efficiency and other costs to the operator. Mixed-integer linear programming and pseudospectral methods are among the new methods proposed for single- and multi-train systems for the solution of the nonlinear trajectory planning problem which involv...

Day-ahead resource scheduling of a renewable energy based virtual power plant

International Nuclear Information System (INIS)

Zamani, Ali Ghahgharaee; Zakariazadeh, Alireza; Jadid, Shahram

2016-01-01

Highlights: • Simultaneous energy and reserve scheduling of a VPP. • Aggregate uncertainties of electricity prices, renewable generation and load demand. • Develop a stochastic scheduling model using the point estimate method. - Abstract: The evolution of energy markets is accelerating in the direction of a greater reliance upon distributed energy resources (DERs). To manage this increasing two-way complexity, virtual power plants (VPPs) are being deployed today all over the world. In this paper, a probabilistic model for optimal day ahead scheduling of electrical and thermal energy resources in a VPP is proposed where participation of energy storage systems and demand response programs (DRPs) are also taken into account. In the proposed model, energy and reserve is simultaneously scheduled considering the uncertainties of market prices, electrical demand and intermittent renewable power generation. The Point Estimate Method (PEM) is applied in order to model the uncertainties of VPP’s scheduling problem. Moreover, the optimal reserve scheduling of VPP is presented which efficiently decreases VPP’s risk facing the unexpected fluctuations of uncertain parameters at the power delivery time. The results demonstrated that implementation of demand response programs (DRPs) would decrease total operation costs of VPP as well as its dependency on the upstream network.

Basic Features of Customer Satisfaction with Train Schedules

Science.gov (United States)

Murakoshi, Akiko; Kunimatsu, Taketoshi; Saito, Ayano

This paper aims to reveal the fundamental features of customer satisfaction with train schedules, which is one of the most basic services provided by a railway company. A customer satisfaction survey of passengers who frequently utilize three lines in the metropolitan area was conducted; we obtained the following findings: (a) out of nine factors to evaluate a train schedule from a passenger's viewpoint, the four most important ones are the frequency of trains running, punctuality, congestion rate, and time distance; (b) the ride-frequency influences the degree of satisfaction with train schedules in a particular line; and (c) it is important to set a numeric goal for the level of customer satisfaction by grasping the relationship between the transport service and a passenger's satisfaction with that service. The difference between customer satisfaction and passenger disutility is also discussed. The findings are expected to help conduct customer satisfaction surveys and also to form the basis for establishing a method by which to evaluate a train schedule from passengers' satisfaction ratings.

A Work-Demand Analysis Compatible with Preemption-Aware Scheduling for Power-Aware Real-Time Tasks

Directory of Open Access Journals (Sweden)

Da-Ren Chen

2013-01-01

Full Text Available Due to the importance of slack time utilization for power-aware scheduling algorithms,we propose a work-demand analysis method called parareclamation algorithm (PRA to increase slack time utilization of the existing real-time DVS algorithms. PRA is an online scheduling for power-aware real-time tasks under rate-monotonic (RM policy. It can be implemented and fully compatible with preemption-aware or transition-aware scheduling algorithms without increasing their computational complexities. The key technique of the heuristics method doubles the analytical interval and turns the deferrable workload out the potential slack time. Theoretical proofs show that PRA guarantees the task deadlines in a feasible RM schedule and takes linear time and space complexities. Experimental results indicate that the proposed method combining the preemption-aware methods seamlessly reduces the energy consumption by 14% on average over their original algorithms.

Multi-objective scheduling of electric vehicles in smart distribution system

International Nuclear Information System (INIS)

Zakariazadeh, Alireza; Jadid, Shahram; Siano, Pierluigi

2014-01-01

Highlights: • Environmental/economic operational scheduling of electric vehicles. • The Vehicle to Grid capability and the actual patterns of drivers are considered. • A novel conceptual model for an electric vehicle management system is proposed. - Abstract: When preparing for the widespread adoption of Electric Vehicles (EVs), an important issue is to use a proper EVs’ charging/discharging scheduling model that is able to simultaneously consider economic and environmental goals as well as technical constraints of distribution networks. This paper proposes a multi-objective operational scheduling method for charging/discharging of EVs in a smart distribution system. The proposed multi-objective framework, based on augmented ε-constraint method, aims at minimizing the total operational costs and emissions. The Vehicle to Grid (V2G) capability as well as the actual patterns of drivers are considered in order to generate the Pareto-optimal solutions. The Benders decomposition technique is used in order to solve the proposed optimization model and to convert the large scale mixed integer nonlinear problem into mixed-integer linear programming and nonlinear programming problems. The effectiveness of the proposed resources scheduling approach is tested on a 33-bus distribution test system over a 24-h period. The results show that the proposed EVs’ charging/discharging method can reduce both of operation cost and air pollutant emissions

Organisational patient management, as shown by the radiology department of a hospital

International Nuclear Information System (INIS)

Schluechtermann, J.

1990-01-01

For years now, rationalization has been the prime goal that put hospitals under pressure to establish appropriate procedures. Work scheduling is of great significance in this context, especially in the light of modified framework conditions of the hospital's financing terms. The book in hand comprehensively discusses the problem of patient flow control, which has to serve two somewhat contradictory purposes, namely to achieve best possible capacity utilization in terms of equipment and personnel, and shortest possible waiting time for patients. The contributions offered by methods of the quantitative operations analysis for problem solving are set forth, as well as the role of computerized information systems in patient-related work scheduling. As both approaches reveal considerable weak points, a concept is presented that aims at integrating patient-related appointment methods into hospital information systems. The concept is explained by the example of a radiology department. Some scheduling heuristics are set up and are verified by empirical data. (orig./HSCH) [de

An Optimal Scheduling Dispatch of a Microgrid under Risk Assessment

Directory of Open Access Journals (Sweden)

Whei-Min Lin

2018-06-01

Full Text Available This paper presents the scheduling dispatch of a microgrid (MG, while considering renewable energy, battery storage systems, and time-of-use price. For the risk evaluation of an MG, the Value-at-Risk (VAR is calculated by using the Historical Simulation Method (HSM. By considering the various confidence levels of the VAR, a scheduling dispatch model of the MG is formulated to achieve a reasonable trade-off between the risk and cost. An Improved Bee Swarm Optimization (IBSO is proposed to solve the scheduling dispatch model of the MG. In the IBSO procedure, the Sin-wave Weight Factor (SWF and Forward-Backward Control Factor (FBCF are embedded in the bee swarm of the BSO to improve the movement behaviors of each bee, specifically, its search efficiency and accuracy. The effectiveness of the IBSO is demonstrated via a real MG case and the results are compared with other methods. In either a grid-connected scenario or a stand-alone scenario, an optimal scheduling dispatch of MGs is carried out, herein, at various confidence levels of risk. The simulation results provide more information for handling uncertain environments when analyzing the VAR of MGs.

The Business Change Initiative: A Novel Approach to Improved Cost and Schedule Management

Science.gov (United States)

Shinn, Stephen A.; Bryson, Jonathan; Klein, Gerald; Lunz-Ruark, Val; Majerowicz, Walt; McKeever, J.; Nair, Param

2016-01-01

Goddard Space Flight Center's Flight Projects Directorate employed a Business Change Initiative (BCI) to infuse a series of activities coordinated to drive improved cost and schedule performance across Goddard's missions. This sustaining change framework provides a platform to manage and implement cost and schedule control techniques throughout the project portfolio. The BCI concluded in December 2014, deploying over 100 cost and schedule management changes including best practices, tools, methods, training, and knowledge sharing. The new business approach has driven the portfolio to improved programmatic performance. The last eight launched GSFC missions have optimized cost, schedule, and technical performance on a sustained basis to deliver on time and within budget, returning funds in many cases. While not every future mission will boast such strong performance, improved cost and schedule tools, management practices, and ongoing comprehensive evaluations of program planning and control methods to refine and implement best practices will continue to provide a framework for sustained performance. This paper will describe the tools, techniques, and processes developed during the BCI and the utilization of collaborative content management tools to disseminate project planning and control techniques to ensure continuous collaboration and optimization of cost and schedule management in the future.

Accounting for Inpatient Wards when developing Master Surgical Schedules

NARCIS (Netherlands)

Vanberkel, P.T.; Boucherie, Richardus J.; Hans, Elias W.; Hurink, Johann L.; van Lent, W.A.M.; van Harten, Willem H.; van Harten, Wim H.

BACKGROUND: As the demand for health care services increases, the need to improve patient flow between departments has likewise increased. Understanding how the master surgical schedule (MSS) affects the inpatient wards and exploiting this relationship can lead to a decrease in surgery

A novel schedule of accelerated partial breast radiation using intensity-modulated radiation therapy in elderly patients: survival and toxicity analysis of a prospective clinical trial

Energy Technology Data Exchange (ETDEWEB)

Sayan, Mutlay; Nelson, Carl; Gagne, Havaleh; Rubin, Deborah; Heimann, Ruth [Dept. of Radiation Oncology, University of Vermont Medical Center, Burlington (United States); Wilson, Karen [University of Vermont Cancer Center, Burlington (United States)

2017-03-15

Several accelerated partial breast radiation (APBR) techniques have been investigated in patients with early-stage breast cancer (BC); however, the optimal treatment delivery techniques remain unclear. We evaluated the feasibility and toxicity of APBR delivered using intensity-modulated radiation therapy (IMRT) in elderly patients with stage I BC, using a novel fractionation schedule. Forty-two patients aged ≥65 years, with stage I BC who underwent breast conserving surgery were enrolled in a phase I/II study evaluating APBR using IMRT. Forty eligible patients received 40 Gy in 4 Gy daily fractions. Patients were assessed for treatment related toxicities, and cosmesis, before APBR, during, and after completion of the treatment. The median age was 73 years, median tumor size 0.8 cm and the median follow-up was 54 months. The 5-year locoregional control was 97.5% and overall survival 90%. Erythema and skin pigmentation was the most common acute adverse event, reported by 27 patients (69%). Twenty-six patients (65%) reported mild pain, rated 1-4/10. This improved at last follow-up to only 2 (15%). Overall the patient and physician reported worst late toxicities were lower than the baseline and at last follow-up, patients and physicians rated cosmesis as excellent/good in 93% and 86 %, respectively. In this prospective trial, we observed an excellent rate of tumor control with daily APBR. The acceptable toxicity profile and cosmetic results of this study support the use of IMRT planned APBR with daily schedule in elderly patients with early stage BC.

An open, randomised, multicentre, phase 3 trial comparing the efficacy of two tamoxifen schedules in preventing gynaecomastia induced by bicalutamide monotherapy in prostate cancer patients.

Science.gov (United States)

Bedognetti, Davide; Rubagotti, Alessandra; Conti, Giario; Francesca, Francesco; De Cobelli, Ottavio; Canclini, Luca; Gallucci, Michele; Aragona, Francesco; Di Tonno, Pasquale; Cortellini, Pietro; Martorana, Giuseppe; Lapini, Alberto; Boccardo, Francesco

2010-02-01

Bicalutamide monotherapy is a valuable option for prostate cancer (PCa) patients who wish to avoid the consequences of androgen deprivation; however, this treatment induces gynaecomastia and mastalgia in most patients. Tamoxifen is safe and effective in preventing breast events induced by bicalutamide monotherapy without affecting antitumor activity, but possible interference between bicalutamide and tamoxifen remains a matter of concern. To reduce the exposure to tamoxifen, we considered the putative advantages of weekly administration. To compare the efficacy of two different schedules of tamoxifen in preventing breast events. Toxicity, prostate-specific antigen behaviour, and sexual-functioning scores were also evaluated. This was a noninferiority trial. From December 2003 to February 2006, 80 patients with localised/locally advanced or biochemically recurrent PCa who were also candidates for bicalutamide single therapy were randomised to receive two different schedules of tamoxifen: daily (n=41) and weekly (n=39). Median follow-up was 24.2 mo. Daily bicalutamide (150 mg) plus daily tamoxifen 20mg continuously (daily group) or the same but with tamoxifen at 20mg weekly after the first 8 wk of daily treatment (weekly group). Three patients in the weekly group and one in the daily group were discontinued for adverse events. For gynaecomastia, we used ultrasonography. For mastalgia and sexual functioning, we used questionnaires. Gynaecomastia developed in 31.7% of patients in the daily group and in 74.4% of patients in the weekly group (p<0.0001), and it was more severe in patients who switched to weekly tamoxifen (p=0.001). Mastalgia occurred in 12.2% and 46.1% of patients, respectively (p=0.001). There were no major differences among treatment schedules relative to sexual functioning scores and incidence and severity of adverse events. No differences between groups in PSA behaviour and disease progression have been detected so far. This study demonstrated that

Predicting Scheduling and Attending for an Oral Cancer Examination

Science.gov (United States)

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

2015-01-01

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

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

Pulsed dose rate and fractionated high dose rate brachytherapy: choice of brachytherapy schedules to replace low dose rate treatments

International Nuclear Information System (INIS)

Visser, Andries G.; Aardweg, Gerard J.M.J. van den; Levendag, Peter C.

1996-01-01

Purpose: Pulsed dose rate (PDR) brachytherapy is a new type of afterloading brachytherapy (BT) in which a continuous low dose rate (LDR) treatment is simulated by a series of 'pulses,' i.e., fractions of short duration (less than 0.5 h) with intervals between fractions of 1 to a few hours. At the Dr. Daniel den Hoed Cancer Center, the term 'PDR brachytherapy' is used for treatment schedules with a large number of fractions (at least four per day), while the term 'fractionated high dose rate (HDR) brachytherapy' is used for treatment schedules with just one or two brachytherapy fractions per day. Both treatments can be applied as alternatives for LDR BT. This article deals with the choice between PDR and fractionated HDR schedules and proposes possible fractionation schedules. Methods and Materials: To calculate HDR and PDR fractionation schedules with the intention of being equivalent to LDR BT, the linear-quadratic (LQ) model has been used in an incomplete repair formulation as given by Brenner and Hall, and by Thames. In contrast to earlier applications of this model, both the total physical dose and the overall time were not kept identical for LDR and HDR/PDR schedules. A range of possible PDR treatment schedules is presented, both for booster applications (in combination with external radiotherapy (ERT) and for BT applications as a single treatment. Because the knowledge of both α/β values and the half time for repair of sublethal damage (T (1(2)) ), which are required for these calculations, is quite limited, calculations regarding the equivalence of LDR and PDR treatments have been performed for a wide range of values of α/β and T (1(2)) . The results are presented graphically as PDR/LDR dose ratios and as ratios of the PDR/LDR tumor control probabilities. Results: If the condition that total physical dose and overall time of a PDR treatment must be exactly identical to the values for the corresponding LDR treatment regimen is not applied, there appears

Design Principles and Algorithms for Air Traffic Arrival Scheduling

Science.gov (United States)

Erzberger, Heinz; Itoh, Eri

2014-01-01

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

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.

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)

No exacerbation of knee joint pain and effusion following preoperative progressive resistance training in patients scheduled for total knee arthroplasty

DEFF Research Database (Denmark)

Skoffer, Birgit; Dalgas, Ulrik; Maribo, Thomas

2017-01-01

BACKGROUND: Preoperative progressive resistance training (PRT) is controversial in patients scheduled for total knee arthroplasty (TKA), because of the concern that it may exacerbate knee joint pain and effusion. OBJECTIVE: To examine if preoperative PRT initiated 5 weeks prior to TKA would 1......) exacerbate pain and knee effusion, 2) allow a progressively increased training load throughout the training period that would subsequently increase muscle strength. DESIGN: Secondary analyses from a randomized controlled trial. SETTING: University Hospital and a Regional Hospital. PATIENTS: Thirty patients...... OUTCOME MEASURES: Before and after each training session, knee joint pain rated on an 11-point scale, effusion assessed by measuring the knee joint circumference, and training load were recorded. The first and last training session were initiated by 1RM testing of unilateral leg press, knee extension...

Intelligent scheduling of execution for customized physical fitness and healthcare system.

Science.gov (United States)

Huang, Chung-Chi; Liu, Hsiao-Man; Huang, Chung-Lin

2015-01-01

Physical fitness and health of white collar business person is getting worse and worse in recent years. Therefore, it is necessary to develop a system which can enhance physical fitness and health for people. Although the exercise prescription can be generated after diagnosing for customized physical fitness and healthcare. It is hard to meet individual execution needs for general scheduling of physical fitness and healthcare system. So the main purpose of this research is to develop an intelligent scheduling of execution for customized physical fitness and healthcare system. The results of diagnosis and prescription for customized physical fitness and healthcare system will be generated by fuzzy logic Inference. Then the results of diagnosis and prescription for customized physical fitness and healthcare system will be scheduled and executed by intelligent computing. The scheduling of execution is generated by using genetic algorithm method. It will improve traditional scheduling of exercise prescription for physical fitness and healthcare. Finally, we will demonstrate the advantages of the intelligent scheduling of execution for customized physical fitness and healthcare system.

Robust optimization for load scheduling of a smart home with photovoltaic system

International Nuclear Information System (INIS)

Wang, Chengshan; Zhou, Yue; Jiao, Bingqi; Wang, Yamin; Liu, Wenjian; Wang, Dan

2015-01-01

Highlights: • Robust household load scheduling is presented for smart homes with PV system. • A robust counterpart is formulated to deal with PV output uncertainty. • The robust counterpart is finally transformed to a quadratic programming problem. • Load schedules with different robustness can be made by the proposed method. • Feed-in tariff and PV output would affect the significance of the proposed method. - Abstract: In this paper, a robust approach is developed to tackle the uncertainty of PV power output for load scheduling of smart homes integrated with household PV system. Specifically, a robust formulation is proposed and further transformed to an equivalent quadratic programming problem. Day-ahead load schedules with different robustness can be generated by solving the proposed robust formulation with different predefined parameters. The validity and advantage of the proposed approach has been verified by simulation results. Also, the effects of feed-in tariff and PV output have been evaluated

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

Human Performance-Aware Scheduling and Routing of a Multi-Skilled Workforce

Directory of Open Access Journals (Sweden)

Maikel L. van Eck

2017-10-01

Full Text Available Planning human activities within business processes often happens based on the same methods and algorithms as are used in the area of manufacturing systems. However, human behaviour is quite different from machine behaviour. Their performance depends on a number of factors, including workload, stress, personal preferences, etc. In this article we describe an approach for scheduling activities of people that takes into account business rules and dynamic human performance in order to optimise the schedule. We formally describe the scheduling problem we address and discuss how it can be constructed from inputs in the form of business process models and performance measurements. Finally, we discuss and evaluate an implementation for our planning approach to show the impact of considering dynamic human performance in scheduling.

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

Performance Evaluation of Bidding-Based Multi-Agent Scheduling Algorithms for Manufacturing Systems

Directory of Open Access Journals (Sweden)

Antonio Gordillo

2014-10-01

Full Text Available Artificial Intelligence techniques have being applied to many problems in manufacturing systems in recent years. In the specific field of manufacturing scheduling many studies have been published trying to cope with the complexity of the manufacturing environment. One of the most utilized approaches is (multi agent-based scheduling. Nevertheless, despite the large list of studies reported in this field, there is no resource or scientific study on the performance measure of this type of approach under very common and critical execution situations. This paper focuses on multi-agent systems (MAS based algorithms for task allocation, particularly in manufacturing applications. The goal is to provide a mechanism to measure the performance of agent-based scheduling approaches for manufacturing systems under key critical situations such as: dynamic environment, rescheduling, and priority change. With this mechanism it will be possible to simulate critical situations and to stress the system in order to measure the performance of a given agent-based scheduling method. The proposed mechanism is a pioneering approach for performance evaluation of bidding-based MAS approaches for manufacturing scheduling. The proposed method and evaluation methodology can be used to run tests in different manufacturing floors since it is independent of the workshop configuration. Moreover, the evaluation results presented in this paper show the key factors and scenarios that most affect the market-like MAS approaches for manufacturing scheduling.

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.

Assessment of the Correlation between Appointment Scheduling and Patient Satisfaction in a Pediatric Dental Setup

OpenAIRE

Katre, Amar N.

2014-01-01

Introduction. The practice of modern pediatric dentistry requires delivery of quality care in combination with adherence to excellent business as well as time management principles. A definite appointment schedule should be presented to the parents on the first or second appointment. More importantly, the prescribed schedule should be followed to the best of the professional abilities of the pediatric dentist. Aims. The aim of the study was to assess the co-relation between appointment schedu...

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

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

Directory of Open Access Journals (Sweden)

Sonia Yassa

2013-01-01

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

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

Science.gov (United States)

Kadima, Hubert; Granado, Bertrand

2013-01-01

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

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

Data analysis considerations for pesticides determined by National Water Quality Laboratory schedule 2437

Science.gov (United States)

Shoda, Megan E.; Nowell, Lisa H.; Stone, Wesley W.; Sandstrom, Mark W.; Bexfield, Laura M.

2018-04-02

In 2013, the U.S. Geological Survey National Water Quality Laboratory (NWQL) made a new method available for the analysis of pesticides in filtered water samples: laboratory schedule 2437. Schedule 2437 is an improvement on previous analytical methods because it determines the concentrations of 225 fungicides, herbicides, insecticides, and associated degradates in one method at similar or lower concentrations than previously available methods. Additionally, the pesticides included in schedule 2437 were strategically identified in a prioritization analysis that assessed likelihood of occurrence, prevalence of use, and potential toxicity. When the NWQL reports pesticide concentrations for analytes in schedule 2437, the laboratory also provides supplemental information useful to data users for assessing method performance and understanding data quality. That supplemental information is discussed in this report, along with an initial analysis of analytical recovery of pesticides in water-quality samples analyzed by schedule 2437 during 2013–2015. A total of 523 field matrix spike samples and their paired environmental samples and 277 laboratory reagent spike samples were analyzed for this report (1,323 samples total). These samples were collected in the field as part of the U.S. Geological Survey National Water-Quality Assessment groundwater and surface-water studies and as part of the NWQL quality-control program. This report reviews how pesticide samples are processed by the NWQL, addresses how to obtain all the data necessary to interpret pesticide concentrations, explains the circumstances that result in a reporting level change or the occurrence of a raised reporting level, and describes the calculation and assessment of recovery. This report also discusses reasons why a data user might choose to exclude data in an interpretive analysis and outlines the approach used to identify the potential for decreased data quality in the assessment of method recovery. The

Attitudes, beliefs, and practices regarding electronic nicotine delivery systems in patients scheduled for elective surgery.

Science.gov (United States)

Kadimpati, Sandeep; Nolan, Margaret; Warner, David O

2015-01-01

Smokers are at increased risk of postoperative complications. Electronic nicotine delivery systems (ENDS; or electronic cigarettes) could be a useful tool to reduce harm in the perioperative period. This pilot study examined the attitudes, beliefs, and practices of smokers scheduled for elective surgery regarding ENDS. This was a cross-sectional survey of current cigarette smokers who were evaluated in a preoperative clinic before elective surgery at Mayo Clinic. Measures included demographic characteristics, smoking history, 2 indices assessing the perception of how smoking affected health risks, ENDS use history, and 3 indices assessing interest in, perceived benefits of, and barriers to using ENDS in the perioperative period. Of the 112 smokers who completed the survey, 62 (55%) had tried ENDS and 24 (21%) reported current use. The most commonly stated reason for using ENDS was to quit smoking. Approximately 2 in 3 participants would be willing to use ENDS to help them reduce or eliminate perioperative cigarette use, and similar proportions perceived health benefits of doing so. Of the factors studied, only attempted to quit within the last year was significantly associated with increased interest in the perioperative use of ENDS (P=.03). Compared with participants who had tried ENDS (n=62), those who had never tried ENDS (n=50) had a significantly increased interest in the perioperative use of ENDS. A substantial proportion of patients scheduled for elective surgery had tried ENDS and would consider using ENDS to reduce perioperative use of cigarettes. Copyright © 2015 Mayo Foundation for Medical Education and Research. Published by Elsevier Inc. All rights reserved.

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.

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

The engine maintenance scheduling by using reliability centered maintenance method and the identification of 5S application in PT. XYZ

Science.gov (United States)

Sembiring, N.; Panjaitan, N.; Saragih, A. F.

2018-02-01

PT. XYZ is a manufacturing company that produces fresh fruit bunches (FFB) to Crude Palm Oil (CPO) and Palm Kernel Oil (PKO). PT. XYZ consists of six work stations: receipt station, sterilizing station, thressing station, pressing station, clarification station, and kernelery station. So far, the company is still implementing corrective maintenance maintenance system for production machines where the machine repair is done after damage occurs. Problems at PT. XYZ is the absence of scheduling engine maintenance in a planned manner resulting in the engine often damaged which can disrupt the smooth production. Another factor that is the problem in this research is the kernel station environment that becomes less convenient for operators such as there are machines and equipment not used in the production area, slippery, muddy, scattered fibers, incomplete use of PPE, and lack of employee discipline. The most commonly damaged machine is in the seed processing station (kernel station) which is cake breaker conveyor machine. The solution of this problem is to propose a schedule plan for maintenance of the machine by using the method of reliability centered maintenance and also the application of 5S. The result of the application of Reliability Centered maintenance method is obtained four components that must be treated scheduled (time directed), namely: for bearing component is 37 days, gearbox component is 97 days, CBC pen component is 35 days and conveyor pedal component is 32 days While after identification the application of 5S obtained the proposed corporate environmental improvement measures in accordance with the principles of 5S where unused goods will be moved from the production area, grouping goods based on their use, determining the procedure of cleaning the production area, conducting inspection in the use of PPE, and making 5S slogans.

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

Modeling the violation of reward maximization and invariance in reinforcement schedules.

Directory of Open Access Journals (Sweden)

Giancarlo La Camera

2008-08-01

Full Text Available It is often assumed that animals and people adjust their behavior to maximize reward acquisition. In visually cued reinforcement schedules, monkeys make errors in trials that are not immediately rewarded, despite having to repeat error trials. Here we show that error rates are typically smaller in trials equally distant from reward but belonging to longer schedules (referred to as "schedule length effect". This violates the principles of reward maximization and invariance and cannot be predicted by the standard methods of Reinforcement Learning, such as the method of temporal differences. We develop a heuristic model that accounts for all of the properties of the behavior in the reinforcement schedule task but whose predictions are not different from those of the standard temporal difference model in choice tasks. In the modification of temporal difference learning introduced here, the effect of schedule length emerges spontaneously from the sensitivity to the immediately preceding trial. We also introduce a policy for general Markov Decision Processes, where the decision made at each node is conditioned on the motivation to perform an instrumental action, and show that the application of our model to the reinforcement schedule task and the choice task are special cases of this general theoretical framework. Within this framework, Reinforcement Learning can approach contextual learning with the mixture of empirical findings and principled assumptions that seem to coexist in the best descriptions of animal behavior. As examples, we discuss two phenomena observed in humans that often derive from the violation of the principle of invariance: "framing," wherein equivalent options are treated differently depending on the context in which they are presented, and the "sunk cost" effect, the greater tendency to continue an endeavor once an investment in money, effort, or time has been made. The schedule length effect might be a manifestation of these

An investigation on impacts of scheduling configurations on Mississippi biology subject area testing

Science.gov (United States)

Marchette, Frances Lenora

The purpose of this mixed modal study was to compare the results of Biology Subject Area mean scores of students on a 4 x 4 block schedule, A/B block schedule, and traditional year-long schedule for 1A to 5A size schools. This study also reviewed the data to determine if minority or gender issues might influence the test results. Interviews with administrators and teachers were conducted about the type of schedule configuration they use and the influence that the schedule has on student academic performance on the Biology Subject Area Test. Additionally, this research further explored whether schedule configurations allow sufficient time for students to construct knowledge. This study is important to schools, teachers, and administrators because it can assist them in considering the impacts that different types of class schedules have on student performance and if ethnic or gender issues are influencing testing results. This study used the causal-comparative method for the quantitative portion of the study and constant comparative method for the qualitative portion to explore the relationship of school schedules on student academic achievement on the Mississippi Biology Subject Area Test. The aggregate means of selected student scores indicate that the Mississippi Biology Subject Area Test as a measure of student performance reveals no significant difference on student achievement for the three school schedule configurations. The data were adjusted for initial differences of gender, minority, and school size on the three schedule configurations. The results suggest that schools may employ various schedule configurations and expect student performance on the Mississippi Biology Subject Area Test to be unaffected. However, many areas of concern were identified in the interviews that might impact on school learning environments. These concerns relate to effective classroom management, the active involvement of students in learning, the adequacy of teacher education

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.

Job Flow Distribution and Ranked Jobs Scheduling in Grid Virtual Organizations

CERN Document Server

Toporkov, Victor; Tselishchev, Alexey; Yemelyanov, Dmitry; Potekhin, Petr

2015-01-01

In this work, we consider the problems of job flow distribution and ranked job framework forming within a model of cycle scheduling in Grid virtual organizations. The problem of job flow distribution is solved in terms of jobs and computing resource domains compatibility. A coefficient estimating such compatibility is introduced and studied experimentally. Two distribution strategies are suggested. Job framework forming is justified with such quality of service indicators as an average job execution time, a number of required scheduling cycles, and a number of job execution declines. Two methods for job selection and scheduling are proposed and compared: the first one is based on the knapsack problem solution, while the second one utilizes the mentioned compatibility coefficient. Along with these methods we present experimental results demonstrating the efficiency of proposed approaches and compare them with random job selection.

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

International Nuclear Information System (INIS)

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

2006-01-01

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

Weighted-SNR-based fair scheduling for uplink OFDMA

KAUST Repository

Ma, Yao; Leith, Alex; Alouini, Mohamed-Slim; (Sherman) Shen X., Xuemin

2009-01-01

rates for different users. The offline optimization technique requires to know the channel distribution information (CDI) at the scheduler. The online method uses the weight adaption combined with individual user rate tracking, which avoids the need

Shop Floor Scheduling for Program Depot Maintenance Considering Stochastic Repair Needs

National Research Council Canada - National Science Library

Gemmill, Douglas

2000-01-01

.... The research resulted in the development of a new method to identify the critical path within resource-constrained project scheduling problems, heuristic search methods that improved overall project...

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.

Bilevel Fuzzy Chance Constrained Hospital Outpatient Appointment Scheduling Model

Directory of Open Access Journals (Sweden)

Xiaoyang Zhou

2016-01-01

Full Text Available Hospital outpatient departments operate by selling fixed period appointments for different treatments. The challenge being faced is to improve profit by determining the mix of full time and part time doctors and allocating appointments (which involves scheduling a combination of doctors, patients, and treatments to a time period in a department optimally. In this paper, a bilevel fuzzy chance constrained model is developed to solve the hospital outpatient appointment scheduling problem based on revenue management. In the model, the hospital, the leader in the hierarchy, decides the mix of the hired full time and part time doctors to maximize the total profit; each department, the follower in the hierarchy, makes the decision of the appointment scheduling to maximize its own profit while simultaneously minimizing surplus capacity. Doctor wage and demand are considered as fuzzy variables to better describe the real-life situation. Then we use chance operator to handle the model with fuzzy parameters and equivalently transform the appointment scheduling model into a crisp model. Moreover, interactive algorithm based on satisfaction is employed to convert the bilevel programming into a single level programming, in order to make it solvable. Finally, the numerical experiments were executed to demonstrate the efficiency and effectiveness of the proposed approaches.

Analysis of the numbers of B, T and subpopulation lymphocytes in patients with breast cancer submitted to a different radiotherapy schedules

International Nuclear Information System (INIS)

Andrade, J.M. de.

1989-01-01

The behaviour of T and B lymphocytes subpopulations was evaluated in patients with breast cancer submitted to 3 different schedules of radiotherapy. The assays were carried out before and immediately after the end of treatment. T lymphocytes and the helper/inducer (CD 4 ) and suppressor/cytotoxic (CD 8 ) subpopulations were counted by indirect immunofluorescence with monoclonal antibodies of the OKT series. The number of B lymphocytes was obtained by direct immunofluorescence with fluorescein-conjugated anti-human Ig antibodies. The patients were divided into 3 groups: irradiation of the breast only; irradiation of the lymph-draining areas; irradiation of the breast, of the lymph-draining area and of the sternal area. (author)

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

Systematic Evaluation of Stochastic Methods in Power System Scheduling and Dispatch with Renewable Energy

Energy Technology Data Exchange (ETDEWEB)

Wang, Yishen [Univ. of Washington, Seattle, WA (United States); Argonne National Lab. (ANL), Argonne, IL (United States); Zhou, Zhi [Argonne National Lab. (ANL), Argonne, IL (United States); Liu, Cong [Argonne National Lab. (ANL), Argonne, IL (United States); Electric Reliability Council of Texas (ERCOT), Austin, TX (United States); Botterud, Audun [Argonne National Lab. (ANL), Argonne, IL (United States)

2016-08-01

As more wind power and other renewable resources are being integrated into the electric power grid, the forecast uncertainty brings operational challenges for the power system operators. In this report, different operational strategies for uncertainty management are presented and evaluated. A comprehensive and consistent simulation framework is developed to analyze the performance of different reserve policies and scheduling techniques under uncertainty in wind power. Numerical simulations are conducted on a modified version of the IEEE 118-bus system with a 20% wind penetration level, comparing deterministic, interval, and stochastic unit commitment strategies. The results show that stochastic unit commitment provides a reliable schedule without large increases in operational costs. Moreover, decomposition techniques, such as load shift factor and Benders decomposition, can help in overcoming the computational obstacles to stochastic unit commitment and enable the use of a larger scenario set to represent forecast uncertainty. In contrast, deterministic and interval unit commitment tend to give higher system costs as more reserves are being scheduled to address forecast uncertainty. However, these approaches require a much lower computational effort Choosing a proper lower bound for the forecast uncertainty is important for balancing reliability and system operational cost in deterministic and interval unit commitment. Finally, we find that the introduction of zonal reserve requirements improves reliability, but at the expense of higher operational costs.

Magnesium sulphate as an adjuvant to bupivacaine in ultrasound-guided transversus abdominis plane block in patients scheduled for total abdominal hysterectomy under subarachnoid block

Directory of Open Access Journals (Sweden)

Shelly Rana

2016-01-01

Full Text Available Background and Aims: Transversus abdominis plane (TAP block has proven to be an effective component of multimodal analgesic regimens for a variety of abdominal procedures. Magnesium sulphate (MgSO4 N-methyl-D-aspartate receptor antagonist has the potential to be an ideal adjuvant in TAP block. We studied the efficacy of MgSO4as an adjuvant to bupivacaine in TAP block in patients scheduled for total abdominal hysterectomy (TAH under subarachnoid block (SAB. Methods: Sixty-five women belonging to American Society of Anesthesiologists physical status 1 or 2, aged between 35 and 70 years, scheduled for TAH under SAB were recruited. Patients in Group B (n = 32 received 18 mL 0.25% bupivacaine (45 mg with 2 mL normal saline (NS, whereas those in Group BM (n = 33 received 18 mL 0.25% bupivacaine (45 mg with 1.5 mL (150 mg MgSO4and 0.5 mL NS in the ultrasound (USG-guided TAP block performed on each side after the completion of the surgery under SAB. They were evaluated for pain at 0, 2, 4, 6, 12 and 24 h, time to first rescue analgesic and duration of postoperative analgesia were noted. Results: The post-operative visual analogue scale (VAS scores were lower in Group BM at 4, 6 and 12 h (P < 0.05. Mean duration of analgesia was significantly prolonged in Group BM with lesser requirement of rescue analgesic (P < 0.05 up to 12 h. Conclusion: MgSO4 (150 mg as an adjuvant to bupivacaine in USG-guided TAP block reduces post-operative pain scores, prolongs the duration of analgesia and decreases demands for rescue analgesics.

Real-time energy resources scheduling considering short-term and very short-term wind forecast

Energy Technology Data Exchange (ETDEWEB)

Silva, Marco; Sousa, Tiago; Morais, Hugo; Vale, Zita [Polytechnic of Porto (Portugal). GECAD - Knowledge Engineering and Decision Support Research Center

2012-07-01

This paper proposes an energy resources management methodology based on three distinct time horizons: day-ahead scheduling, hour-ahead scheduling, and real-time scheduling. In each scheduling process the update of generation and consumption operation and of the storage and electric vehicles storage status are used. Besides the new operation conditions, the most accurate forecast values of wind generation and of consumption using results of short-term and very short-term methods are used. A case study considering a distribution network with intensive use of distributed generation and electric vehicles is presented. (orig.)

Time-constrained project scheduling with adjacent resources

NARCIS (Netherlands)

Hurink, Johann L.; Kok, A.L.; Paulus, J.J.; Schutten, Johannes M.J.

We develop a decomposition method for the Time-Constrained Project Scheduling Problem (TCPSP) with adjacent resources. For adjacent resources the resource units are ordered and the units assigned to a job have to be adjacent. On top of that, adjacent resources are not required by single jobs, but by

Time-constrained project scheduling with adjacent resources

NARCIS (Netherlands)

Hurink, Johann L.; Kok, A.L.; Paulus, J.J.; Schutten, Johannes M.J.

2008-01-01

We develop a decomposition method for the Time-Constrained Project Scheduling Problem (TCPSP) with Adjacent Resources. For adjacent resources the resource units are ordered and the units assigned to a job have to be adjacent. On top of that, adjacent resources are not required by single jobs, but by

Scheduled Operation of PV Power Station Considering Solar Radiation Forecast Error

Science.gov (United States)

Takayama, Satoshi; Hara, Ryoichi; Kita, Hiroyuki; Ito, Takamitsu; Ueda, Yoshinobu; Saito, Yutaka; Takitani, Katsuyuki; Yamaguchi, Koji

Massive penetration of photovoltaic generation (PV) power stations may cause some serious impacts on a power system operation due to their volatile and unpredictable output. Growth of uncertainty may require larger operating reserve capacity and regulating capacity. Therefore, in order to utilize a PV power station as an alternative for an existing power plant, improvement in controllability and adjustability of station output become very important factor. Purpose of this paper is to develop the scheduled operation technique using a battery system (NAS battery) and the meteorological forecast. The performance of scheduled operation strongly depends on the accuracy of solar radiation forecast. However, the solar radiation forecast contains error. This paper proposes scheduling method and rescheduling method considering the trend of forecast error. More specifically, the forecast error scenario is modeled by means of the clustering analysis of the past actual forecast error. Validity and effectiveness of the proposed method is ascertained through computational simulations using the actual PV generation data monitored at the Wakkanai PV power station and solar radiation forecast data provided by the Japan Weather Association.

Schedule-induced masseter EMG in facial pain subjects vs. no-pain controls.

Science.gov (United States)

Gramling, S E; Grayson, R L; Sullivan, T N; Schwartz, S

1997-02-01

Empirical reports suggest that oral habits (e.g., teeth clenching) may be behavioral mediators linking stress to muscle hyperreactivity and the development of facial pain. Another report suggests that excessive behavioral adjuncts develop in conjunction with fixed-time stimulus presentation. The present study assessed the extent to which the oral habits exhibited by facial pain patients are schedule-induced. Subjects with Temporomandibular Disorder (TMD) symptomatology (n = 15) and pain-free controls (n = 15) participated in a 4-phase experiment (adaptation, baseline, task, recovery) designed to elicit schedule-induced behaviors. Self-report of oral habits and negative affect were recorded after each phase. Objective measures of oral habits were obtained via behavioral observation and masseter EMG recordings. Results revealed that negative arousal significantly increased during the fixed-time (FT) task and was also associated with increased oral habits among the TMD subjects. Moreover, 40% of the TMD subjects and none of the controls exhibited a pattern of EMG elevations in the early part of the inter-stimulus interval that met a strict criteria for scheduled-induced behavior per se. Taken together, these results suggest that the TMD subjects were engaging in schedule-induced oral habits. The adjunctive behavior literature seems to provide a plausible explanation as to how oral habits develop and are maintained in TMD patients, despite their painful consequences.

Nonlinear observer output-feedback MPC treatment scheduling for HIV

Directory of Open Access Journals (Sweden)

Zurakowski Ryan

2011-05-01

Full Text Available Abstract Background Mathematical models of the immune response to the Human Immunodeficiency Virus demonstrate the potential for dynamic schedules of Highly Active Anti-Retroviral Therapy to enhance Cytotoxic Lymphocyte-mediated control of HIV infection. Methods In previous work we have developed a model predictive control (MPC based method for determining optimal treatment interruption schedules for this purpose. In this paper, we introduce a nonlinear observer for the HIV-immune response system and an integrated output-feedback MPC approach for implementing the treatment interruption scheduling algorithm using the easily available viral load measurements. We use Monte-Carlo approaches to test robustness of the algorithm. Results The nonlinear observer shows robust state tracking while preserving state positivity both for continuous and discrete measurements. The integrated output-feedback MPC algorithm stabilizes the desired steady-state. Monte-Carlo testing shows significant robustness to modeling error, with 90% success rates in stabilizing the desired steady-state with 15% variance from nominal on all model parameters. Conclusions The possibility of enhancing immune responsiveness to HIV through dynamic scheduling of treatment is exciting. Output-feedback Model Predictive Control is uniquely well-suited to solutions of these types of problems. The unique constraints of state positivity and very slow sampling are addressable by using a special-purpose nonlinear state estimator, as described in this paper. This shows the possibility of using output-feedback MPC-based algorithms for this purpose.

Conception of Self-Construction Production Scheduling System

Science.gov (United States)

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

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

Reirradiation of head and neck neoplasms using twice-a-day scheduling

International Nuclear Information System (INIS)

Tercilla, O.F.; Schmidt-Ullrich, R.; Wazer, D.E.

1993-01-01

Between 1985 and 1988, we have explored the value of twice-a-day (BID) irradiation for the retreatment of head and neck neoplasms. In this pilot study of ten patients we used a schedule of BID irradiation at fraction sizes between 1.4 and 1.6 Gy separated by at least 6 h. Of the four patients were treated with curative intent, three patients received 30 Gy in 20 fractions over twelve days followed within ten days by an interstitial/intracavitary Ir-192 implant boost to doses of 30 to 40 Gy and one patient was treated with a 32 Gy BID boost. Four patients were reirradiated with aggressive palliation and received 45 Gy in 30 fractions over 26 days including a break in the third week. The remaining two patients were treated with palliative intent to 30 Gy in 20 fractions over twelve days. Eight patients were treated for recurrent/persistent or second carcinomas, one for a recurrent glomus jugulare tumor. At a median follow-up of 36 months, ranging from six to 61 months, nine of ten patients experienced excellent symptomatic relief. Five patients are alive and free of tumor, one patient is alive with distant metastases, and two each are dead from local or systemic tumor progression. All four patients retreated for cure are alive with no evidence of local disease. The tolerance and tumor control rate of the BID reirradition schedule were good with severe late sequelae in only one patient. (orig.) [de

Improving management of patients with autism spectrum disorder having scheduled surgery: optimizing practice.

Science.gov (United States)

Thompson, Debbie Gearner; Tielsch-Goddard, Anna

2014-01-01

Surgical preparation for children with autism spectrum disorders can be a challenge to perioperative staff because of the unique individual needs and behaviors in this population. Most children with autism function best in predictable, routine environments, and being in the hospital and other health care settings can create a stressful situation. This prospective, descriptive, quality improvement project was conducted to optimize best practices for perioperative staff and better individualize the plan of care for the autistic child and his or her family. Forty-three patients with a diagnosis of autism or autistic spectrum disorder were seen over 6 months at a suburban pediatric hospital affiliated with a major urban pediatric hospital and had an upcoming scheduled surgery or procedure requiring anesthesia. Caregivers were interviewed before and after surgery to collect information to better help their child cope with their hospital visit. In an evaluation of project outcomes, data were tabulated and summarized and interview data were qualitatively coded for emerging themes to improve the perioperative process for the child. Findings showed that staff members were able to recognize potential and actual stressors and help identify individual needs of surgical patients with autism. The families were pleased and appreciative of the individual attention and focus on their child's special needs. Investigators also found increased staff interest in optimizing the surgical experience for autistic children. Copyright © 2014 National Association of Pediatric Nurse Practitioners. Published by Mosby, Inc. All rights reserved.

Physician satisfaction with a multi-platform digital scheduling system.

Directory of Open Access Journals (Sweden)

Rodrigo Octávio Deliberato

Full Text Available Physician shift schedules are regularly created manually, using paper or a shared online spreadsheet. Mistakes are not unusual, leading to last minute scrambles to cover a shift. We developed a web-based shift scheduling system and a mobile application tool to facilitate both the monthly scheduling and shift exchanges between physicians. The primary objective was to compare physician satisfaction before and after the mobile application implementation.Over a 9-month period, three surveys, using the 4-point Likert type scale were performed to assess the physician satisfaction. The first survey was conducted three months prior mobile application release, a second survey three months after implementation and the last survey six months after.51 (77% of the physicians answered the baseline survey. Of those, 32 (63% were males with a mean age of 37.8 ± 5.5 years. Prior to the mobile application implementation, 36 (70% of the responders were using more than one method to carry out shift exchanges and only 20 (40% were using the official department report sheet to document shift exchanges. The second and third survey were answered by 48 (73% physicians. Forty-eight (98% of them found the mobile application easy or very easy to install and 47 (96% did not want to go back to the previous method. Regarding physician satisfaction, at baseline 37% of the physicians were unsatisfied or very unsatisfied with shift scheduling. After the mobile application was implementation, only 4% reported being unsatisfied (OR = 0.11, p < 0.001. The satisfaction level improved from 63% to 96% between the first and the last survey. Satisfaction levels significantly increased between the three time points (OR = 13.33, p < 0.001.Our web and mobile phone-based scheduling system resulted in better physician satisfaction.

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.

Development of an irrigation scheduling software based on model predicted crop water stress

Science.gov (United States)

Modern irrigation scheduling methods are generally based on sensor-monitored soil moisture regimes rather than crop water stress which is difficult to measure in real-time, but can be computed using agricultural system models. In this study, an irrigation scheduling software based on RZWQM2 model pr...

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

Sharing Data for Production Scheduling Using the ISA-95 Standard

Energy Technology Data Exchange (ETDEWEB)

Harjunkoski, Iiro, E-mail: iiro.harjunkoski@de.abb.com; Bauer, Reinhard [ABB Corporate Research, Industrial Software and Applications, Ladenburg (Germany)

2014-10-21

In the development and deployment of production scheduling solutions, one major challenge is to establish efficient information sharing with industrial production management systems. Information comprising production orders to be scheduled, processing plant structure, product recipes, available equipment, and other resources are necessary for producing a realistic short-term production plan. Currently, a widely accepted standard for information sharing is missing. This often leads to the implementation of costly custom-tailored interfaces, or in the worst case the scheduling solution will be abandoned. Additionally, it becomes difficult to easily compare different methods on various problem instances, which complicates the re-use of existing scheduling solutions. In order to overcome these hurdles, a platform-independent and holistic approach is needed. Nevertheless, it is difficult for any new solution to gain wide acceptance within industry as new standards are often refused by companies already using a different established interface. From an acceptance point of view, the ISA-95 standard could act as a neutral data-exchange platform. In this paper, we assess if this already widespread standard is simple, yet powerful enough to act as the desired holistic data exchange for scheduling solutions.

Sharing Data for Production Scheduling Using the ISA-95 Standard

International Nuclear Information System (INIS)

Harjunkoski, Iiro; Bauer, Reinhard

2014-01-01

In the development and deployment of production scheduling solutions, one major challenge is to establish efficient information sharing with industrial production management systems. Information comprising production orders to be scheduled, processing plant structure, product recipes, available equipment, and other resources are necessary for producing a realistic short-term production plan. Currently, a widely accepted standard for information sharing is missing. This often leads to the implementation of costly custom-tailored interfaces, or in the worst case the scheduling solution will be abandoned. Additionally, it becomes difficult to easily compare different methods on various problem instances, which complicates the re-use of existing scheduling solutions. In order to overcome these hurdles, a platform-independent and holistic approach is needed. Nevertheless, it is difficult for any new solution to gain wide acceptance within industry as new standards are often refused by companies already using a different established interface. From an acceptance point of view, the ISA-95 standard could act as a neutral data-exchange platform. In this paper, we assess if this already widespread standard is simple, yet powerful enough to act as the desired holistic data exchange for scheduling solutions.

Sharing data for production scheduling using the ISA-95 standard

Directory of Open Access Journals (Sweden)

Iiro eHarjunkoski

2014-10-01

Full Text Available In the development and deployment of production scheduling solutions one major challenge is to establish efficient information sharing with industrial production management systems. Information comprising production orders to be scheduled, processing plant structure, product recipes, available equipment and other resources are necessary for producing a realistic short-term production plan. Currently, a widely-accepted standard for information sharing is missing. This often leads to the implementation of costly custom-tailored interfaces, or in the worst case the scheduling solution will be abandoned. Additionally, it becomes difficult to easily compare different methods on various problem instances, which complicates the re-use of existing scheduling solutions. In order to overcome these hurdles, a platform-independent and holistic approach is needed. Nevertheless, it is difficult for any new solution to gain wide acceptance within industry as new standards are often refused by companies already using a different established interface. From an acceptance point of view, the ISA-95 standard could act as a neutral data-exchange platform. In this paper, we assess if this already widespread standard is simple, yet powerful enough to act as the desired holistic data-exchange for scheduling solutions.

Non-standard work schedules, gender, and parental stress

Directory of Open Access Journals (Sweden)

Mariona Lozano

2016-02-01

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

Scheduling Non-Preemptible Jobs to Minimize Peak Demand

Directory of Open Access Journals (Sweden)

Sean Yaw

2017-10-01

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

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

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

Cyclic delivery scheduling to customers with different priorities

Directory of Open Access Journals (Sweden)

Katarzyna Zofia Gdowska

2013-12-01

Full Text Available Background: In this paper a cyclic delivery scheduling problem for customers with different priorities is presented. Shops, which are provided with deliveries, are occasionally located in places which are crucial for the proper flow of traffic. In such places coordination of deliveries is crucial; therefore it allows to completely eliminate the phenomenon of the simultaneous arrivals of suppliers. Methods: In this paper the cyclic delivery scheduling problem for customers with different priorities was presented. To this theoretical problem a mix integer programming model was developed. Specific approach to the cyclic delivery scheduling problem is inspired by timetabling problem for urban public transport. Results: Mixed integer programming model was employed for solving four cases of cyclic delivery scheduling problem for customers with different priorities. When the value of the synchronization priority assigned to a single customer raised then the total number of synchronizations in the whole network decreased. In order to compare solutions a synchronization rate was utilized. A simple factor was utilized - the proportion of number of synchronizations of deliveries to a given customer to the total number of synchronizations obtained for the whole network. When the value of synchronization priority raised then the value of synchronization rate of this customer improved significantly. Conclusions: The mixed integer programming model for the cyclic delivery scheduling problem for customers with different priorities presented in this paper can be utilized for generating schedules of serving customers located in places where only one delivery can be received and unloaded at one go and where there is no space for other suppliers to wait in a queue. Such a schedule can be very useful for organizing deliveries to small shops united in a franchising network, since they operate in a way that is very similar to the network presented in this paper

Sleep scheduling with expected common coverage in wireless sensor networks

OpenAIRE

Bulut, Eyuphan; Korpeoglu, Ibrahim

2011-01-01

Sleep scheduling, which is putting some sensor nodes into sleep mode without harming network functionality, is a common method to reduce energy consumption in dense wireless sensor networks. This paper proposes a distributed and energy efficient sleep scheduling and routing scheme that can be used to extend the lifetime of a sensor network while maintaining a user defined coverage and connectivity. The scheme can activate and deactivate the three basic units of a sensor node (sensing, proces...

Sustainable Sport Scheduling Approach Considering Team Equity for the Korean Professional Baseball League

Directory of Open Access Journals (Sweden)

Young Dae Ko

2018-02-01

Full Text Available Since the Korea Baseball League (KBL had nine teams, an odd number, in the 2013 season, one team was unable to compete at certain times in the rotation while the other eight teams played games. Therefore, it was necessary to consider several elements to generate an annual match schedule in terms of team equity. However, the annual match schedule created by the conventional method could not fully reflect the elements regarding team equity, and there were a great many complaints from teams and fans. As a result, applying an optimization technique was decided upon to derive an efficient annual match schedule for the 2014 season. All the required conditions for scheduling are formulated as one or more equations and several parameter values concerning team equity are calculated with the related equations. Due to the complicated scheduling conditions, a sequential solution approach is applied by dividing the overall planning horizon in three parts. The derived annual match schedule was used for the 2014 season after some modifications, and the staff of the KBL was satisfied with the performance of the proposed scheduling methodology. Currently, this sustainable scheduling methodology is still in use to generate an efficient annual match schedule for the KBL.

The impact of alternative pricing methods for drugs in California Workers' Compensation System: Fee-schedule pricing.

Science.gov (United States)

Wilson, Leslie; Turkistani, Fatema A; Huang, Wei; Tran, Dang M; Lin, Tracy Kuo

2018-01-01

California's Workers' Compensation System (CAWCS) Department of Industrial Relations questioned the adequacy of the current Medi-Cal fee-schedule pricing and requested analysis of alternatives that maximize price availability and maintain budget neutrality. To compare CAWCS pharmacy-dispensed (PD) drug prices under alternative fee schedules, and identify combinations of alternative benchmarks that have prices available for the largest percentage of PD drugs and that best reach budget neutrality. Claims transaction-level data (2011-2013) from CAWCS were used to estimate total annual PD pharmaceutical payments. Medi-Cal pricing data was from the Workman's Compensation Insurance System (WCIS). Average Wholesale Prices (AWP), Wholesale Acquisition Costs (WAC), Direct Prices (DP), Federal Upper Limit (FUL) prices, and National Average Drug Acquisition Costs (NADAC) were from Medi-Span. We matched National Drug Codes (NDCs), pricing dates, and drug quantity for comparisons. We report pharmacy-dispensed (PD) claims frequency, reimbursement matching rate, and paid costs by CAWCS as the reference price against all alternative price benchmarks. Of 12,529,977 CAWCS claims for pharmaceutical products 11.6% (1,462,814) were for PD drugs. Prescription drug cost for CAWCS was over $152M; $63.9M, $47.9M, and $40.6M in 2011-2013. Ninety seven percent of these CAWCS PD claims had a Medi-Cal price. Alternative mechanisms provided a price for fewer claims; NADAC 94.23%, AWP 90.94%, FUL 73.11%, WAC 66.98%, and DP 14.33%. Among CAWCS drugs with no Medi-Cal price in PD claims, AWP, WAC, NADAC, DP, and FUL provided prices for 96.7%, 63.14%, 24.82%, 20.83%, and 15.08% of claims. Overall CAWCS paid 100.52% of Medi-Cal, 60% of AWP, 97% of WAC, 309.53% of FUL, 103.83% of DP, and 136.27% of NADAC. CAWCS current Medi-Cal fee-schedule price list for PD drugs is more complete than all alternative fee-schedules. However, all reimbursement approaches would require combinations of pricing benchmarks

A Privacy-Preserving Distributed Optimal Scheduling for Interconnected Microgrids

Directory of Open Access Journals (Sweden)

Nian Liu

2016-12-01

Full Text Available With the development of microgrids (MGs, interconnected operation of multiple MGs is becoming a promising strategy for the smart grid. In this paper, a privacy-preserving distributed optimal scheduling method is proposed for the interconnected microgrids (IMG with a battery energy storage system (BESS and renewable energy resources (RESs. The optimal scheduling problem is modeled to minimize the coalitional operation cost of the IMG, including the fuel cost of conventional distributed generators and the life loss cost of BESSs. By using the framework of the alternating direction method of multipliers (ADMM, a distributed optimal scheduling model and an iteration solution algorithm for the IMG is introduced; only the expected exchanging power (EEP of each MG is required during the iterations. Furthermore, a privacy-preserving strategy for the sharing of the EEP among MGs is designed to work with the mechanism of the distributed algorithm. According to the security analysis, the EEP can be delivered in a cooperative and privacy-preserving way. A case study and numerical results are given in terms of the convergence of the algorithm, the comparison of the costs and the implementation efficiency.

Interrogating two schedules of the AKT inhibitor MK-2206 in patients with advanced solid tumors incorporating novel pharmacodynamic and functional imaging biomarkers.

Science.gov (United States)

Yap, Timothy A; Yan, Li; Patnaik, Amita; Tunariu, Nina; Biondo, Andrea; Fearen, Ivy; Papadopoulos, Kyriakos P; Olmos, David; Baird, Richard; Delgado, Liliana; Tetteh, Ernestina; Beckman, Robert A; Lupinacci, Lisa; Riisnaes, Ruth; Decordova, Shaun; Heaton, Simon P; Swales, Karen; deSouza, Nandita M; Leach, Martin O; Garrett, Michelle D; Sullivan, Daniel M; de Bono, Johann S; Tolcher, Anthony W

2014-11-15

Multiple cancers harbor genetic aberrations that impact AKT signaling. MK-2206 is a potent pan-AKT inhibitor with a maximum tolerated dose (MTD) previously established at 60 mg on alternate days (QOD). Due to a long half-life (60-80 hours), a weekly (QW) MK-2206 schedule was pursued to compare intermittent QW and continuous QOD dosing. Patients with advanced cancers were enrolled in a QW dose-escalation phase I study to investigate the safety and pharmacokinetic-pharmacodynamic profiles of tumor and platelet-rich plasma (PRP). The QOD MTD of MK-2206 was also assessed in patients with ovarian and castration-resistant prostate cancers and patients with advanced cancers undergoing multiparametric functional magnetic resonance imaging (MRI) studies, including dynamic contrast-enhanced MRI, diffusion-weighted imaging, magnetic resonance spectroscopy, and intrinsic susceptibility-weighted MRI. A total of 71 patients were enrolled; 38 patients had 60 mg MK-2206 QOD, whereas 33 received MK-2206 at 90, 135, 150, 200, 250, and 300 mg QW. The QW MK-2206 MTD was established at 200 mg following dose-limiting rash at 250 and 300 mg. QW dosing appeared to be similarly tolerated to QOD, with toxicities including rash, gastrointestinal symptoms, fatigue, and hyperglycemia. Significant AKT pathway blockade was observed with both continuous QOD and intermittent QW dosing of MK-2206 in serially obtained tumor and PRP specimens. The functional imaging studies demonstrated that complex multiparametric MRI protocols may be effectively implemented in a phase I trial. Treatment with MK-2206 safely results in significant AKT pathway blockade in QOD and QW schedules. The intermittent dose of 200 mg QW is currently used in phase II MK-2206 monotherapy and combination studies (NCT00670488). ©2014 American Association for Cancer Research.

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.

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

Dynamic Planning of Experiments for the Optimisation of Managerial Scheduling

Directory of Open Access Journals (Sweden)

Tomáš Macák

2016-01-01

Full Text Available Time management has a crucial role in organizations and also in our personal lives. Managerial scheduling is an important tool for the time management, especially It can serve as a tool for the first phase, of time management - namely for effective planning. This paper focusses on finding the best possible setting for determining significant the best layout for activities according to the criteria of urgency and importance using a modified steepest ascent method, which can be referred as dynamic scheduling. This term indicates the nature of the method; wherein the experimental design space is changed to look for the best conditions for adjustment factors influencing a managerial process. Existing methods for layout optimization mentioned in the literature and conventionally implemented in practice have only shown local optima.

Baseline incidence and severity of renal insufficiency evaluated by estimated glomerular filtration rates in patients scheduled for contrast-enhanced CT

Energy Technology Data Exchange (ETDEWEB)

Utsunomiya, Daisuke; Yanaga, Yumi; Oda, Seitaro; Namimoto, Tomohiro; Yamashita, Yasuyuki (Dept. of Diagnostic Radiology, Faculty of Life Sciences, Kumamoto Univ., Kumamoto (Japan)), email: utsunomi@kumamoto-u.ac.jp; Awai, Kazuo (Dept. of Diagnostic Radiology, Graduate School of Biomedical Sciences, Hiroshima Univ., Hiroshima (Japan)); Funama, Yoshinori (Dept. of Medical Physics, Faculty of Life Sciences, Kumamoto Univ., Kumamoto (Japan))

2011-06-15

Background Although pre-existing renal insufficiency (RI) is the most important risk factor for contrast-induced nephropathy (CIN), the background distribution of baseline renal function has not been investigated thoroughly in patients scheduled for contrast-enhanced CT. Purpose To investigate the incidence and severity of baseline RI evaluated by estimated glomerular filtration rates (eGFR) in patients who underwent contrast-enhanced CT at an academic center. Material and Methods A total of 6586 patients (3630 men and 2956 women; mean age 57.0 +- 11.9 years) who underwent contrast-enhanced CT between January and December 2008 were retrospectively studied. Of these, 829 had cardiovascular diseases (CVD), 5116 had oncologic diseases, 178 had diabetes mellitus (DM), and 1572 had chronic liver disease (CLD). The eGFR (mL/min/1.73 m2) was calculated from their serum creatinine level. Mild, moderate-a, moderate-b, and severe RI were recorded at 60 < =eGFR < 90, 45 < =eGFR < 60, 30 < =eGFR < 45 and eGFR < 30, respectively. Results Of the 6586 patients, 1.6%, 3.7%, 13.7%, and 54.2% were judged to present with severe, moderate-b, moderate-a, and mild RI, respectively. While moderate-b-to-severe RI was recorded in 133 (3.2%) of 4161 patients aged 70 years or less, it was observed in 218 (9.0%) of the 2425 patients who were 71 years or older. Among the 829 CVD patients, 9.9% manifested moderate-b-to-severe- and 73.0% mild-to-moderate-a RI. The corresponding rates were 4.4% and 68.9% for oncologic disease, 16.9% and 61.2% for DM, and 4.8% and 71.5% for CLD patients. By univariate analysis, there was a significant association between moderate-b-to-severe RI and the advanced age, CVD, DM, and non-oncologic disease. Multivariate analysis showed that the advanced age, DM, and non-oncologic disease were statistically associated with moderate-b-to-severe RI. Conclusion The incidence of RI of eGFR < 45mL/min/1.73 m2 at baseline was high in patients with advanced age, CVD and DM and

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

NARCIS (Netherlands)

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

2013-01-01

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

Periodic Heterogeneous Vehicle Routing Problem With Driver Scheduling

Science.gov (United States)

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

2018-01-01

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

Second unit scheduling concerns on a dual-unit nuclear project

International Nuclear Information System (INIS)

Block, H.R.; Mazzini, R.A.

1978-01-01

This paper explores the planning and scheduling problems of Unit 2 of the Susquehanna steam electric station. The causes of these problems and methods to avoid or mitigate their consequences are discussed. The Susquehanna steam electric station has two boiling water reactors rated at 1,100 MW each. Topics considered include cost factors, structures, equipment, engineering and home office, construction services, completion data phasing, work sequencing, structural dependences, and segregation. Substatial cost and schedule benefits can result if two nuclear units are designed and constructed as one integral station, and if maximum sharing of facilities and services between the units occurs. It is concluded that the cost benefits of highly integrated dual unit construction outweigh the schedule and logistical problems caused by that approach

Runway Scheduling Using Generalized Dynamic Programming

Science.gov (United States)

Montoya, Justin; Wood, Zachary; Rathinam, Sivakumar

2011-01-01

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

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

Nation-Scale Adoption of Shorter Breast Radiation Therapy Schedules Can Increase Survival in Resource Constrained Economies: Results From a Markov Chain Analysis

Energy Technology Data Exchange (ETDEWEB)

Khan, Atif J., E-mail: atif.j.khan@rutgers.edu [Department of Radiation Oncology, Robert Wood Johnson Medical School/Cancer Institute of New Jersey, New Brunswick, New Jersey (United States); Rafique, Raza [Suleman Dawood School of Business, Lahore University of Management Sciences, Lahore (Pakistan); Zafar, Waleed [Shaukat Khanum Memorial Cancer Hospital and Research Centre, Lahore (Pakistan); Shah, Chirag [Department of Radiation Oncology, Cleveland Clinic, Cleveland, Ohio (United States); Haffty, Bruce G. [Department of Radiation Oncology, Robert Wood Johnson Medical School/Cancer Institute of New Jersey, New Brunswick, New Jersey (United States); Vicini, Frank [Michigan HealthCare Professionals, Farmington Hills, Michigan (United States); Jamshed, Arif [Shaukat Khanum Memorial Cancer Hospital and Research Centre, Lahore (Pakistan); Zhao, Yao [Rutgers University School of Business, Newark, New Jersey (United States)

2017-02-01

Purpose: Hypofractionated whole breast irradiation and accelerated partial breast irradiation (APBI) offer women options for shorter courses of breast radiation therapy. The impact of these shorter schedules on the breast cancer populations of emerging economies with limited radiation therapy resources is unknown. We hypothesized that adoption of these schedules would improve throughput in the system and, by allowing more women access to life-saving treatments, improve patient survival within the system. Methods and Materials: We designed a Markov chain model to simulate the different health states that a postlumpectomy or postmastectomy patient could enter over the course of a 20-year follow-up period. Transition rates between health states were adapted from published data on recurrence rates. We used primary data from a tertiary care hospital in Lahore, Pakistan, to populate the model with proportional use of mastectomy versus breast conservation and to estimate the proportion of patients suitable for APBI. Sensitivity analyses on the use of APBI and relative efficacy of APBI were conducted to study the impact on the population. Results: The shorter schedule resulted in more women alive and more women remaining without evidence of disease (NED) compared with the conventional schedule, with an absolute difference of about 4% and 7% at 15 years, respectively. Among women who had lumpectomies, the chance of remaining alive and with an intact breast was 62% in the hypofractionation model and 54% in the conventional fractionation model. Conclusions: Increasing throughput in the system can result in improved survival, improved chances of remaining without evidence of disease, and improved chances of remaining alive with a breast. These findings are significant and suggest that adoption of hypofractionation in emerging economies is not simply a question of efficiency and cost but one of access to care and patient survivorship.

Nation-Scale Adoption of Shorter Breast Radiation Therapy Schedules Can Increase Survival in Resource Constrained Economies: Results From a Markov Chain Analysis

International Nuclear Information System (INIS)

Khan, Atif J.; Rafique, Raza; Zafar, Waleed; Shah, Chirag; Haffty, Bruce G.; Vicini, Frank; Jamshed, Arif; Zhao, Yao

2017-01-01

Purpose: Hypofractionated whole breast irradiation and accelerated partial breast irradiation (APBI) offer women options for shorter courses of breast radiation therapy. The impact of these shorter schedules on the breast cancer populations of emerging economies with limited radiation therapy resources is unknown. We hypothesized that adoption of these schedules would improve throughput in the system and, by allowing more women access to life-saving treatments, improve patient survival within the system. Methods and Materials: We designed a Markov chain model to simulate the different health states that a postlumpectomy or postmastectomy patient could enter over the course of a 20-year follow-up period. Transition rates between health states were adapted from published data on recurrence rates. We used primary data from a tertiary care hospital in Lahore, Pakistan, to populate the model with proportional use of mastectomy versus breast conservation and to estimate the proportion of patients suitable for APBI. Sensitivity analyses on the use of APBI and relative efficacy of APBI were conducted to study the impact on the population. Results: The shorter schedule resulted in more women alive and more women remaining without evidence of disease (NED) compared with the conventional schedule, with an absolute difference of about 4% and 7% at 15 years, respectively. Among women who had lumpectomies, the chance of remaining alive and with an intact breast was 62% in the hypofractionation model and 54% in the conventional fractionation model. Conclusions: Increasing throughput in the system can result in improved survival, improved chances of remaining without evidence of disease, and improved chances of remaining alive with a breast. These findings are significant and suggest that adoption of hypofractionation in emerging economies is not simply a question of efficiency and cost but one of access to care and patient survivorship.

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

Clinical management methods for out-patients with alcohol dependence

Directory of Open Access Journals (Sweden)

Boulze Isabelle

2006-02-01

Full Text Available Abstract Background In France outpatient centres for the care of alcoholics are healthcare establishments providing medical, psychological and social support. Although they meet the practical needs of these patients, their degree of use in each of these domains and the respective mobilisation of different skills by the care team are not well understood. Our aim was therefore to determine in detail the management involved as a function of the severity of alcohol dependence. For this purpose, all the procedures involved were compiled in a thesaurus describing its type (psychological, medical, social, reception, its scheduled or unscheduled nature, its method (face-to-face, telephone, letter and its duration. The severity of dependence was evaluated using the Addiction Severity Index (ASI. Results 45 patients were included and followed-up during 291 ± 114 days. The mean initial ASI scores (± SD were: medical (M = 0.39 ± 0.3, working-income (ER = 0.5 ± 0.3, alcohol (A = 0.51 ± 0.2, illicit drugs (D = 0.07 ± 0.08, legal (L = 0.06 ± 0.13, familial and social environment (FS = 0.34 ± 0.26, psychological (P = 0.39 ± 0.22. The total number of procedures was 1341 (29.8 per patient corresponding to 754.4 hours (16.7 per patient. The intensity of management peaked during the first month of treatment, and then declined rapidly; the maximum incidence of abstinence was observed during the 3rd month of management. Interviews with patients, group therapy and staff meetings represented 68.7%, 9.9% and 13.9% of all procedures, respectively. In patients with severe dependence, as compared to moderate, management was twice as intense in the psychological and social domains, but not in the medical domain. The ASI questionnaire was completed a second time by 24 patients, after an average of 3.2 months. The improvement was significant in the M, A, D and P domains only. Conclusion This study provided an overview of the methods employed in managing a sample of

Size-based scheduling to improve web performance

NARCIS (Netherlands)

Harchol-Balter, M.; Schroeder, B.; Bansal, N.; Agrawal, M.

2003-01-01

Is it possible to reduce the expected response time of every request at a web server, simply by changing the order in which we schedule the requests? That is the question we ask in this paper.This paper proposes a method for improving the performance of web servers servicing static HTTP requests.

WCET Analysis for Preemptive Scheduling

OpenAIRE

Altmeyer, Sebastian; Gebhard, Gernot

2008-01-01

Hard real-time systems induce strict constraints on the timing of the task set. Validation of these timing constraints is thus a major challenge during the design of such a system. Whereas the derivation of timing guarantees must already be considered complex if tasks are running to completion, it gets even more complex if tasks are scheduled preemptively -- especially due to caches, deployed to improve the average performance. In this paper we propose a new method to compu...

Scheduling Broadcasts in a Network of Timelines

KAUST Repository

Manzoor, Emaad A.

2015-05-12

method of marginal allocation, discover a new scheduling strategy that outperforms popular scheduling heuristics while producing fewer posts.

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

International Nuclear Information System (INIS)

Hill, M.; Wakerley, M.W.

2000-09-01

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

Concurrent processes scheduling with scarce resources in small and medium enterprises

Institute of Scientific and Technical Information of China (English)

马嵩华

2016-01-01

Scarce resources , precedence and non-determined time-lag are three constraints commonly found in small and medium manufacturing enterprises (SMEs), which are deemed to block the ap-plication of workflow management system ( WfMS ) .To tackle this problem , a workflow scheduling approach is proposed based on timing workflow net (TWF-net) and genetic algorithm (GA).The workflow is modelled in a form of TWF-net in favour of process simulation and resource conflict checking .After simplifying and reconstructing the set of workflow instance , the conflict resolution problem is transformed into a resource-constrained project scheduling problem ( RCPSP ) , which could be efficiently solved by a heuristic method , such as GA.Finally, problems of various sizes are utilized to test the performance of the proposed algorithm and to compare it with first-come-first-served ( FCFS) strategy.The evaluation demonstrates that the proposed method is an overwhelming and effective approach for scheduling the concurrent processes with precedence and resource con -straints .

An Efficient Live TV Scheduling System for 4G LTE Broadcast

KAUST Repository

Lau, Chun Pong

2016-01-01

Traditional live television (TV) broadcasting systems are proven to be spectrum inefficient. Therefore, researchers propose to provide TV services on fourth-generation (4G) long-term evolution (LTE) networks. However, static broadcast, a typical broadcasting method over cellular network, is inefficient in terms of radio resource usage. To solve this problem, the audience-driven live TV scheduling (ADTVS) framework is proposed, to maximize radio resource usage when providing TV broadcasting services over LTE networks. ADTVS, a system-level scheduling framework, considers both available radio resources and audience preferences, in order to dynamically schedule TV channels for broadcasting at various time and locations. By conducting a simulation using real-life data and scenarios, it is shown that ADTVS significantly outperforms the static broadcast method. Numerical results indicate that, on average, ADTVS enables substantial improvement to broadcast efficiency and conserves considerable amount of radio resources, while forgoing less than 5% of user services compared to the benchmark system.

Run-Time HW/SW Scheduling of Data Flow Applications on Reconfigurable Architectures

Directory of Open Access Journals (Sweden)

Ghaffari Fakhreddine

2009-01-01

Full Text Available This paper presents an efficient dynamic and run-time Hardware/Software scheduling approach. This scheduling heuristic consists in mapping online the different tasks of a highly dynamic application in such a way that the total execution time is minimized. We consider soft real-time data flow graph oriented applications for which the execution time is function of the input data nature. The target architecture is composed of two processors connected to a dynamically reconfigurable hardware accelerator. Our approach takes advantage of the reconfiguration property of the considered architecture to adapt the treatment to the system dynamics. We compare our heuristic with another similar approach. We present the results of our scheduling method on several image processing applications. Our experiments include simulation and synthesis results on a Virtex V-based platform. These results show a better performance against existing methods.

Application Of The Work Breakdown Structure In Determining Cost Buffers In Construction Schedules

Directory of Open Access Journals (Sweden)

Połoński M.

2015-03-01

Full Text Available The paper presents methods of determining the location of cost buffers and corresponding contingency costs in the CPM schedule based on its work breakdown structure. Application of correctly located cost buffers with appropriately established reserve costs is justified by the common overrunning of scheduled costs in construction projects. Interpolated cost buffers (CB as separate tasks have been combined with relevant summary tasks by the start–to–start (SS relationship, whereas the time of their execution has been dynamically connected with the time of accomplishment of particular summary tasks using the “paste connection” option. Besides cost buffers linked with the group of tasks assigned to summary tasks, a definition of the cost buffer for the entire project (PCB has been proposed, i.e. as one initial task of the entire project. Contingency costs corresponding to these buffers, depending on the data that the planner has at his disposal, can be determined using different methods, but always depend on the costs of all tasks protected by each buffer. The paper presents an exemplary schedule for a facility and the method of determining locations and cost for buffers CB and PCB, as well as their influence on the course of the curve illustrating the budgeted cost of work scheduled (BCWS. The proposed solution has been adjusted and presented with consideration of the possibilities created by the scheduling software MS Project, though its general assumptions may be implemented with application of other similar specialist tools.

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.

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

Science.gov (United States)

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

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

BINARY PARTICLE SWARM OPTIMIZATION APPROACH FOR RANDOM GENERATION OUTAGE MAINTENANCE SCHEDULING

Directory of Open Access Journals (Sweden)

K. Suresh

2013-01-01

Full Text Available This paper presents a methodology for maintenance scheduling (MS of generators using binary particle swarm optimization (BPSO based probabilistic approach. The objective of this paper is to reduce the loss of load probability (LOLP for a power system. The capacity outage probability table (COPT is the initial step in creating maintenance schedule using the probabilistic levelized risk method. This paper proposes BPSO method which is used to construct the COPT. In order to mitigate the effects of probabilistic levelized risk method, BPSO based probabilistic levelized risk method is embarked on a MS problem. In order to validate the effectiveness of the proposed algorithm, case study results for simple five unit system can accomplish a significant levelization in the reliability indices that make possible to evaluate system generation system adequacy in the MS horizon of the power system. The proposed method shows better performance compared with other optimization methods and conventional method with improved search performance.

Global Optimization of Nonlinear Blend-Scheduling Problems

Directory of Open Access Journals (Sweden)

Pedro A. Castillo Castillo

2017-04-01

Full Text Available The scheduling of gasoline-blending operations is an important problem in the oil refining industry. This problem not only exhibits the combinatorial nature that is intrinsic to scheduling problems, but also non-convex nonlinear behavior, due to the blending of various materials with different quality properties. In this work, a global optimization algorithm is proposed to solve a previously published continuous-time mixed-integer nonlinear scheduling model for gasoline blending. The model includes blend recipe optimization, the distribution problem, and several important operational features and constraints. The algorithm employs piecewise McCormick relaxation (PMCR and normalized multiparametric disaggregation technique (NMDT to compute estimates of the global optimum. These techniques partition the domain of one of the variables in a bilinear term and generate convex relaxations for each partition. By increasing the number of partitions and reducing the domain of the variables, the algorithm is able to refine the estimates of the global solution. The algorithm is compared to two commercial global solvers and two heuristic methods by solving four examples from the literature. Results show that the proposed global optimization algorithm performs on par with commercial solvers but is not as fast as heuristic approaches.

Scheduling Aircraft Landings under Constrained Position Shifting

Science.gov (United States)

Balakrishnan, Hamsa; Chandran, Bala

2006-01-01

Optimal scheduling of airport runway operations can play an important role in improving the safety and efficiency of the National Airspace System (NAS). Methods that compute the optimal landing sequence and landing times of aircraft must accommodate practical issues that affect the implementation of the schedule. One such practical consideration, known as Constrained Position Shifting (CPS), is the restriction that each aircraft must land within a pre-specified number of positions of its place in the First-Come-First-Served (FCFS) sequence. We consider the problem of scheduling landings of aircraft in a CPS environment in order to maximize runway throughput (minimize the completion time of the landing sequence), subject to operational constraints such as FAA-specified minimum inter-arrival spacing restrictions, precedence relationships among aircraft that arise either from airline preferences or air traffic control procedures that prevent overtaking, and time windows (representing possible control actions) during which each aircraft landing can occur. We present a Dynamic Programming-based approach that scales linearly in the number of aircraft, and describe our computational experience with a prototype implementation on realistic data for Denver International Airport.

Effects of scheduled exercise on cancer-related fatigue in women with early breast cancer

OpenAIRE

Husebø, Anne Marie Lunde; Dyrstad, Sindre Mikal; Mjaaland, Ingvil; Søreide, Jon Arne; Bru, Lars Edvin

2014-01-01

The article was originally published in The Scientific World Journal; by Hindawi Publishing Corporation under the Creative Commons Attribution License; see http://dx.doi.org/10.1155/2014/27182. While physical activity during cancer treatment is found beneficial for breast cancer patients, evidence indicates ambiguous findings concerning effects of scheduled exercise programs on treatment-related symptoms. This study investigated effects of a scheduled home-based exercise intervention i...

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

NARCIS (Netherlands)

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

2015-01-01

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

Tramp ship routing and scheduling with voyage separation requirements

DEFF Research Database (Denmark)

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

2017-01-01

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

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…

Estimating the right allocation of resources on weekends and public holidays in Green Zone using hybrid methods

Science.gov (United States)

Yusoff, Nazhatul Sahima Mohd; Liong, Choong-Yeun; Ismail, Wan Rosmanira; Noh, Abu Yazid Md; Noor, Nur Amalina Mohd

2018-04-01

Long patient waiting time and congestion is a major problem faced by Green Zone in Emergency Department at Hospital Universiti Sains Malaysia (EDHUSM) especially during weekends and public holidays. Even though the Green Zone is servicing only the non-critical patients, patient waiting time, causing the department fails to achieve its Key Performance Indicator (KPI). The long waiting time is due to the insufficient resources provided during the weekends and public holidays versus the large number of patients. Currently, only two doctors supported by two nurses are scheduled for every shift during weekends and public holidays. The numbers of patients are higher during weekends and public holidays as compared to weekdays, but the scheduled number of doctors and nurses are the same as weekdays. Therefore, this study presents a hybrid method to estimate the right number of doctors and nurses for improving the services of the Green Zone during weekends and public holidays. Fifty scenarios based on current and proposed schedules of doctors and nurses are simulated and analysed using the hybrid method of Discrete Event Simulation (DES) and Data Envelopment Analysis (DEA). Banker, Charnes and Cooper (BCC) input-oriented model and Super-Efficiency models of DEA were used to analyse the efficiency of the scenarios. The results show that the best schedule is a combination of four doctors supported by four nurses in every shift during weekends and public holidays for the Green Zone. The findings show that such schedule will not only help the department to achieve its KPI but also enable a more optimal utilization of the resources.

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.

Concurrent variable-interval variable-ratio schedules in a dynamic choice environment.

Science.gov (United States)

Bell, Matthew C; Baum, William M

2017-11-01

Most studies of operant choice have focused on presenting subjects with a fixed pair of schedules across many experimental sessions. Using these methods, studies of concurrent variable- interval variable-ratio schedules helped to evaluate theories of choice. More recently, a growing literature has focused on dynamic choice behavior. Those dynamic choice studies have analyzed behavior on a number of different time scales using concurrent variable-interval schedules. Following the dynamic choice approach, the present experiment examined performance on concurrent variable-interval variable-ratio schedules in a rapidly changing environment. Our objectives were to compare performance on concurrent variable-interval variable-ratio schedules with extant data on concurrent variable-interval variable-interval schedules using a dynamic choice procedure and to extend earlier work on concurrent variable-interval variable-ratio schedules. We analyzed performances at different time scales, finding strong similarities between concurrent variable-interval variable-interval and concurrent variable-interval variable- ratio performance within dynamic choice procedures. Time-based measures revealed almost identical performance in the two procedures compared with response-based measures, supporting the view that choice is best understood as time allocation. Performance at the smaller time scale of visits accorded with the tendency seen in earlier research toward developing a pattern of strong preference for and long visits to the richer alternative paired with brief "samples" at the leaner alternative ("fix and sample"). © 2017 Society for the Experimental Analysis of Behavior.

Optimal Scheduling of Doctors Outpatient Departments Based on Patients’ Behavior

Directory of Open Access Journals (Sweden)

Zongwei Ren

2016-01-01

Full Text Available The low operational efficiency in the field of medical and health care has become a serious problem in China; the long time that the patients have to wait for is the main phenomenon of difficult medical service. Medical industry is service-oriented and its main purpose is to make profits, so the benefits and competitiveness of a hospital depend on patient satisfaction. This paper makes a survey on a large hospital in Harbin of China and collects relevant data and then uses the prospect theory to analyze patients’ and doctors’ behavioral characteristics and the model of patient satisfaction is established based on fuzzy theory with a triplet α/β/γ. The optimal scheduling of clinic is described as a problem with the rule of first come, first served which maximizes patient satisfaction for the main goal and minimizes operating costs for the secondary goal. And the corresponding mathematical model is established. Finally, a solution method named plant growth simulation algorithm (PGSA is presented. Then, by means of calculating of the example and comparing with genetic algorithm, the results show that the optimum can be reached; meanwhile the efficiency of the presented algorithm is better than the genetic algorithm.

Consensus based scheduling of storage capacities in a virtual microgrid

DEFF Research Database (Denmark)

Brehm, Robert; Top, Søren; Mátéfi-Tempfli, Stefan

2017-01-01

We present a distributed, decentralized method for coordinated scheduling of charge/discharge intervals of storage capacities in a utility grid integrated microgrid. The decentralized algorithm is based on a consensus scheme and solves an optimisation problem with the objective of minimising......, by use of storage capacities, the power flow over a transformer substation from/to the utility grid integrated microgrid. It is shown that when using this coordinated scheduling algorithm, load profile flattening (peak-shaving) for the utility grid is achieved. Additionally, mutual charge...

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

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.

Prescriptions for schedule II opioids and benzodiazepines increase after the introduction of computer-generated prescriptions.

Science.gov (United States)

McGerald, Genevieve; Dvorkin, Ronald; Levy, David; Lovell-Rose, Stephanie; Sharma, Adhi

2009-06-01

Prescriptions for controlled substances decrease when regulatory barriers are put in place. The converse has not been studied. The objective was to determine whether a less complicated prescription writing process is associated with a change in the prescribing patterns of controlled substances in the emergency department (ED). The authors conducted a retrospective nonconcurrent cohort study of all patients seen in an adult ED between April 19, 2005, and April 18, 2007, who were discharged with a prescription. Prior to April 19, 2006, a specialized prescription form stored in a locked cabinet was obtained from the nursing staff to write a prescription for benzodiazepines or Schedule II opioids. After April 19, 2006, New York State mandated that all prescriptions, regardless of schedule classification, be generated on a specialized bar-coded prescription form. The main outcome of the study was to compare the proportion of Schedule III-V opioids to Schedule II opioids and benzodiazepines prescribed in the ED before and after the introduction of a less cumbersome prescription writing process. Of the 26,638 charts reviewed, 2.1% of the total number of prescriptions generated were for a Schedule II controlled opioid before the new system was implemented compared to 13.6% after (odds ratio [OR] = 7.3, 95% confidence interval [CI] = 6.4 to 8.4). The corresponding percentages for Schedule III-V opioids were 29.9% to 18.1% (OR = 0.52, 95% CI = 0.49 to 0.55) and for benzodiazepines 1.4% to 3.9% (OR = 2.8, 95% CI = 2.4 to 3.4). Patients were more likely to receive a prescription for a Schedule II opioid or a benzodiazepine after a more streamlined computer-generated prescription writing process was introduced in this ED. (c) 2009 by the Society for Academic Emergency Medicine.

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

Adapting immunisation schedules for children undergoing chemotherapy.

Science.gov (United States)

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

2018-02-01

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

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.

A Systematical Framework of Schedule Risk Management for Power Grid Engineering Projects’ Sustainable Development

Directory of Open Access Journals (Sweden)

Rao Rao

2014-10-01

Full Text Available Schedule risks are the main threat for high efficiency of schedule management in power grid engineering projects (PGEP. This paper aims to build a systematical framework for schedule risk management, which consists of three dimensions, including the personnel dimension, method dimension and time dimension, namely supervisory personnel, management methods and the construction process, respectively. Responsibilities of staff with varied functions are discussed in the supervisory personnel part, and six stages and their corresponding 40 key works are ensured as the time dimension. Risk identification, analysis, evaluation and prevention together formed the method dimension. Based on this framework, 222 schedule risks occur in the whole process of PGEPs are identified via questionnaires and expert interviews. Then, the relationship among each risk is figured out based on the Interpretative Structure Model (ISM method and the impact of each risk is quantitatively assessed by establishing evaluation system. The actual practice of the proposed framework is verified through the analysis of the first stage of a PGEP. Finally, the results show that this framework of schedule risk management is meaningful for improving the efficiency of project management. It provides managers with a clearer procedure with which to conduct risk management, helps them to timely detect risks and prevent risks from occurring. It is also easy for managers to judge the influence level of each risk, so they can take actions based on the level of each risk’s severity. Overall, it is beneficial for power grid enterprises to achieve a sustainable management.

A IEEE 802.11e HCCA Scheduler with a Reclaiming Mechanism for Multimedia Applications

Directory of Open Access Journals (Sweden)

Anna Lina Ruscelli

2014-01-01

Full Text Available The QoS offered by the IEEE 802.11e reference scheduler is satisfactory in the case of Constant Bit Rate traffic streams, but not yet in the case of Variable Bit Rate traffic streams, whose variations stress its scheduling behavior. Despite the numerous proposed alternative schedulers with QoS, multimedia applications are looking for refined methods suitable to ensure service differentiation and dynamic update of protocol parameters. In this paper a scheduling algorithm, Unused Time Shifting Scheduler (UTSS, is deeply analyzed. It is designed to cooperate with a HCCA centralized real-time scheduler through the integration of a bandwidth reclaiming scheme, suitable to recover nonexhausted transmission time and assign that to the next polled stations. UTSS dynamically computes with an O(1 complexity transmission time providing an instantaneous resource overprovisioning. The theoretical analysis and the simulation results highlight that this injection of resources does not affect the admission control nor the centralized scheduler but is suitable to improve the performance of the centralized scheduler in terms of mean access delay, transmission queues length, bursts of traffic management, and packets drop rate. These positive effects are more relevant for highly variable bit rate traffic.

Multi-Time Scale Coordinated Scheduling Strategy with Distributed Power Flow Controllers for Minimizing Wind Power Spillage

Directory of Open Access Journals (Sweden)

Yi Tang

2017-11-01

Full Text Available The inherent variability and randomness of large-scale wind power integration have brought great challenges to power flow control and dispatch. The distributed power flow controller (DPFC has the higher flexibility and capacity in power flow control in the system with wind generation. This paper proposes a multi-time scale coordinated scheduling model with DPFC to minimize wind power spillage. Configuration of DPFCs is initially determined by stochastic method. Afterward, two sequential procedures containing day-head and real-time scales are applied for determining maximum schedulable wind sources, optimal outputs of generating units and operation setting of DPFCs. The generating plan is obtained initially in day-ahead scheduling stage and modified in real-time scheduling model, while considering the uncertainty of wind power and fast operation of DPFC. Numerical simulation results in IEEE-RTS79 system illustrate that wind power is maximum scheduled with the optimal deployment and operation of DPFC, which confirms the applicability and effectiveness of the proposed method.

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

Heuristic Scheduling Algorithm Oriented Dynamic Tasks for Imaging Satellites

Directory of Open Access Journals (Sweden)

Maocai Wang

2014-01-01

Full Text Available Imaging satellite scheduling is an NP-hard problem with many complex constraints. This paper researches the scheduling problem for dynamic tasks oriented to some emergency cases. After the dynamic properties of satellite scheduling were analyzed, the optimization model is proposed in this paper. Based on the model, two heuristic algorithms are proposed to solve the problem. The first heuristic algorithm arranges new tasks by inserting or deleting them, then inserting them repeatedly according to the priority from low to high, which is named IDI algorithm. The second one called ISDR adopts four steps: insert directly, insert by shifting, insert by deleting, and reinsert the tasks deleted. Moreover, two heuristic factors, congestion degree of a time window and the overlapping degree of a task, are employed to improve the algorithm’s performance. Finally, a case is given to test the algorithms. The results show that the IDI algorithm is better than ISDR from the running time point of view while ISDR algorithm with heuristic factors is more effective with regard to algorithm performance. Moreover, the results also show that our method has good performance for the larger size of the dynamic tasks in comparison with the other two methods.

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

Scheduling of Crude Oil Operations in Refinery without Sufficient Charging Tanks Using Petri Nets

Directory of Open Access Journals (Sweden)

Yan An

2017-05-01

Full Text Available A short-term schedule for crude oil operations in a refinery should define and sequence the activities in detail. Each activity involves both discrete-event and continuous variables. The combinatorial nature of the scheduling problem makes it difficult to solve. For such a scheduling problem, charging tanks are a type of critical resources. If the number of charging tanks is not sufficient, the scheduling problem is further complicated. This work conducts a study on the scheduling problem of crude oil operations without sufficient charging tanks. In this case, to make a refinery able to operate, a charging tank has to be in simultaneous charging and feeding to a distiller for some time, called simultaneously-charging-and-feeding (SCF mode, leading to disturbance to the oil distillation in distillers. A hybrid Petri net model is developed to describe the behavior of the system. Then, a scheduling method is proposed to find a schedule such that the SCF mode is minimally used. It is computationally efficient. An industrial case study is given to demonstrate the obtained results.

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