WorldWideScience

Sample records for assessment schedule whodas-ii

  1. International Literature Review on WHODAS II (World Health Organization Disability Assessment Schedule II

    Directory of Open Access Journals (Sweden)

    Federici, Stefano

    2009-06-01

    Full Text Available This review is a critical analysis regarding the study and utilization of the World Health Organization Disability Assessment Schedule II (WHODAS II as a basis for establishing specific criteria for evaluating relevant international scientific literature.The WHODAS II is an instrument developed by the World Health Organisation in order to assess behavioural limitations and restrictions related to an individual’s participation, independent from a medical diagnosis. This instrument was developed by the WHO’s Assessment, Classification and Epidemiology Group within the framework of the WHO/NIH Joint Project on Assessment and Classification of Disablements. To ascertain the international dissemination level of for WHODAS II’s utilization and, at the same time, analyse the studies regarding the psychometric validation of the WHODAS II translation and adaptation in other languages and geographical contests. Particularly, our goal is to highlight which psychometric features have been investigated, focusing on the factorial structure, the reliability, and the validity of this instrument. International literature was researched through the main data bases of indexed scientific production: the Cambridge Scientific Abstracts – CSA, PubMed, and Google Scholar, from 1990 through to December 2008.The following search terms were used:“whodas”, in the field query, plus “title” and “abstract”.The WHODAS II has been used in 54 studies, of which 51 articles are published in international journals, 2 conference abstracts, and one dissertation abstract. Nevertheless, only 7 articles are published in journals and conference proceedings regarding disability and rehabilitation. Others have been published in medical and psychiatric journals, with the aim of indentifying comorbidity correlations in clinical diagnosis concerning patients with mental illness. Just 8 out of 51 articles have studied the psychometric properties of the WHODAS II. The

  2. The 12-item World Health Organization Disability Assessment Schedule II (WHO-DAS II: a nonparametric item response analysis

    Directory of Open Access Journals (Sweden)

    Fernandez Ana

    2010-05-01

    Full Text Available Abstract Background Previous studies have analyzed the psychometric properties of the World Health Organization Disability Assessment Schedule II (WHO-DAS II using classical omnibus measures of scale quality. These analyses are sample dependent and do not model item responses as a function of the underlying trait level. The main objective of this study was to examine the effectiveness of the WHO-DAS II items and their options in discriminating between changes in the underlying disability level by means of item response analyses. We also explored differential item functioning (DIF in men and women. Methods The participants were 3615 adult general practice patients from 17 regions of Spain, with a first diagnosed major depressive episode. The 12-item WHO-DAS II was administered by the general practitioners during the consultation. We used a non-parametric item response method (Kernel-Smoothing implemented with the TestGraf software to examine the effectiveness of each item (item characteristic curves and their options (option characteristic curves in discriminating between changes in the underliying disability level. We examined composite DIF to know whether women had a higher probability than men of endorsing each item. Results Item response analyses indicated that the twelve items forming the WHO-DAS II perform very well. All items were determined to provide good discrimination across varying standardized levels of the trait. The items also had option characteristic curves that showed good discrimination, given that each increasing option became more likely than the previous as a function of increasing trait level. No gender-related DIF was found on any of the items. Conclusions All WHO-DAS II items were very good at assessing overall disability. Our results supported the appropriateness of the weights assigned to response option categories and showed an absence of gender differences in item functioning.

  3. Modeling the World Health Organization Disability Assessment Schedule II using non-parametric item response models.

    Science.gov (United States)

    Galindo-Garre, Francisca; Hidalgo, María Dolores; Guilera, Georgina; Pino, Oscar; Rojo, J Emilio; Gómez-Benito, Juana

    2015-03-01

    The World Health Organization Disability Assessment Schedule II (WHO-DAS II) is a multidimensional instrument developed for measuring disability. It comprises six domains (getting around, self-care, getting along with others, life activities and participation in society). The main purpose of this paper is the evaluation of the psychometric properties for each domain of the WHO-DAS II with parametric and non-parametric Item Response Theory (IRT) models. A secondary objective is to assess whether the WHO-DAS II items within each domain form a hierarchy of invariantly ordered severity indicators of disability. A sample of 352 patients with a schizophrenia spectrum disorder is used in this study. The 36 items WHO-DAS II was administered during the consultation. Partial Credit and Mokken scale models are used to study the psychometric properties of the questionnaire. The psychometric properties of the WHO-DAS II scale are satisfactory for all the domains. However, we identify a few items that do not discriminate satisfactorily between different levels of disability and cannot be invariantly ordered in the scale. In conclusion the WHO-DAS II can be used to assess overall disability in patients with schizophrenia, but some domains are too general to assess functionality in these patients because they contain items that are not applicable to this pathology.

  4. Measuring disability across cultures — the psychometric properties of the WHODAS II in older people from seven low- and middle-income countries. The 10/66 Dementia Research Group population-based survey

    Science.gov (United States)

    Sousa, Renata M; Dewey, Michael E; Acosta, Daisy; Jotheeswaran, AT; Castro-Costa, Erico; Ferri, Cleusa P; Guerra, Mariella; Huang, Yueqin; Jacob, KS; Pichardo, Juana Guillermina Rodriguez; Ramírez, Nayeli Garcia; Rodriguez, Juan Llibre; Rodriguez, Marina Calvo; Salas, Aquiles; Sosa, Ana Luisa; Williams, Joseph; Prince, Martin J

    2010-01-01

    We evaluated the psychometric properties of the 12-item interviewer-administered screener version of the World Health Organization Disability Assessment Schedule – version II (WHODAS II) among older people living in seven low- and middle-income countries. Principal component analysis (PCA), confirmatory factor analysis (CFA) and Mokken analyses were carried out to test for unidimensionality, hierarchical structure, and measurement invariance across 10/66 Dementia Research Group sites. PCA generated a one-factor solution in most sites. In CFA, the two-factor solution generated in Dominican Republic fitted better for all sites other than rural China. The two factors were not easily interpretable, and may have been an artefact of differing item difficulties. Strong internal consistency and high factor loadings for the one-factor solution supported unidimensionality. Furthermore, the WHODAS II was found to be a ‘strong’ Mokken scale. Measurement invariance was supported by the similarity of factor loadings across sites, and by the high between-site correlations in item difficulties. The Mokken results strongly support that the WHODAS II 12-item screener is a unidimensional and hierarchical scale confirming to item response theory (IRT) principles, at least at the monotone homogeneity model level. More work is needed to assess the generalizability of our findings to different populations. Copyright © 2010 John Wiley & Sons, Ltd. PMID:20104493

  5. Utility of the World Health Organization Disability Assessment Schedule II in schizophrenia.

    Science.gov (United States)

    Guilera, Georgina; Gómez-Benito, Juana; Pino, Oscar; Rojo, J Emilio; Cuesta, Manuel J; Martínez-Arán, Anabel; Safont, Gemma; Tabarés-Seisdedos, Rafael; Vieta, Eduard; Bernardo, Miguel; Crespo-Facorro, Benedicto; Franco, Manuel; Rejas, Javier

    2012-07-01

    The World Health Organization Disability Assessment Schedule II (WHODAS II) was developed for assessing disability. This study provides data on the validity and utility of the Spanish version of the WHODAS II in a large sample of patients with schizophrenia. The sample included 352 patients with a schizophrenia spectrum disorder. They completed a comprehensive assessment battery including measures of psychopathology, functionality and quality-of-life. A sub-sample of 36 patients was retested after six months to assess its temporal stability. Participation in society (6.3%) and Life activities (4.0%) were the domains with the highest percentage of missing data. The internal consistency (Cronbach's alpha) of the total scale was 0.94, and the test-retest stability reached an intraclass correlation coefficient of 0.92. It became apparent that the six primary factor models represent a better fit with reality than other competing models. Relationships between the WHODAS and measures of symptomatology, social and work-related functionality, and quality-of-life were in the expected direction and the scale was ultimately found to be able to differentiate among patients with different degrees of disease severity and different work status. Assessment of disability using appropriate tools is a crucial aspect in the context of mental health and, in this regard, the Spanish version of the WHODAS II shows ample evidence of validity in patients with schizophrenia. The most important contribution of this study is that it is the first analyzing the Spanish version of the WHODAS II (36-item version) in a large sample of patients with schizophrenia. Copyright © 2012 Elsevier B.V. All rights reserved.

  6. Modelo predictivo de discapacidad en adultos con lesión medular de San Juan de Pasto (Colombia): resultados desde WHO-DAS II

    OpenAIRE

    Imbachi Menéses, Leila Rosmery; Roldán González, Elizabeth; Silva Ruíz, Adriana Isabel; Henao Lema, Claudia Patricia; Pérez Parra, Julio Ernesto

    2013-01-01

    Objetivo: Establecer un modelo predictivo del grado de discapacidad en adultos con lesión medular de San Juan de Pasto (Colombia) a partir de la utilización del WHO-DAS II. Métodos: Se correlacionó el grado de discapacidad (por áreas y global) con variables sociodemográficas, clínicas y relacionadas con los servicios de rehabilitación y se construyó un modelo de regresión lineal múltiple para discapacidad global. Participaron 42 personas con lesión medular de variada etiología, nivel neuro...

  7. Modelo predictivo del grado de discapacidad en adultos con lesión medular de Bucaramanga (Colombia): resultados desde WHO-DAS II

    OpenAIRE

    Gómez Díaz, Isabel Cristina; Sossa Rojas, Luz Karime; Torres Marmolejo, Lina María; Henao Lema, Claudia Patricia; Pérez Parra, Julio Ernesto

    2012-01-01

    Objetivo: Establecer un modelo predictivo del grado de discapacidad en adultos con lesión medular de Bucaramanga (Colombia) a partir de la utilización del WHO-DAS II. Métodos: Se correlacionó el grado de discapacidad (por áreas y global) con variables sociodemográficas, clínicas y relacionadas con los servicios de rehabilitación, y se construyó un modelo de regresión lineal múltiple para discapacidad global. Participaron 48 personas con lesión medular de variada etiología, nivel neurológic...

  8. Modelo predictivo del grado de discapacidad en adultos con lesión medular de Bucaramanga (Colombia): resultados desde WHO-DAS II

    OpenAIRE

    Gómez Díaz, Isabel Cristina; Sossa Rojas, Luz Karime; Torres Marmolejo, Lina María; Henao Lema, Claudia Patricia; Pérez Parra, Julio Ernesto

    2012-01-01

    Objetivo: Establecer un modelo predictivo del grado de discapacidad en adultos con lesión medular de Bucaramanga (Colombia) a partir de la utilización del WHO-DAS II. Métodos: Se correlacionó el grado de discapacidad (por áreas y global) con variables sociodemográficas, clínicas y relacionadas con los servicios de rehabilitación, y se construyó un modelo de regresión lineal múltiple para discapacidad global. Participaron 48 personas con lesión medular de variada etiología, nivel neurológic...

  9. Modelo predictivo de discapacidad en adultos con lesión medular de Bogotá (Colombia): resultados desde WHO-DAS II

    OpenAIRE

    Acosta Otálora, Martha Lucía; Parra Sierra, Sandra Jazmine; Quino Avila, Aura Cristina; Pérez Parra, Julio Ernesto; Henao Lema, Claudia Patricia

    2013-01-01

    Objetivo: Establecer un modelo predictivo del grado de discapacidad en adultos con lesión medular de Bogotá (Colombia) a partir de la utilización del WHO-DAS II. Métodos: Se correlacionó el grado de discapacidad (por áreas y global) con variables sociodemográficas, clínicas y relacionadas con los servicios de rehabilitación, y se construyó un modelo de regresión lineal múltiple para discapacidad global. Participaron 51 personas con lesión medular de variada etiología, nivel neurológico y c...

  10. Modelo predictivo de discapacidad en adultos con lesión medular de San Juan de Pasto (Colombia): resultados desde WHO-DAS II

    OpenAIRE

    Imbachi Menéses, Leila Rosmery; Roldán González, Elizabeth; Silva Ruíz, Adriana Isabel; Henao Lema, Claudia Patricia; Pérez Parra, Julio Ernesto

    2013-01-01

    Objetivo: Establecer un modelo predictivo del grado de discapacidad en adultos con lesión medular de San Juan de Pasto (Colombia) a partir de la utilización del WHO-DAS II. Métodos: Se correlacionó el grado de discapacidad (por áreas y global) con variables sociodemográficas, clínicas y relacionadas con los servicios de rehabilitación y se construyó un modelo de regresión lineal múltiple para discapacidad global. Participaron 42 personas con lesión medular de variada etiología, nivel neuro...

  11. Modelo predictivo del grado de discapacidad en adultos con lesión medular: resultados desde el WHO-DAS II

    Directory of Open Access Journals (Sweden)

    Claudia Patricia Henao Lema

    2011-08-01

    Full Text Available Objective: To establish a prediction model of the degree of disability in adults with Spinal Cord Injury (SCI based on the use of the WHO-DAS II . Methods: The disability degree was correlated with three variable groups: clinical, sociodemographic and those related with rehabilitation services. A model of multiple linearregression was built to predict disability. 45 people with sciexhibiting diverse etiology, neurological level and completenessparticipated. Patients were older than 18 and they had more than a six-month post-injury. The WHO-DAS II and the ASIA impairment scale(AIS were used. Results: Variables that evidenced a significant relationship with disability were the following: occupationalsituation, type of affiliation to the public health care system, injury evolution time, neurological level, partial preservation zone,ais motor and sensory scores and number of clinical complications during the last year. Complications significantly associated todisability were joint pain, urinary infections, intestinal problemsand autonomic disreflexia. None of the variables related to rehabilitation services showed significant association with disability. The disability degree exhibited significant differencesin favor of the groups that received the following services: assistive devices supply and vocational, job or educational counseling. Conclusions: The best prediction disability model inadults with sci with more than six months post-injury was built withvariables of injury evolution time, AIS sensory score and injury-related unemployment.

  12. Modelo predictivo de discapacidad en adultos con lesión medular de Medellín (Colombia): resultados desde WHO-DAS II

    OpenAIRE

    Valencia Legarda, Fanny; Rivera Rujana, Diana María; Londoño Prieto, Jerónimo; Henao Lema, Claudia Patricia; Pérez Parra, Julio Ernesto

    2012-01-01

    Objetivo: Establecer un modelo predictivo del grado de discapacidad en adultos con lesión medular de Medellín (Colombia) a partir de la utilización del WHO-DAS II. Métodos: Se correlacionó el grado de discapacidad (por áreas y global) con variables sociodemográficas, clínicas y relacionadas con el acceso a servicios de rehabilitación y se construyó un modelo de regresión lineal múltiple para discapacidad global. Participaron 49 personas con lesión medular de variada etiología, nivel Neurológi...

  13. Modelo predictivo de discapacidad en adultos con lesión medular de Medellín (Colombia): resultados desde WHO-DAS II

    OpenAIRE

    Valencia Legarda, Fanny; Rivera Rujana, Diana María; Londoño Prieto, Jerónimo; Henao Lema, Claudia Patricia; Pérez Parra, Julio Ernesto

    2012-01-01

    Objetivo: Establecer un modelo predictivo del grado de discapacidad en adultos con lesión medular de Medellín (Colombia) a partir de la utilización del WHO-DAS II. Métodos: Se correlacionó el grado de discapacidad (por áreas y global) con variables sociodemográficas, clínicas y relacionadas con el acceso a servicios de rehabilitación y se construyó un modelo de regresión lineal múltiple para discapacidad global. Participaron 49 personas con lesión medular de variada etiología, nivel Neurológi...

  14. Modelo predictivo del grado de discapacidad en adultos con lesión medular de Popayán (Colombia): resultados desde el WHO-DAS II

    OpenAIRE

    Daza Perdomo, Sandra Milena; Ramírez Perdomo, María Angélica; Salazar Dulcey, Mabel Lorena; Henao Lema, Claudia Patricia; Pérez Parra, Julio Ernesto

    2012-01-01

    Objetivo: Formular un modelo predictivo del grado de discapacidad en adultos con lesión medular de Popayán (Colombia), a partir de la utilización del WHO-DAS II. Métodos: Se correlacionó el grado de discapacidad (por áreas y global) con variables sociodemográficas, clínicas y relacionadas con los servicios de rehabilitación y se construyó un modelo de regresión lineal múltiple para discapacidad global. Participaron 39 personas con lesión medular de variada etiología, nivel neurológico y co...

  15. Análisis de la discapacidad en el paciente crónico mediante la herramienta WHODAS II

    Directory of Open Access Journals (Sweden)

    Ana Rebollo Rubio

    2014-03-01

    Full Text Available La Dependencia Funcional se define como la pérdida de autonomía física, psíquica o intelectual a causa de procesos relacionados con la salud del individuo. La discapacidad es un atributo inseparable de la dependencia, pero no recíproco. La dependencia funcional es el resultado de una discapacidad, pero no todos los discapacitados tienen dependencia funcional puesto que no precisan ayuda de terceros. El objetivo del estudio es valorar la discapacidad y dependencia funcional y comparar los resultados obtenidos mediante el Índice de Barthel, con los obtenidos según el World Health Organization Disability Schedule versión 2 y relacionarlos con una variable predictora de dependencia funcional como el Índice de Comorbilidad de Charlson modificado por edad para evaluar la congruencia de ambas medidas. Material y método: Estudio epidemiológico de corte trasversal. Resultados: Analizando conjuntamente los valores de Índice de Barthel y World Health Organization Disability Schedule versión 2 con el Índice de Comorbilidad de Charlson modificado por edad obtuvimos que si bien ambas correlacionan significativamente con la comorbilidad (p<0,05, parece que la dependencia funcional lo hace con mayor fuerza que la discapacidad. Conclusiones: La medida de la discapacidad y su adscripción y tabulación en una clasificación como la Clasificación Internacional del Funcionamiento, la Discapacidad y la Salud nos permite identificar de forma precoz áreas de discapacidad física, psíquica o relacional que en un futuro pudieran abocarse a dependencia funcional.

  16. Assessing cognitive-related disability in schizophrenia: Reliability, validity and underlying factors of the evaluation of cognitive processes involved in disability in schizophrenia scale.

    Science.gov (United States)

    Passerieux, Christine; Bulot, Virginie; Hardy-Baylé, Marie-Christine; Roux, Paul

    2017-04-11

    We have developed a new scale that assesses disability caused by cognitive impairments in schizophrenia, in order to evaluate the functional impact of schizophrenia and help the prescription of rehabilitation interventions. The aim of the study was to assess its psychometrical properties. Mental healthcare professionals and relatives of individuals with schizophrenia developed and rated the evaluation of cognitive processes involved in disability in schizophrenia scale, which included 13 items. Its construct validity was assessed through a factorial analysis; its concurrent validity was evaluated based on ecological outcomes, its convergent validity was tested against the World Health Organization Disability Assessment Schedule (WHODAS II), and its reliability was estimated based on internal consistency and inter-rater reliability. Overall, 215 patients were included. Our findings supported a two-factor structure which accounted for 46% of the variance. The internal consistency and inter-rater reliability were good. The convergent validity showed a strong correlation with the WHODAS II. The concurrent validity showed strong relationships with work status, independent living, level and adequacy of institutional care. The good psychometric properties of the scale suggest a role for this tool in assessing schizophrenia-related disability and evaluating the need for cognitive remediation. Implication for Rehabilitation Schizophrenia is a chronic disorder leading to a severe psychiatric handicap. The scale showed good psychometric properties in individuals with schizophrenia and severe psychiatric disability. The scale is easy and quick to administer (about 15 min). The scale may help to identify targets for rehabilitation interventions in individuals with schizophrenia.

  17. Scheduling participants of Assessment Centres

    DEFF Research Database (Denmark)

    Lysgaard, Jens; Løber, Janni

      Assessment Centres are used as a tool for psychologists and coaches to observe a number of dimensions in a person's behaviour and test his/her potential within a number of chosen focus areas. This is done in an intense course, with a number of different exercises which expose each participant...... Centres usually last two days and involve 3-6 psychologists or trained coaches as assessors. An entire course is composed of a number of rounds, with each round having its individual duration. In each round, the participants are divided into a number of groups with prespecifed pairing of group sizes...

  18. Assessment of a Heuristic Algorithm for Scheduling Theater Security Cooperation Naval Missions

    Science.gov (United States)

    2009-03-01

    NAVAL POSTGRADUATE SCHOOL MONTEREY, CALIFORNIA THESIS ASSESSMENT OF A HEURISTIC ALGORITHM FOR SCHEDULING THEATER SECURITY...blank) 2. REPORT DATE March 2009 3. REPORT TYPE AND DATES COVERED Master’s Thesis 4. TITLE AND SUBTITLE Assessment of a Heuristic Algorithm for...INTENTIONALLY LEFT BLANK iii Approved for public release; distribution is unlimited ASSESSMENT OF A HEURISTIC ALGORITHM FOR SCHEDULING THEATER

  19. Synthesis and Stochastic Assessment of Cost-Optimal Schedules

    OpenAIRE

    Mader, A.H.; Bohnenkamp, H.C.; Usenko, Y.S.; Jansen, D.N.; J L Hurink; Hermanns, H.

    2006-01-01

    We treat the problem of generating cost-optimal schedules for orders with individual due dates and cost functions based on earliness/tardiness. Orders can run in parallel in a resource-constrained manufacturing environment, where resources are subject to stochastic breakdowns. The goal is to generate schedules while minimizing the expected costs. First, we estimate the distribution of each order type by simulation (assuming a reasonable machine/load model) and derive from the cost-function an...

  20. Focus assessed transthoracic echocardiography for preoperative assessment in patients scheduled for acute surgery

    DEFF Research Database (Denmark)

    Bøtker, Morten Thingemann; Frederiksen, C.A.; Lauridsen Vang, M.K.

    2013-01-01

    Introduction: Unexpected cardiopulmonary complications are a well-known and feared entity during surgery and anaesthesia, acknowledged in previous reports. Focus Assessed Transthoracic Echocardiography (FATE) has proven to be feasible in intensive care units and perioperatively for evaluation...... were recorded. After the routine preoperative assessment these were reported to the anaesthetist responsible for the anaesthesia.Whether or not this led to changes in the perioperative management was registered. Results: 112 patients scheduled for acute surgery were included. Mean age was 62 years (57...

  1. Assessing the Predictability of Scheduled-Vehicle Travel Times

    DEFF Research Database (Denmark)

    Tiesyte, Dalia; Jensen, Christian Søndergaard

    2009-01-01

    One of the most desired and challenging services in collective transport systems is the real-time prediction of the near-future travel times of scheduled vehicles, especially public buses, thus improving the experience of the transportation users, who may be able to better schedule their travel......, and also enabling system operators to perform real-time monitoring. While travel-time prediction has been researched extensively during the past decade, the accuracies of existing techniques fall short of what is desired, and proposed mathematical prediction models are often not transferable to other...... systems because the properties of the travel-time-related data of vehicles are highly context-dependent, making the models difficult to fit. We propose a framework for evaluating various predictability types of the data independently of the model, and we also compare predictability analysis results...

  2. Assessing the Predictability of Scheduled-Vehicle Travel Times

    DEFF Research Database (Denmark)

    Tiesyte, Dalia; Jensen, Christian Søndergaard

    2009-01-01

    One of the most desired and challenging services in collective transport systems is the real-time prediction of the near-future travel times of scheduled vehicles, especially public buses, thus improving the experience of the transportation users, who may be able to better schedule their travel...... of travel times with the actual prediction errors for real bus trajectories. We have applied the proposed framework to real-time data collected from buses operating in Copenhagen, Denmark......., and also enabling system operators to perform real-time monitoring. While travel-time prediction has been researched extensively during the past decade, the accuracies of existing techniques fall short of what is desired, and proposed mathematical prediction models are often not transferable to other...

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

    Directory of Open Access Journals (Sweden)

    Amar N. Katre

    2014-01-01

    Full Text Available 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 scheduling and patient satisfaction in a pediatric dental setup with the objective of understanding the parameters related to appointment scheduling to increase patient satisfaction. Method. A total of 40 patients, who visited the Department of Pediatric and Preventive Dentistry, YMT Dental College & Hospital, for dental treatment were selected on a random basis. A questionnaire with a set of 6 questions with a rating scale of 1–5 to assess the patient satisfaction related to appointment scheduling was prepared. Results. A significant number of the patients were happy with the existing appointment scheduling system barring a few exceptions.

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

    Science.gov (United States)

    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 scheduling and patient satisfaction in a pediatric dental setup with the objective of understanding the parameters related to appointment scheduling to increase patient satisfaction. Method. A total of 40 patients, who visited the Department of Pediatric and Preventive Dentistry, YMT Dental College & Hospital, for dental treatment were selected on a random basis. A questionnaire with a set of 6 questions with a rating scale of 1–5 to assess the patient satisfaction related to appointment scheduling was prepared. Results. A significant number of the patients were happy with the existing appointment scheduling system barring a few exceptions. PMID:25610464

  5. Relationships between disability, quality of life and prevalence of nonmotor symptoms in Parkinson's disease.

    Science.gov (United States)

    Leonardi, Matilde; Raggi, Alberto; Pagani, Marco; Carella, Francesco; Soliveri, Paola; Albanese, Alberto; Romito, Luigi

    2012-01-01

    Patients with Parkinson's disease suffer from a variety of motor and nonmotor symptoms (NMS), report reduced quality of life and increased disability. Aims of this study are to assess the impact of Parkinson's disease on disability and quality of life, to evaluate the relationships between them and NMS prevalence. In this cross-sectional study, adult patients were consecutively enrolled and administered the World Health Organization Disability Assessment Schedule (WHO-DAS II), the 36-Item Short-Form Health Survey (SF-36) and the Non Motor Symptoms Questionnaire (NMSQuest). One-sample t-test was used to compare WHO-DAS II and SF-36 scores with normative value. Pearson's correlation was performed between NMSQuest, WHO-DAS II and SF-36 summary scales. Independent-sample t-test was used to compare NMSQuest, WHO-DAS II and SF-36 scores in patients with Hoehn & Yahr stage quality of life, higher disability and more NMS. Parkinson's disease severity is strongly associated with reduced quality of life, increased disability and NMS prevalence. Disability and quality of life assessment tools measure psychosocial facets that are similar specifically with regard to physical health component of health-related quality of life, are sensitive enough to capture differences related to disease's progression and increased prevalence of NMS.

  6. Normative Data for the 12 Item WHO Disability Assessment Schedule 2.0

    OpenAIRE

    Gavin Andrews; Alice Kemp; Matthew Sunderland; Michael Von Korff; Tevik Bedirhan Ustun

    2009-01-01

    BACKGROUND: The World Health Organization Disability Assessment Schedule (WHODAS 2.0) measures disability due to health conditions including diseases, illnesses, injuries, mental or emotional problems, and problems with alcohol or drugs. METHOD: The 12 Item WHODAS 2.0 was used in the second Australian Survey of Mental Health and Well-being. We report the overall factor structure and the distribution of scores and normative data (means and SDs) for people with any physical disorder, any mental...

  7. Assessment of the impact of scheduled postmarketing safety summary analyses on regulatory actions.

    Science.gov (United States)

    Sekine, S; Pinnow, E E; Wu, E; Kurtzig, R; Hall, M; Dal Pan, G J

    2016-07-01

    In addition to standard postmarketing drug safety monitoring, Section 915 of the Food and Drug Administration Amendments Act of 2007 (FDAAA) requires the US Food and Drug Administration (FDA) to conduct a summary analysis of adverse event reports to identify risks of a drug or biologic product 18 months after product approval, or after 10,000 patients have used the product, whichever is later. We assessed the extent to which these analyses identified new safety signals and resultant safety-related label changes. Among 458 newly approved products, 300 were the subjects of a scheduled analysis; a new safety signal that resulted in a safety-related label change was found for 11 of these products. Less than 2% of 713 safety-related label changes were based on the scheduled analyses. Our study suggests that the safety summary analyses provide only marginal value over other pharmacovigilance activities.

  8. The Self Care Assessment Schedule (SCAS)--I. The purpose and construction of a new assessment of self care behaviours.

    Science.gov (United States)

    Barnes, D; Benjamin, S

    1987-01-01

    The Self Care Assessment Schedule (SCAS) is a new questionnaire which measures the frequency of ten behaviours during a period of fourteen days. Data are presented for five patient samples and a group of non consulting controls and the distributions of scores between groups show expected differences. In some groups scores are significantly greater for male subjects and those with the most chronic disorders but scores are not related to age. It is tentatively suggested that the SCAS may be used to determine the severity of aspects of disability based on percentile scores.

  9. An assessment of a days off decomposition approach to personnel shift scheduling

    NARCIS (Netherlands)

    van Veldhoven, Sophie; Post, Gerhard F.; van der Veen, Egbert; Curtois, Tim

    This paper studies a two-phase decomposition approach to solving the personnel scheduling problem. The first phase creates a days-off-schedule, indicating working days and days off for each employee. The second phase assigns shifts to the working days in the days-off-schedule. This decomposition is

  10. An assessment of a days off decomposition approach to personnel scheduling

    NARCIS (Netherlands)

    van Veldhoven, Sophie; Post, Gerhard F.; van der Veen, Egbert; Curtois, Tim

    This paper studies a two-phase decomposition approach to solve the personnel scheduling problem. The first phase creates a days off schedule, indicating working days and days off for each employee. The second phase assigns shifts to the working days in the days off schedule. This decomposition is

  11. An assessment of a days off decomposition approach to personnel scheduling

    NARCIS (Netherlands)

    Veldhoven, van Sophie; Post, Gerhard; Veen, van der Egbert; Curtois, Tim

    2013-01-01

    This paper studies a two-phase decomposition approach to solve the personnel scheduling problem. The first phase creates a days off schedule, indicating working days and days off for each employee. The second phase assigns shifts to the working days in the days off schedule. This decomposition is mo

  12. An assessment of a days off decomposition approach to personnel shift scheduling

    NARCIS (Netherlands)

    Veldhoven, van Sophie; Post, Gerhard; Veen, van der Egbert; Curtois, Tim

    2016-01-01

    This paper studies a two-phase decomposition approach to solving the personnel scheduling problem. The first phase creates a days-off-schedule, indicating working days and days off for each employee. The second phase assigns shifts to the working days in the days-off-schedule. This decomposition is

  13. Observational Assessment of Preschool Disruptive Behavior, Part II: Validity of the Disruptive Behavior Diagnostic Observation Schedule (DB-DOS)

    Science.gov (United States)

    Wakschlag, Lauren S.; Briggs-Gowan, Margaret J.; Hill, Carri; Danis, Barbara; Leventhal, Bennett L.; Keenan, Kate; Egger, Helen L.; Cicchetti, Domenic; Burns, James; Carter, Alice S.

    2008-01-01

    A study is conducted to determine whether the multidomain, multicontext Disruptive Behavior Diagnostic Observation Schedule (DB-DOS) is a valid observational method for assessing disruptive behavior of preschool children. It is concluded that the DB-DOS is a valid method for a direct observational assessment of clinically significant disruptive…

  14. World Health Organization disability assessment schedule 2.0: An international systematic review.

    Science.gov (United States)

    Federici, Stefano; Bracalenti, Marco; Meloni, Fabio; Luciano, Juan V

    2017-11-01

    This systematic review examines research and practical applications of the World Health Organization Disability Assessment Schedule (WHODAS 2.0) as a basis for establishing specific criteria for evaluating relevant international scientific literature. The aims were to establish the extent of international dissemination and use of WHODAS 2.0 and analyze psychometric research on its various translations and adaptations. In particular, we wanted to highlight which psychometric features have been investigated, focusing on the factor structure, reliability, and validity of this instrument. Following Preferred Reporting Items for Systematic reviews and Meta-Analyses (PRISMA) methodology, we conducted a search for publications focused on "whodas" using the ProQuest, PubMed, and Google Scholar electronic databases. We identified 810 studies from 94 countries published between 1999 and 2015. WHODAS 2.0 has been translated into 47 languages and dialects and used in 27 areas of research (40% in psychiatry). The growing number of studies indicates increasing interest in the WHODAS 2.0 for assessing individual functioning and disability in different settings and individual health conditions. The WHODAS 2.0 shows strong correlations with several other measures of activity limitations; probably due to the fact that it shares the same disability latent variable with them. Implications for Rehabilitation WHODAS 2.0 seems to be a valid, reliable self-report instrument for the assessment of disability. The increasing interest in use of the WHODAS 2.0 extends to rehabilitation and life sciences rather than being limited to psychiatry. WHODAS 2.0 is suitable for assessing health status and disability in a variety of settings and populations. A critical issue for rehabilitation is that a single "minimal clinically important .difference" score for the WHODAS 2.0 has not yet been established.

  15. Evidence from a breast cancer hypofractionated schedule: late skin toxicity assessed by ultrasound.

    Science.gov (United States)

    Landoni, Valeria; Giordano, Carolina; Marsella, Annelisa; Saracino, Biancamaria; Petrongari, Maria; Ferraro, Anna; Strigari, Lidia; Pinnarò, Paola

    2013-10-24

    Feasibility of whole breast hypofractionated radiotherapy schedules in breast conserving therapy is recognized however concerns remain about the role of the boost dose on the overall treatment's potential toxicity. In this study we report on the possibility to quantitatively evaluate radiation induced toxicity in patients treated with an abbreviated course with major concern in the irradiated boost region. Eighty-nine patients who underwent conservative surgery for early-stage breast cancer followed by adjuvant accelerated hypofractionated whole breast radiotherapy were included in this study to assess skin and subcutaneous tissue late toxicity by means of ultrasonographic quantitative examination. For each patient the skin thickness was measured at four positions: on the irradiated breast, in the boost region and in the corresponding positions in the contra-lateral not treated breast. All patients were scanned by the same radiologist to reduce potential inter-operator variability, the operator was blind to the scoring of the patient CTCv3 late toxicity as well as patient treatment characteristics. Ultrasound assessment and clinical evaluation were compared. The median time between the end of adjuvant radiotherapy and ultrasound examination was 20.5 months. The measured mean skin thickness in the irradiated breast was 2.13 ± 0.72 mm while in the mirror region of the contra-lateral healthy breast was 1.61 ± 0.29 mm. The measured mean skin thickness in the irradiated boost region was 2.25 ± 0.79 mm versus 1.63 ± 0.33 mm in the corresponding region of contra-lateral healthy breast. The mean increment in skin thickness respect to the counterpart in the healthy breast was 0.52 ± 0.67 mm and 0.62 ± 0.74 mm for the breast and the boost region respectively. A significant direct correlation was found between the increment in skin thickness in the irradiated breast and in the boost region with fibrosis (G ≥ 1). In this study results from a breast cancer

  16. World health organization disability assessment schedule 2.0 as an objective assessment tool for predicting return to work after a stroke.

    Science.gov (United States)

    Huang, Shih-Wei; Chi, Wen-Chou; Chang, Kwang-Hwa; Yen, Chia-Feng; Liao, Hua-Fang; Escorpizo, Reuben; Liou, Tsan-Hon

    2017-06-28

    To analyze whether World Health Organization Disability Assessment Schedule 2.0 can be used as an objective assessment tool for predicting the return-to-work status of working-age patients with stroke. We obtained the data on 2963 patients disabled by stroke (age Disability for the July 2012-January 2014 period. Of these patients, 119 could return to work, whereas 2844 could not. Demographic data and World Health Organization Disability Assessment Schedule 2.0 standardized scores of patients with stroke who could return to work and those who could not (return to work and nonreturn-to-work groups, respectively) were analyzed and compared using the chi-squared and independent Student's t-tests. Receiver operating characteristic curve analysis was performed to investigate the prediction accuracy for the return-to-work status, and the optimal cutoff point was determined using the Youden index. Binary logistic regression was employed to determine the predictors of the return-to-work status of patients with stroke. The World Health Organization Disability Assessment Schedule 2.0 scores in all domains were lower in the return-to-work group than in the nonreturn-to-work group. The receiver operating characteristic curve showed moderate accuracy for all domain-specific scores [area under the curve, 0.6-0.8] and good accuracy for the summary scores of World Health Organization Disability Assessment Schedule 2.0 (area under the curve, >0.8). Binary logistic regression revealed that younger age, less severe stroke and standardized World Health Organization Disability Assessment Schedule 2.0 summary scores below the cutoff points were predictors of the return to work status of working-age patients disabled by stroke. World Health Organization Disability Assessment Schedule 2.0 can be used as an objective assessment tool for predicting the return-to-work status of working-age patients disabled by stroke. This tool can aid in establishing rehabilitation strategies and goal

  17. Normative data for the 12 item WHO Disability Assessment Schedule 2.0.

    Directory of Open Access Journals (Sweden)

    Gavin Andrews

    Full Text Available BACKGROUND: The World Health Organization Disability Assessment Schedule (WHODAS 2.0 measures disability due to health conditions including diseases, illnesses, injuries, mental or emotional problems, and problems with alcohol or drugs. METHOD: The 12 Item WHODAS 2.0 was used in the second Australian Survey of Mental Health and Well-being. We report the overall factor structure and the distribution of scores and normative data (means and SDs for people with any physical disorder, any mental disorder and for people with neither. FINDINGS: A single second order factor justifies the use of the scale as a measure of global disability. People with mental disorders had high scores (mean 6.3, SD 7.1, people with physical disorders had lower scores (mean 4.3, SD 6.1. People with no disorder covered by the survey had low scores (mean 1.4, SD 3.6. INTERPRETATION: The provision of normative data from a population sample of adults will facilitate use of the WHODAS 2.0 12 item scale in clinical and epidemiological research.

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

    Science.gov (United States)

    Heyward, Ann O.

    1989-01-01

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

  19. Using the World Health Organization’s Disability Assessment Schedule (2 to assess disability in community-dwelling stroke patients

    Directory of Open Access Journals (Sweden)

    Ayorinde I. Arowoiya

    2017-02-01

    Full Text Available Background: Measurement of the extent of disability post-stroke is important to determine the impact of disability on these individuals and the effectiveness of interventions aimed at reducing the impact of their disability. Instruments used to measure disability should, however, be culturally sensitive.Objective: The aim of this study was to conduct a disability assessment using the World Health Organization’s Disability Assessment Schedule 2.0 (WHODAS.Methods: A cross-sectional design was used. The study population included a conveniently selected 226 stroke patients living within community settings. These patients were followed up 6–12 months following the onset of the stroke and are currently residing in the community. Disability was measured using the WHODAS 2.0 and the data were analysed using descriptive and inferential statistics in Statistical Package for Social Sciences (SPSS. The WHODAS 2.0 enabled the assessment of disability within the domains of cognition, mobility, self-care, getting along with others, household activities, work activities and participation. Ethical clearance for the study was obtained from the University of the Western Cape.Results: In this sample, the domain mostly affected were household activities, with 38% having extreme difficulty with conducting these activities. This was followed by mobility (27% and self-care (25% being the domains that participants also had extreme difficulty with. Getting along with others was the domain that most (51% of the participants had no difficulty with. ANOVA one-way test showed no significant association of participation restrictions with demographics factors.Conclusion: Rehabilitation of patients with stroke should focus on the patient’s ability to engage in household activities, mobility and self-care.

  20. Assessing behavioral control across reinforcer solutions on a fixed-ratio schedule of reinforcement in rats.

    Science.gov (United States)

    Shillinglaw, Joel E; Everitt, Ian K; Robinson, Donita L

    2014-06-01

    Instrumental behavior can shift from flexible, goal-directed actions to automatic, stimulus-response actions. The satiety-specific devaluation test assesses behavioral flexibility by evaluating reward seeking after temporary devaluation of the reinforcer via satiety; a decrease in responding compared to control conditions indicates goal-directed behavior. We have observed variability in the outcome of this test that may be dependent on the reinforcer. Another test of habit, contingency degradation, involves changing the action-outcome association over the course of retraining and determines whether reward seeking is sensitive to changing contingencies. We hypothesized that the outcome of the contingency-degradation test would remain consistent across reinforcers, while the satiety-specific devaluation test may vary across reinforcers because it depends on the ability of the reinforcer to induce satiety. Therefore, we trained rats to self-administer 1.5% sucrose, 10% sucrose, 10% ethanol, or 10 mM monosodium glutamate (MSG) on a fixed-ratio (FR5) schedule that has been shown to promote long-term, goal-directed responding. Next, behavioral flexibility was evaluated in three satiety-specific devaluation tests over 6 weeks. Finally, we investigated reward seeking after contingency-degradation training. All groups displayed sensitivity to satiety-specific devaluation in the first test, indicating goal-directed behavior. While the 10% sucrose and ethanol groups remained goal-directed, the 1.5% sucrose and MSG groups exhibited habit-like behavior in later tests. Nevertheless, all groups displayed decreased responding in an extinction session after contingency-degradation training, indicating goal-directed behavior. These results demonstrate that tests of behavioral flexibility can yield dissimilar results in the same rats. Next, rats from the 1.5% sucrose group underwent the entire experiment again, now self-administering 10% sucrose. These rats showed pronounced goal

  1. Assessment of New Load Schedules for the Machine Calibration of a Force Balance

    Science.gov (United States)

    Ulbrich, N.; Gisler, R.; Kew, R.

    2015-01-01

    New load schedules for the machine calibration of a six-component force balance are currently being developed and evaluated at the NASA Ames Balance Calibration Laboratory. One of the proposed load schedules is discussed in the paper. It has a total of 2082 points that are distributed across 16 load series. Several criteria were applied to define the load schedule. It was decided, for example, to specify the calibration load set in force balance format as this approach greatly simplifies the definition of the lower and upper bounds of the load schedule. In addition, all loads are assumed to be applied in a calibration machine by using the one-factor-at-a-time approach. At first, all single-component loads are applied in six load series. Then, three two-component load series are applied. They consist of the load pairs (N1, N2), (S1, S2), and (RM, AF). Afterwards, four three-component load series are applied. They consist of the combinations (N1, N2, AF), (S1, S2, AF), (N1, N2, RM), and (S1, S2, RM). In the next step, one four-component load series is applied. It is the load combination (N1, N2, S1, S2). Finally, two five-component load series are applied. They are the load combination (N1, N2, S1, S2, AF) and (N1, N2, S1, S2, RM). The maximum difference between loads of two subsequent data points of the load schedule is limited to 33 % of capacity. This constraint helps avoid unwanted load "jumps" in the load schedule that can have a negative impact on the performance of a calibration machine. Only loadings of the single- and two-component load series are loaded to 100 % of capacity. This approach was selected because it keeps the total number of calibration points to a reasonable limit while still allowing for the application of some of the more complex load combinations. Data from two of NASA's force balances is used to illustrate important characteristics of the proposed 2082-point calibration load schedule.

  2. An Assessment of Some Watch Schedule Variants Used in Cdn Patrol Frigates: OP Nanook 2011

    Science.gov (United States)

    2012-12-01

    abstracts in both official languages unless the text is bilingual .) Background. Previous research conducted by DRDC Toronto to evaluate watch schedule...of the trial (day 7), while minimum daily cognitive effectiveness was in excess of BAC 0.05% on second day of the trail (day 3), and reached BAC...available at awakening and during various phases of the circadian rhythm. The table shows the mission split into two work intervals, first half and second

  3. Construction scheduled delay risk assessment by using combined AHP-RII methodology for an international NPP project

    Energy Technology Data Exchange (ETDEWEB)

    Hossen, Mufazal Muhammed; Kang, Sun Koo; Kim, Jong Hyun [KEPCO International Nuclear Graduate School (KINGS), Ulsan (Korea, Republic of)

    2015-04-15

    In this study, Nuclear Power Plant (NPP) construction schedule delay risk assessment methodology is developed and the construction delay risk is assessed for turnkey international NPP projects. Three levels of delay factors were selected through literature review and discussions with nuclear industry experts. A questionnaire survey was conducted on the basis of an analytic hierarchy process (AHP) and Relative Importance Index (RII) methods and the schedule delay risk is assessed qualitatively and quantitatively by severity and frequency of occurrence of delay factors. This study assigns four main delay factors to the first level: main contractor, utility, regulatory authority, and financial and country factor. The second and the third levels are designed with 12 sub-factors and 32 sub-sub-factors, respectively. This study finds the top five most important sub-sub-factors, which are as follows: policy changes, political instability and public intervention; uncompromising regulatory criteria and licensing documents conflicting with existing regulations; robust design document review procedures; redesign due to errors in design and design changes; and worldwide shortage of qualified and experienced nuclear specific equipment manufacturers. The proposed combined AHP-RII methodology is capable of assessing delay risk effectively and efficiently. Decision makers can apply risk informed decision making to avoid unexpected construction delays of NPPs.

  4. Observational Assessment of Preschool Disruptive Behavior, Part I: reliability of the Disruptive Behavior Diagnostic Observation Schedule (DB-DOS).

    Science.gov (United States)

    Wakschlag, Lauren S; Hill, Carri; Carter, Alice S; Danis, Barbara; Egger, Helen L; Keenan, Kate; Leventhal, Bennett L; Cicchetti, Domenic; Maskowitz, Katie; Burns, James; Briggs-Gowan, Margaret J

    2008-06-01

    To examine the reliability of the Disruptive Behavior Diagnostic Observation Schedule (DB-DOS), a new observational method for assessing preschool disruptive behavior. The DB-DOS is a structured clinic-based assessment designed to elicit clinically salient behaviors relevant to the diagnosis of disruptive behavior in preschoolers. Child behavior is assessed in three interactional contexts that vary by partner (parent versus examiner) and level of support provided. Twenty-one disruptive behaviors are coded within two domains: problems in Behavioral Regulation and problems in Anger Modulation. A total of 364 referred and nonreferred preschoolers participated: interrater reliability and internal consistency were assessed on a primary sample (n = 335) and test-retest reliability was assessed in a separate sample (n = 29). The DB-DOS demonstrated good interrater and test-retest reliability. Confirmatory factor analysis demonstrated an excellent fit of the DB-DOS multidomain model of disruptive behavior. The DB-DOS is a reliable observational tool for clinic-based assessment of preschool disruptive behavior. This standardized assessment method holds promise for advancing developmentally sensitive characterization of preschool psychopathology.

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

    Science.gov (United States)

    Loganantharaj, Rasiah; Thomas, Bushrod; Passonno, Nicole

    1996-01-01

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

  6. An empirical investigation of scheduling performance criteria

    NARCIS (Netherlands)

    de Snoo, C.; van Wezel, W.M.C.; Jorna, R.J.J.M.

    Planning and scheduling significantly influence organizational performance, but literature that pays attention to how organizations could or should organize and assess their planning processes is limited. We extend planning and scheduling theory with a categorization of scheduling performance

  7. Risk Level Assessment in Construction Projects Using the Schedule Performance Index

    Directory of Open Access Journals (Sweden)

    Roberto Barbosa dos Santos

    2016-01-01

    Full Text Available Construction projects are risky in both physical implementation and management. The characteristics of the risk reinforce the necessity of efficient management to increase the chances of success without commitment to its goals. This study explores the correlation of delay and the schedule performance index (SPI to evaluate the risk of a construction project completed with time overruns. The hypothesis that the SPI of projects with a delay is distinct from those projects without a delay is assumed. A database with 19 elements was used to test this hypothesis and to calculate limit values to the SPI. Therefore, the risk of delay will be small when the observed SPI is greater than the superior limit and large when the SPI is below the inferior limit. The simplicity involved in the calculation of these values showed an advantage in comparison with other methods of risk evaluation. Another strong point observed is that any company can determine the value of risk by considering its own history and support decisions like doing corrective actions.

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

  9. Distributed scheduling

    OpenAIRE

    Toptal, Ayşegül

    1999-01-01

    Ankara : Department of Industrial Engineering and the Institute of Engineering and Science of Bilkent Univ., 1999. Thesis (Master's) -- Bilkent University, 1999. Includes bibliographical references. Distributed Scheduling (DS) is a new paradigm that enables the local decisionmakers make their own schedules by considering local objectives and constraints within the boundaries and the overall objective of the whole system. Local schedules from different parts of the system are...

  10. Personnel scheduling

    OpenAIRE

    Vanden Berghe, Greet

    2012-01-01

    Personnel scheduling can become a particularly difficult optimisation problem due to human factors. And yet: people working in healthcare, transportation and other round the clock service regimes perform their duties based on a schedule that was often manually constructed. The unrewarding manual scheduling task deserves more attention from the timetabling community so as to support computation of fair and good quality results. The present abstract touches upon a set of particular characterist...

  11. Assessing and Increasing Staff Preference for Job Tasks Using Concurrent-Chains Schedules and Probabilistic Outcomes

    Science.gov (United States)

    Reed, Derek D.; DiGennaro Reed, Florence D.; Campisano, Natalie; Lacourse, Kristen; Azulay, Richard L.

    2012-01-01

    The assessment and improvement of staff members' subjective valuation of nonpreferred work tasks may be one way to increase the quality of staff members' work life. The Task Enjoyment Motivation Protocol (Green, Reid, Passante, & Canipe, 2008) provides a process for supervisors to identify the aversive qualities of nonpreferred job tasks.…

  12. Scheduling Supercomputers.

    Science.gov (United States)

    1983-02-01

    no task is scheduled with overlap. Let numpi be the total number of preemptions and idle slots of size at most to that are introduced. We see that if...no usable block remains on Qm-*, then numpi < m-k. Otherwise, numpi ! m-k-1. If j>n when this procedure terminates, then all tasks have been scheduled

  13. Early assessment of nutritional status in patients scheduled for colorectal cancer surgery.

    Science.gov (United States)

    Karlsson, Seija; Andersson, Liv; Berglund, Britta

    2009-01-01

    Nutritional support is important to optimize treatment outcomes in colorectal cancer surgery. Using retrospective review of patients' medical records, we sought to identify the kinds of nutritional problems patients with colorectal cancer reported on their first visit to the surgeon to support those at risk of malnutrition. After reviewing data from the Patient-Generated Subjective Global Assessment of Nutritional Status, patients had a supportive counseling meeting about nutrition with a nurse. Of the 153 patients, 65% were diagnosed with colon cancer and 35% with rectal cancer. Eighteen percent of those with colon cancer were overweight, and 12% were obese. Of those with rectal cancer, 10% were overweight, and 7% were obese. Weight loss was reported by 18% of the patients with colon cancer and by 12% of the patients with rectal cancer. To identify the patients who need nutritional support before colorectal cancer surgery, it is important to first identify the patients' nutritional status. When the focus is on surgery, it is possible that these problems are not mentioned if no questions are asked. Nutritional assessment at the outpatient department makes it possible to use the time lapse between examination and surgery to improve the nutritional status.

  14. Psychometric Validation of the World Health Organization Disability Assessment Schedule 2.0-Twelve-Item Version in Persons with Spinal Cord Injuries

    Science.gov (United States)

    Smedema, Susan Miller; Ruiz, Derek; Mohr, Michael J.

    2017-01-01

    Purpose: To evaluate the factorial and concurrent validity and internal consistency reliability of the World Health Organization Disability Assessment Schedule 2.0 (WHODAS 2.0) 12-item version in persons with spinal cord injuries. Method: Two hundred forty-seven adults with spinal cord injuries completed an online survey consisting of the WHODAS…

  15. The Schedule for Nonadaptive and Adaptive Personality for Youth (SNAP-Y): A New Measure for Assessing Adolescent Personality and Personality Pathology

    Science.gov (United States)

    Linde, Jennifer A.; Stringer, Deborah; Simms, Leonard J.; Clark, Lee Anna

    2013-01-01

    The Schedule for Nonadaptive and Adaptive Personality-Youth Version (SNAP-Y) is a new, reliable self-report questionnaire that assesses 15 personality traits relevant to both normal-range personality and the alternative "DSM"-5 model for personality disorder. Community adolescents, 12 to 18 years old (N = 364), completed the SNAP-Y; 347…

  16. The Schedule for Nonadaptive and Adaptive Personality for Youth (SNAP-Y): A New Measure for Assessing Adolescent Personality and Personality Pathology

    Science.gov (United States)

    Linde, Jennifer A.; Stringer, Deborah; Simms, Leonard J.; Clark, Lee Anna

    2013-01-01

    The Schedule for Nonadaptive and Adaptive Personality-Youth Version (SNAP-Y) is a new, reliable self-report questionnaire that assesses 15 personality traits relevant to both normal-range personality and the alternative "DSM"-5 model for personality disorder. Community adolescents, 12 to 18 years old (N = 364), completed the SNAP-Y; 347…

  17. Quality of life assessment with different radiotherapy schedules in palliative management of advanced carcinoma esophagus: A prospective randomized study

    Directory of Open Access Journals (Sweden)

    Shaveta Mehta

    2008-01-01

    Full Text Available Aim: To investigate the quality of life (QOL of patients with advanced carcinoma esophagus treated with different palliative radiation schedules. Methods: Sixty-two consecutive patients with inoperable, non-metastatic carcinoma of the esophagus were randomly allocated to Arm-A (external radiotherapy 30 Gy/10 fractions + brachytherapy 12 Gy/two sessions, Arm-B (external radiotherapy 30 Gy /10 fractions and Arm-C (external radiotherapy 20Gy /five fractions. The QOL was assessed using the European Organization for Research and Treatment of Cancer questionnaire at presentation, after treatment and at 3 months follow-up. Results: The mean QOL score improved, in arm-A from 38 to 52 after treatment and 56 at 3 months, in arm-B from 30 to 44 after treatment and 55 at 3 months and in arm-C from 24 to 40 after treatment but decreased to 37 at 3 months. Improvement in dysphagia scores at the first follow-up was 46.1% in arm-A, 25.0% in arm-B and 22.6% in arm-C. The difference was maintained at 3 months, with maximum improvement in arm-A (57.6%. No significant differences were found between the three arms with regard to complications and additional procedures needed for relief of dysphagia. Conclusion: In comparison with external radiotherapy alone, external radiotherapy with intraluminal brachytherapy has shown a trend toward better QOL and consistent dysphagia relief without significant difference in adverse effects.

  18. Functioning and disability analysis by using WHO Disability Assessment Schedule 2.0 in older adults Taiwanese patients with dementia.

    Science.gov (United States)

    Huang, Shih-Wei; Chang, Kwang-Hwa; Escorpizo, Reuben; Chi, Wen-Chou; Yen, Chia-Feng; Liao, Hua-Fang; Chang, Feng-Hang; Chiu, Wen-Ta; Lin, Jia-Wei; Liou, Tsan-Hon

    2016-08-01

    To analyse the disability status of elderly Taiwanese dementia patients by using the World Health Organisation Disability Assessment Schedule 2.0 (WHODAS 2.0). We enrolled 12 126 disabled elderly (>65 years) patients with dementia during July 2012-January 2014 from the Taiwan Data Bank of Persons with Disability. Trained interviewers evaluated the standardised scores in the six WHODAS 2.0 domains. Student's t test was used for comparing WHODAS 2.0 scores of male and female dementia patients with different age groups. The study population comprised 12 126 patients; 7612 were women and 4514 were men. The WHODAS 2.0 scores showed that the dementia patients had global activity limitation and participation restriction in all domains. Dementia-induced disability was prominent in male patients in all of the domains of the WHODAS 2.0. The domains of life activities, getting along with people and cognition were more strongly affected than the other domains. However, women experienced more rapid functional decline than men did as they aged. The data analysed in this large-scale, population-based study revealed crucial information on dementia-induced disability in elderly patients on the basis of the WHODAS 2.0 framework. Implications for rehabilitation Dementia patients have global functional disability in all domains of WHODAS 2.0 and multidisciplinary team is needed for rehabilitation programme intervention for these patients. When considering the rehabilitation resource and strategy, the domains of cognition, activities of daily living and life activities should be focussed. When dementia patients aged 65-75 years old, male patients got more restriction of function than female and more medical resource allocation for disabled male patients is recommended. With ageing, female dementia patients exhibited more rapid functional decline than male patients did and more budget about rehabilitation for maintain functional and dementia progression is crucial for female patients.

  19. Inter-rater reliability and factor analysis of the Brazilian version of the Schedule for the Assessment of Insight: Expanded Version (SAI-E Estudo de confiabilidade entre avaliadores e análise fatorial da versão brasileira do Schedule for the Assessment of Insight: Expanded Version (SAI-E

    Directory of Open Access Journals (Sweden)

    Clarissa de Rosalmeida Dantas

    2007-12-01

    Full Text Available OBJECTIVES: The Schedule for the Assessment of Insight - Expanded Version consists of 11 items that encompass: awareness of having a mental illness, ability to rename psychotic phenomena as abnormal, and compliance with treatment. The objective of the study was to evaluate the inter-rater reliability and to study the factorial structure of the Brazilian version of the instrument. METHOD: The Brazilian version of the Schedule for the Assessment of Insight - Expanded Version was used for the assessment of insight of 109 psychotic inpatients, 60 of whom had the interview tape-recorded in order to be scored by an independent evaluator. Intraclass correlation coefficient (ICC was adopted as the inter-rater reliability coefficient. In the factor analysis, principal components analysis and Varimax rotation were adopted. RESULTS: Inter-rater reliability coefficients from good to excellent were found for the individual items of the Schedule for the Assessment of Insight - Expanded Version with ICC values ranging from 0.54 to 0.82. Regarding the total score, inter-rater reliability was excellent, with ICC = 0.90. A factorial structure similar to the one obtained by the original version of the Schedule for the Assessment of Insight - Expanded Version was found, with 3 factors accounting for 71.72% of variance. CONCLUSION: In the Brazilian context, the Schedule for the Assessment of Insight - Expanded Version presented good inter-rater reliability and factorial structure compatible to the insight dimensions that are intended to be evaluated.OBJETIVOS: O Schedule for the Assessment of Insight - Expanded Version é constituído por 11 itens que abordam: reconhecimento de se ter um transtorno mental, capacidade de renomear fenômenos psicóticos como anormais e adesão ao tratamento. O objetivo do estudo foi avaliar a confiabilidade entre avaliadores e estudar a estrutura fatorial da versão brasileira do Schedule for the Assessment of Insight - Expanded

  20. Ultrasonographic assessment of cervical length in pregnancies scheduled for a cesarean delivery: prediction of early spontaneous onset of labor.

    Science.gov (United States)

    Rizzo, Giuseppe; Aiello, Elisa; Pietrolucci, Maria Elena; Arduini, Domenico

    2016-10-01

    To investigate whether the cervical length measured by transvaginal ultrasound at 35 to 36 weeks of gestation is predictive of spontaneous early onset of labor in pregnancies scheduled for elective cesarean section (CS). This was a prospective observational study on 167 women scheduled for elective CS at 39 weeks of gestation. The cervical length was measured ultrasonographycally at 35 to 36 weeks of gestation and the pregnancies characteristics were recorded. The presence or absence of spontaneous onset of labor before the time scheduled for elective CS was related to cervical length and pregnancies characteristics. Of the 167 pregnancies enrolled, 25 (14.97%) underwent early spontaneous onset of labor before the time scheduled for the elective CS. The cervical length was significantly shorter in these women when compared with those delivering with an elective CS (21 vs. 30 mm z=5.49 Ponset of labor in univariate analysis (P=0.01). Multivariate logistic regression analysis showed that cervical length (adjusted odds ratio 1.40; 95% confidence interval (CI) 1.22-1.61; P≤0.0001) was the only predictor for the early onset of labor. The area under the receiver-operating characteristics curve for the prediction of early onset of labor was 0.844 (95% CI 0.738-0.950) for cervical length as test variable. Kaplan-Meier analysis demonstrated that a cervical length onset of labor in pregnancies scheduled for CS and may be useful in individualizing the gestational age for elective CS.

  1. Análisis de la discapacidad en el paciente crónico mediante la herramienta WHODAS II

    OpenAIRE

    2014-01-01

    La Dependencia Funcional se define como la pérdida de autonomía física, psíquica o intelectual a causa de procesos relacionados con la salud del individuo. La discapacidad es un atributo inseparable de la dependencia, pero no recíproco. La dependencia funcional es el resultado de una discapacidad, pero no todos los discapacitados tienen dependencia funcional puesto que no precisan ayuda de terceros. El objetivo del estudio es valorar la discapacidad y dependencia funcional y comparar los resu...

  2. Too much reinforcement, too little behavior: assessing task interspersal procedures in conjunction with different reinforcement schedules with autistic children.

    OpenAIRE

    Charlop, M H; Kurtz, P F; Milstein, J P

    1992-01-01

    Task interspersal procedures have been quite effective in increasing autistic children's motivation to learn. These procedures have typically demonstrated that the inclusion of reinforced maintenance tasks (previously learned tasks) increases responding to new acquisition tasks because more reinforcers, in general, are available. However, studies have not specifically addressed the effects of various schedules of reinforcement, used in conjunction with task interspersal procedures, upon respo...

  3. Assessment of functioning and disability in patients with schizophrenia using the WHO Disability Assessment Schedule 2.0 in a large-scale database.

    Science.gov (United States)

    Chen, Ruey; Liou, Tsan-Hon; Chang, Kwang-Hwa; Yen, Chia-Feng; Liao, Hua-Fang; Chi, Wen-Chou; Chou, Kuei-Ru

    2017-08-11

    Schizophrenia is a common mental disorder characterized by deficits in multiple domains of functioning. This study is arguably the first of its kind in Taiwan to examine, in a multifaceted and objective manner, the disability of patients with schizophrenia and the factors affecting it. A cross-sectional design was adopted to gather data from 24,299 patients with schizophrenia who were listed in the Taiwan Databank of Persons with Disabilities. The level of disability in these patients was measured using the World Health Organization Disability Assessment Schedule 2.0. Statistical analyses were conducted through the χ (2) statistic and Poisson regression. The highest level of disability was in participation and the lowest was in self-care. An analysis of disability in all six domains of functioning on the basis of sex, age, type of residence, and socioeconomic status (SES) showed significant differences (P disability in these domains were female gender, age, educational attainment, SES, type of residence, and employment status. The overall degree of disability in schizophrenia patients was moderate. Six domains were measured in this study. The degrees of disability in mobility and self-care were mild while cognition, getting along, life activities, and participation were moderate. Moreover, female gender, an age of 45 or older, low educational attainment, middle to low SES, staying at healthcare institutions, and unemployment were crucial factors affecting disability of the participants. Preventive and rehabilitation programs should be developed to delay disability and functional degeneration in schizophrenic patients with these characteristics.

  4. A cross-sectional study of gender differentials in disability assessed on World Health Organization Disability Assessment Schedule 2.0 among rural elderly of Maharashtra

    Directory of Open Access Journals (Sweden)

    Dattatraya Ramkrishna Sinalkar

    2015-01-01

    Full Text Available Background: Disability is important public health problem especially among elderly. Gender difference between disability statuses of elderly is quite obvious. Very little information about disability in a rural area hinders the proper formulation of policies. Objectives: This study determines role of selected socio-demographic factors in explaining gender differences in disability among rural elderly. Materials and Methods: A community-based cross-sectional study was carried out from January 12 to December 12. 227 (Two hundred and twenty seven(aged 60 years and above were selected from a rural village of Pune, Maharashtra. Data collected using newly published World Health Organization Disability Assessment Schedule 2.0. Chi-square test and odds ratio used for determining the association. Results: The result confirms higher prevalence of disability among females than that of males. Disability was found to be statistically significant with gender. Marital status and education were effect modifier of disability. Disability in mobility was most common. In almost all domain disability was more common among elderly women. Conclusion: Greater prevalence of disability among aging women compared with men requires more attention to be given toward them for proper planning of scarce health services.

  5. Enhance accuracy in Software cost and schedule estimation by using "Uncertainty Analysis and Assessment" in the system modeling process

    CERN Document Server

    Vasantrao, Kardile Vilas

    2011-01-01

    Accurate software cost and schedule estimation are essential for software project success. Often it referred to as the "black art" because of its complexity and uncertainty, software estimation is not as difficult or puzzling as people think. In fact, generating accurate estimates is straightforward-once you understand the intensity of uncertainty and framework for the modeling process. The mystery to successful software estimation-distilling academic information and real-world experience into a practical guide for working software professionals. Instead of arcane treatises and rigid modeling techniques, this will guide highlights a proven set of procedures, understandable formulas, and heuristics that individuals and development teams can apply to their projects to help achieve estimation proficiency with choose appropriate development approaches In the early stage of software life cycle project manager are inefficient to estimate the effort, schedule, cost estimation and its development approach .This in tu...

  6. Inflammatory biomarkers, disease activity index, and self-reported disability may be predictors of chronic arthritis after chikungunya infection: brief report.

    Science.gov (United States)

    Sepúlveda-Delgado, J; Vera-Lastra, O L; Trujillo-Murillo, K; Canseco-Ávila, L M; Sánchez-González, R A; Gómez-Cruz, O; Lugo-Trampe, A; Fernández-Salas, I; Danis-Lozano, R; Contreras-Contreras, A; Mendoza-Torres, A; Domínguez-Arrevillaga, S; Mena-Vela, B A; Ocaña-Sibilla, M; Ramirez-Valdespino, J C; Jara, L J

    2017-03-01

    The chikungunya virus (ChikV) is a reemerging mosquito-borne pathogen that causes disabling chronic arthritis. The relationship between clinical evolution and inflammatory biomarkers in patients with ChikV-induced arthritis has not been fully described. We performed a prospective case series to evaluate the association among joint involvement, self-reported disability, and inflammatory biomarkers. Patients with ChikV infection were followed for 1 year. Joint involvement and self-reported disability were evaluated with disease activity index 28 (DAS-28) and World Health Organization Disablement Assessment Schedule II (WHODAS-II). Interleukin-6 (IL-6), C-reactive protein (CRP), erythrocyte sedimentation rate (ESR), and rheumatoid factor (RF) were used as biomarkers. Ten patients with mean age 48 ±15.04 years were included. Symptoms at diagnosis were fever, arthralgias, myalgias, rash, arthritis, nausea, vomiting, and back pain. Polyarticular involvement was present in seven cases. At diagnosis, measures were as follows: DAS-28, 5.08±1.11; WHODAS-II score, 72.3±10.3 %; CRP, 5.09±7.23 mg/dL; ESR, 33.5±17.5 mm/h; RF, 64±21.7 IU/mL; and IL-6, 17.6±10.3 pg/mL. Six patients developed subacute and chronic symptoms. During follow-up, DAS-28 index, WHODAS-II score, ESR, and IL-6 were statistically different in patients with subacute and chronic symptoms compared to those who resolved in the acute phase (p arthritis.

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

  8. The Official Control beyond the Official Control. How To Plan And Schedule Controls Starting From Risk Assessment Along The Agro-Food Supply Chain.

    Science.gov (United States)

    Panunzio, M F; Caporizzi, R; Lagravinese, D; Conversano, M

    2015-01-01

    Every year the Italian Ministry of Health, on the basis of regional data, draws up the "Report on Official Controls" to be submitted to the Parliament. The report contains abundant data, diagrams and charts and illustrates the number and type of official controls (OC) performed by the pertinent Bodies (Ministry of Health, Regional and Local Health Authorities) over the previous year on Food Business Operators (FBO), in accordance with the EC Regulation 882/2004. The trend - which has consolidated over the years - relates to the multiplicity of OC and shows a decrease of such controls compared to an increase in "non-conformities". OC frequency is established by the Regional Authorities on the basis of the categorisation of both a "generic risk" for companies calculated taking into account the probability of occurrence of a "non-conformity", and a "specific" risk, assessed on the basis of the results of the OC actually performed on a given "Operatore del Settore Alimentare" (Food Sector Operator, in Italian: OSA). Thus, categorisation (i.e. the probability of occurrence of non-conformities) is the main driver of the OC scheduling and planning process. We have been asking ourselves whether the current OC planning/scheduling method is still suitable for ensuring food safety in the face of internalisation of the food supply chain. As a matter of fact, food safety is now becoming increasingly variable due to the globalization of consumption where "farm to fork", rather than "border to fork", food safety must be ensured. On the basis of these considerations, a different OC planning /scheduling method is being proposed based on the assessment of risks and the estimation of the occurrence of the same along the agro-food chain.

  9. Scheduling the Secondary School.

    Science.gov (United States)

    Dempsey, Richard A.; Traverso, Henry P.

    This "how-to-do-it" manual on the intricacies of school scheduling offers both technical information and common sense advice about the process of secondary school scheduling. The first of six chapters provides an overview of scheduling; chapter 2 examines specific considerations for scheduling; chapter 3 surveys the scheduling models and their…

  10. 资源多约束进度网络的风险评估%Schedule Network Risk Assessment Based on Multi-resource Constraints

    Institute of Scientific and Technical Information of China (English)

    蔡永勇; 桑笑楠; 张周磊; 徐永红

    2015-01-01

    Due to the tremendousness, long-term and a variety of factors of the projects during the projects man-agement, there are inevitably some potential risks. Therefore, this paper is designed for the assessment of potential risks in projects, thus helping users have a further understanding of projects and being able to prevent risks in advance. This paper firstly presents research background and research status at home and abroad, then introduces some concepts of project management and risk management, particularly focusing on resource-constrained project scheduling problem (RCPSP). After that, it designs the Monte Carlo which is constrained by the framework level, the database and the mul-ti-resources. Besides, it proposes the method for the calculation of the schedule risks and the cost risks based on the simulation results.%在项目管理中由于项目庞大、持续周期长、影响因素繁多,不可避免地会面对潜在的风险。本文对项目潜在的风险进行评估,让项目的管理者对项目有一个长远的认识,防范风险于未然。本文应用资源多约束下项目进度调度(resource-constrained project scheduling problem, RCPSP)问题模型,对进度风险评估系统进行了需求分析和模块划分,设计了系统的框架层次、数据库、资源多约束下的蒙式仿真算法,给出了依据仿真结果计算进度风险和成本风险的统计思路。

  11. Construction schedule delay risk assessment by using combined AHP-RII methodology for an international NPP project

    Directory of Open Access Journals (Sweden)

    Muhammed Mufazzal Hossen

    2015-04-01

    The proposed combined AHP-RII methodology is capable of assessing delay risk effectively and efficiently. Decision makers can apply risk informed decision making to avoid unexpected construction delays of NPPs.

  12. Schedule Analytics

    Science.gov (United States)

    2016-04-30

    systems and platforms. Manring is trained and experienced on a number of commercial parametric software cost models and risk analysis tools. She has...analysis assessments. Manring holds a BS in mathematics from the Virginia Polytechnic Institute and State University. [jmanring@mitre.org] Thomas M

  13. List scheduling revisited

    NARCIS (Netherlands)

    Schutten, Johannes M.J.

    1996-01-01

    We consider the problem of scheduling n jobs on m identical parallel machines to minimize a regular cost function. The standard list scheduling algorithm converts a list into a feasible schedule by focusing on the job start times. We prove that list schedules are dominant for this type of problem.

  14. A study of the psychometric properties of 12-item World Health Organization Disability Assessment Schedule 2.0 in a large population of people with chronic musculoskeletal pain.

    Science.gov (United States)

    Saltychev, Mikhail; Bärlund, Esa; Mattie, Ryan; McCormick, Zachary; Paltamaa, Jaana; Laimi, Katri

    2017-02-01

    To assess the validity of the Finnish translation of the 12-item World Health Organization Disability Assessment Schedule (WHODAS 2.0). Cross-sectional cohort survey study. Physical and Rehabilitation Medicine outpatient university clinic. The 501 consecutive patients with chronic musculoskeletal pain. Exploratory factor analysis and a graded response model using item response theory analysis were used to assess the constructs and discrimination ability of WHODAS 2.0. The exploratory factor analysis revealed two retained factors with eigenvalues 5.15 and 1.04. Discrimination ability of all items was high or perfect, varying from 1.2 to 2.5. The difficulty levels of seven out of 12 items were shifted towards the elevated disability level. As a result, the entire test characteristic curve showed a shift towards higher levels of disability, placing it at the point of disability level of +1 (where 0 indicates the average level of disability within the sample). The present data indicate that the Finnish translation of the 12-item WHODAS 2.0 is a valid instrument for measuring restrictions of activity and participation among patients with chronic musculoskeletal pain.

  15. Functioning and Disability Analysis of Patients with Traumatic Brain Injury and Spinal Cord Injury by Using the World Health Organization Disability Assessment Schedule 2.0

    Directory of Open Access Journals (Sweden)

    Chia-Ying Kuo

    2015-04-01

    Full Text Available The purpose of this study is to compare traumatic brain injuries (TBI and spinal cord injuries (SCI patients’ function and disability by using the World Health Organization Disability Assessment Schedule 2.0 (WHODAS 2.0; and to clarify the factors that contribute to disability. We analyzed data available between September 2012 and August 2013 from Taiwan’s national disability registry which is based on the International Classification of Functioning, Disability, and Health (ICF framework. Of the 2664 cases selected for the study, 1316 pertained to TBI and 1348 to SCI. A larger percentage of patients with TBI compared with those with SCI exhibited poor cognition, self-care, relationships, life activities, and participation in society (all p < 0.001. Age, sex, injury type, socioeconomic status, place of residence, and severity of impairment were determined as factors that independently contribute to disability (all p < 0.05. The WHODAS 2.0 is a generic assessment instrument which is appropriate for assessing the complex and multifaceted disability associated with TBI and SCI. Further studies are needed to validate the WHODAS 2.0 for TBI and SCI from a multidisciplinary perspective.

  16. Dynamic Fractional Resource Scheduling vs. Batch Scheduling

    CERN Document Server

    Casanova, Henri; Vivien, Frédéric

    2011-01-01

    We propose a novel job scheduling approach for homogeneous cluster computing platforms. Its key feature is the use of virtual machine technology to share fractional node resources in a precise and controlled manner. Other VM-based scheduling approaches have focused primarily on technical issues or on extensions to existing batch scheduling systems, while we take a more aggressive approach and seek to find heuristics that maximize an objective metric correlated with job performance. We derive absolute performance bounds and develop algorithms for the online, non-clairvoyant version of our scheduling problem. We further evaluate these algorithms in simulation against both synthetic and real-world HPC workloads and compare our algorithms to standard batch scheduling approaches. We find that our approach improves over batch scheduling by orders of magnitude in terms of job stretch, while leading to comparable or better resource utilization. Our results demonstrate that virtualization technology coupled with light...

  17. Disability in bipolar I disorder: the 36-item World Health Organization Disability Assessment Schedule 2.0.

    Science.gov (United States)

    Guilera, Georgina; Gómez-Benito, Juana; Pino, Óscar; Rojo, Emilio; Vieta, Eduard; Cuesta, Manuel J; Purdon, Scot E; Bernardo, Miguel; Crespo-Facorro, Benedicto; Franco, Manuel; Martínez-Arán, Anabel; Safont, Gemma; Tabarés-Seisdedos, Rafael; Rejas, Javier

    2015-03-15

    The WHODAS 2.0 is an ICF-based multidimensional instrument developed for measuring disability. The present study analyzes the utility of the 36-item interviewer-administered version in a sample of patients with bipolar disorder. There is no study to date that analyses how the scale works in a sample that only comprises such patients. A total of 291 patients with bipolar disorder (42.6% males) according to DSM-IV-TR criteria from a cross-sectional study conducted in outpatient psychiatric clinics were enrolled. In addition to the WHODAS 2.0, patients completed a comprehensive assessment battery including measures on psychopathology, functionality and quality of life. Analyses were centered on providing evidence on the validity and utility of the Spanish version of the WHODAS 2.0 in bipolar patients. Participation domain had the highest percentage of missing data (2.7%). Confirmatory factorial analysis was used to test three models formulated in the literature: six primary correlated factors, six primary factors with a single second-order factor, and six primary factors with two second-order factors. The three models were plausible, although the one formed by six correlated factors produced the best fit. Cronbach's alpha values ranged between .73 for the Self-care domain and .92 for Life activities, and the internal consistency of the total score was .96. Relationships between the WHODAS 2.0 and measures of psychopathology, functionality and quality of life were in the expected direction, and the scale was found to be able to differentiate among patients with different intensity of clinical symptoms and work situation. The percentage of euthymic patients was considerable. However, the assessment of euthymic patients is less influenced by mood. Some psychometric properties have not been studied, such as score stability and sensitivity to change. The Spanish version of the 36-item WHODAS 2.0 has suitable psychometric properties in terms of reliability and validity when

  18. Assessment of the effects of dalteparin on coagulation variables and determination of a treatment schedule for use in cats.

    Science.gov (United States)

    Schönig, Jette C; Mischke, Reinhard H

    2016-07-01

    OBJECTIVE To determine a treatment protocol for SC administration of dalteparin to cats on the basis of currently available detailed pharmacokinetic data and to assess the effect of SC administration of dalteparin to cats on coagulation variables such as activated partial thromboplastin time (aPTT), thrombin time, and results for thromboelastometry, compared with effects on anti-activated coagulation factor X (anti-Xa) activity. ANIMALS 6 healthy domestic shorthair cats. PROCEDURES Cats received 14 injections of dalteparin (75 anti-Xa U/kg, SC) at 6-hour intervals. Blood samples were collected before and 2 hours after the first and second injections on days 1, 2, and 4. Anti-Xa activity was measured by use of a chromogenic substrate assay, aPTT and thrombin time were measured by use of an automated coagulometer, and viscoelastic measurements were obtained with thromboelastrometry. RESULTS 2 hours after the second injection, the target peak anti-Xa activity range of 0.5 to 1.0 U/mL was achieved in all cats, whereas median trough values remained below this range. Peak anti-Xa activity had only minimal effects on coagulation variables; the maximum median ratio for aPTT (in relationship to the value before the first dalteparin injection) was 1.23. CONCLUSIONS AND CLINICAL RELEVANCE Results of this study indicated that this treatment protocol resulted in reproducible anti-Xa activity in cats that was mostly within the targeted peak range of anti-Xa activity recommended for humans. Treatment in accordance with this protocol may not require routine coagulation monitoring of cats, but this must be confirmed in feline patients.

  19. Using the World Health Organization Disability Assessment Schedule 2.0 (WHODAS 2.0) for Predicting Institutionalization of Patients With Dementia in Taiwan.

    Science.gov (United States)

    Huang, Shih-Wei; Chang, Kwang-Hwa; Escorpizo, Reuben; Hu, Chaur-Jong; Chi, Wen-Chou; Yen, Chia-Feng; Liao, Hua-Fang; Chiu, Wen-Ta; Liou, Tsan-Hon

    2015-11-01

    World Health Organization Disability Assessment Schedule 2.0 (WHODAS 2.0) is an assessment tool and it has been applied for disability status assessment of Taiwanese dementia patients since July 2012. The aim of this study was to investigate the predicting accuracy of WHODAS 2.0 for institutionalization of dementia patients.Of these patients, 13,774 resided in a community and 4406 in a long-term care facility. Demographic data and WHODAS 2.0 standardized scores were analyzed using the Chi-square test and independent t test to compare patients with dementia in an institution with those in a community. The receiver operating characteristic (ROC) curve was applied to investigate accuracy in predicting institutionalization, and the optimal cutoff point was determined using the Youden index. Binary logistic regression was used to analyze variables to determine risk factors for the institutionalization of patients with dementia.WHODAS 2.0 scores in all domains were higher in patients with dementia in a long-term care facility than in those in a community (P gender, severity of disease, and standardized WHODAS 2.0 scores surpassing the cutoff values were risk factors for the institutionalization of patients with dementia.Although the accuracy of WHODAS 2.0 in predicting institutionalization is not considerably high for patients with dementia, our study found that the WHODAS 2.0 scores, the male gender, education status, urbanization level, and severity of disease were risk factors for institutionalization in long-term care facilities.

  20. Immunization Schedules for Adults

    Science.gov (United States)

    ... Everyone: Easy-to-read Schedules Infants and Children Preteens and Teens Adults Display Immunization Schedules and Quiz ... file Microsoft Word file Microsoft Excel file Audio/Video file Apple Quicktime file RealPlayer file Text file ...

  1. Instant Childhood Immunization Schedule

    Science.gov (United States)

    ... Everyone: Easy-to-read Schedules Infants and Children Preteens and Teens Adults Display Immunization Schedules and Quiz ... file Microsoft Word file Microsoft Excel file Audio/Video file Apple Quicktime file RealPlayer file Text file ...

  2. School Construction Scheduling.

    Science.gov (United States)

    Delaney, J. B.

    1983-01-01

    Explains that favorable market and working conditions influence the scheduling of school construction projects. Facility planners, architects, and contractors are advised to develop a realistic time schedule for the entire project. (MLF)

  3. Measuring disability and its predicting factors in a large database in Taiwan using the World Health Organization Disability Assessment Schedule 2.0.

    Science.gov (United States)

    Chi, Wen-Chou; Chang, Kwang-Hwa; Escorpizo, Reuben; Yen, Chia-Feng; Liao, Hua-Fang; Chang, Feng-Hang; Chiou, Hung-Yi; Teng, Sue-Wen; Chiu, Wen-Ta; Liou, Tsan-Hon

    2014-11-25

    The definition of disability had been unclear until the International Classification of Functioning, Disability, and Health was promulgated in 2001 by the World Health Organization (WHO). Disability is a critical but relatively neglected public-health concern. We conducted this study to measure disabilities by using the WHO Disability Assessment Schedule 2.0 (WHODAS 2.0) and identify the factors that contribute to disabilities. We obtained and analyzed the data on people who applied to Taiwan's disability registration system between September 2012 and August 2013. A total of 158,174 cases were selected for this study. Among the people included in this study, 53% were male, and the females were on average 3 years older than the males. More males than females were of a low socioeconomic status, but the rate of employment was higher among the males than among the females. Age, sex, place of residence, and types and severity of impairment were all determined to be factors that independently contributed to disability. This study has demonstrated that disability can be measured and compared using WHODAS 2.0. Increasing the public-health attention devoted to disability and identifying the factors associated with disability can promote independence and social participation in people with disabilities.

  4. Measuring Disability and Its Predicting Factors in a Large Database in Taiwan Using the World Health Organization Disability Assessment Schedule 2.0

    Directory of Open Access Journals (Sweden)

    Wen-Chou Chi

    2014-11-01

    Full Text Available The definition of disability had been unclear until the International Classification of Functioning, Disability, and Health was promulgated in 2001 by the World Health Organization (WHO. Disability is a critical but relatively neglected public-health concern. We conducted this study to measure disabilities by using the WHO Disability Assessment Schedule 2.0 (WHODAS 2.0 and identify the factors that contribute to disabilities. We obtained and analyzed the data on people who applied to Taiwan’s disability registration system between September 2012 and August 2013. A total of 158,174 cases were selected for this study. Among the people included in this study, 53% were male, and the females were on average 3 years older than the males. More males than females were of a low socioeconomic status, but the rate of employment was higher among the males than among the females. Age, sex, place of residence, and types and severity of impairment were all determined to be factors that independently contributed to disability. This study has demonstrated that disability can be measured and compared using WHODAS 2.0. Increasing the public-health attention devoted to disability and identifying the factors associated with disability can promote independence and social participation in people with disabilities.

  5. Reinforcement learning in scheduling

    Science.gov (United States)

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

    1994-01-01

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

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

  7. Parallel scheduling algorithms

    Energy Technology Data Exchange (ETDEWEB)

    Dekel, E.; Sahni, S.

    1983-01-01

    Parallel algorithms are given for scheduling problems such as scheduling to minimize the number of tardy jobs, job sequencing with deadlines, scheduling to minimize earliness and tardiness penalties, channel assignment, and minimizing the mean finish time. The shared memory model of parallel computers is used to obtain fast algorithms. 26 references.

  8. DSN Scheduling Engine

    Science.gov (United States)

    Clement, Bradley; Johnston, Mark; Wax, Allan; Chouinard, Caroline

    2008-01-01

    The DSN (Deep Space Network) Scheduling Engine targets all space missions that use DSN services. It allows clients to issue scheduling, conflict identification, conflict resolution, and status requests in XML over a Java Message Service interface. The scheduling requests may include new requirements that represent a set of tracks to be scheduled under some constraints. This program uses a heuristic local search to schedule a variety of schedule requirements, and is being infused into the Service Scheduling Assembly, a mixed-initiative scheduling application. The engine resolves conflicting schedules of resource allocation according to a range of existing and possible requirement specifications, including optional antennas; start of track and track duration ranges; periodic tracks; locks on track start, duration, and allocated antenna; MSPA (multiple spacecraft per aperture); arraying/VLBI (very long baseline interferometry)/delta DOR (differential one-way ranging); continuous tracks; segmented tracks; gap-to-track ratio; and override or block-out of requirements. The scheduling models now include conflict identification for SOA(start of activity), BOT (beginning of track), RFI (radio frequency interference), and equipment constraints. This software will search through all possible allocations while providing a best-effort solution at any time. The engine reschedules to accommodate individual emergency tracks in 0.2 second, and emergency antenna downtime in 0.2 second. The software handles doubling of one mission's track requests over one week (to 42 total) in 2.7 seconds. Further tests will be performed in the context of actual schedules.

  9. Effects of autism spectrum disorders on outcome in teenage-onset anorexia nervosa evaluated by the Morgan-Russell outcome assessment schedule: a controlled community-based study.

    Science.gov (United States)

    Nielsen, Søren; Anckarsäter, Henrik; Gillberg, Carina; Gillberg, Christopher; Råstam, Maria; Wentz, Elisabet

    2015-01-01

    The purpose of the study was to evaluate time trends and effects of co-existing autism spectrum disorders (ASD) on outcome in an ongoing long-term follow-up study of anorexia nervosa (AN). The Morgan-Russell Outcome Assessment Schedule (MROAS) was used at 6-, 10- and 18-year follow-up of a representative sample of 51 individuals with teenage-onset AN and a matched group of 51 healthy comparison cases. The full multinomial distribution of responses for the full scale and each of the subscales was evaluated using exact nonparametric statistical methods. The impact of diagnostic stability of ASD on outcome in AN was evaluated in a dose-response model. There were no deaths in either group. Food intake and menstrual pattern were initially poor in the AN group but normalised over time. MROAS 'mental state' was much poorer in the AN group and did not improve over time. The psychosexual MROAS domains 'attitudes' and 'aims' showed persistent problems in the AN group. In the MROAS socioeconomic domain, the subscales 'personal contacts', 'social activities' and 'employment record' all showed highly significant between-group differences at all three follow-ups. A statistically significant negative dose-response relationship was found between a stable diagnosis of ASD over time and the results on the subscales 'mental state', 'psychosexual state' and 'socio-economic state'. Outcome of teenage-onset AN is favourable with respect to mortality and persisting eating disorder, but serious problems remain in the domains 'mental state', 'psychosexual function' and 'socioeconomic state'. Outcome is considerably worse if ASD is present. Treatment programmes for AN need to be modified so as to accommodate co-existing ASD.

  10. Routing and scheduling problems

    DEFF Research Database (Denmark)

    Reinhardt, Line Blander

    be that the objects routed have an availability time window and a delivery time window or that locations on the path have a service time window. When routing moving transportation objects such as vehicles and vessels schedules are made in connection with the routing. Such schedules represent the time for the presence...... to a destination on a predefined network, the routing and scheduling of vessels in a liner shipping network given a demand forecast to be covered, the routing of manpower and vehicles transporting disabled passengers in an airport and the vehicle routing with time windows where one version studied includes edge...... of a connection between two locations. This could be an urban bus schedule where busses are routed and this routing creates a bus schedule which the passengers between locations use. In this thesis various routing and scheduling problems will be presented. The topics covered will be routing from an origin...

  11. Widening the Schedulability Hierarchical Scheduling Systems

    DEFF Research Database (Denmark)

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

    2014-01-01

    the supply of resources in each component. We specifically investigate two different techniques to widen the set of provably schedulable systems: 1) a new supplier model; 2) restricting the potential task offsets. We also provide a way to estimate the minimum resource supply (budget) that a component...

  12. Interval Scheduling: A Survey

    NARCIS (Netherlands)

    Kolen, A.W.J.; Lenstra, J.K.; Papadimitriou, C.H.; Spieksma, F.C.R.

    2007-01-01

    In interval scheduling, not only the processing times of the jobs but also their starting times are given. This article surveys the area of interval scheduling and presents proofs of results that have been known within the community for some time. We first review the complexity and approximability o

  13. Scheduling: Seven Period Day

    Science.gov (United States)

    Williamson, Ronald

    2010-01-01

    Driven by stable or declining financial resources many school districts are considering the costs and benefits of a seven-period day. While there is limited evidence that any particular scheduling model has a greater impact on student learning than any other, it is clear that the school schedule is a tool that can significantly impact teacher…

  14. Scheduling for Responsive Grids

    CERN Document Server

    Germain-Renaud, C; Moscicki,JT; Texier, R

    2008-01-01

    Grids are facing the challenge of seamless integration of the Grid power into everyday use. One critical component for this integration is responsiveness, the capacity to support on-demand computing and interactivity. Grid scheduling is involved at two levels in order to provide responsiveness: the policy level and the implementation level. The main contributions of this paper are as follows. First, we present a detailed analysis of the performance of the EGEE Grid with respect to responsiveness. Second, we examine two user-level schedulers located between the general scheduling layer and the application layer. These are the DIANE (distributed analysis environment) framework, a general-purpose overlay system, and a specialized, embedded scheduler for gPTM3D, an interactive medical image analysis application. Finally, we define and demonstrate a virtualization scheme, which achieves guaranteed turnaround time, schedulability analysis, and provides the basis for differentiated services. Both methods target a br...

  15. Risk Assessment and Optimization Method for Markov Chain-based Scheduling Operations%基于马尔可夫链的调度操作流程风险评估及优选方法

    Institute of Scientific and Technical Information of China (English)

    侯恺; 曾沅; 贾宏杰; 卢恩; 刘嘉宁; 呼士召

    2015-01-01

    A Markov chain-based scheduling operations hierarchical risk assessment method is proposed.The characteristics of two major influencing factors of scheduling operations,which are operation result of each step and facility failures,are analyzed and decoupled with the hierarchical method.In the external layer,Markov chain is used to simulate the evaluation of system topologies during scheduling operations and achieve their probability distributions.In the internal layer,the state enumeration method is used to calculate risk indices of each system topology.By calculating the weighted sum of all system topologies according to the probability distribution of each operation step,final indices of scheduling operations will be obtained.The proposed approach is able to assess risk indices of scheduling operation efficiently and accurately,and provide index support for operators to optimize scheduling operations.Case studies based on a modified IEEE reliability test system and a practical system demonstrate the validity,effectiveness and utility value of the proposed approach.%提出了一种基于马尔可夫链调度操作流程风险评估及优选方法。分析了影响调度操作风险水平的两类主要因素(各步操作结果、设备故障)的特点,并利用分层方法将二者解耦处理:外层利用马尔可夫链模拟调度操作过程中系统拓扑的变化,并计算各环节对应系统拓扑的概率分布;内层利用状态枚举法计算各系统拓扑对应风险指标,并按外层所得概率分布加权求和,得到各操作环节及整体操作流程的风险指标,基于所得指标,可量化分析不同调度操作流程风险差异。该方法能够快速准确计算调度操作风险指标,为调度工作人员优选操作流程提供指标支持。测试系统及实际系统算例验证了所述方法的正确性、高效性和实用性。

  16. Prevalence of disability in a composite ≥75 year-old population in Spain: A screening survey based on the International Classification of Functioning

    Directory of Open Access Journals (Sweden)

    Gascon-Bayarri Jordi

    2011-03-01

    Full Text Available Abstract Background The prevalence and predictors of functional status and disability of elderly people have been studied in several European countries including Spain. However, there has been no population-based study incorporating the International Classification of Functioning, Disability and Health (ICF framework as the basis for assessing disability. The present study reports prevalence rates for mild, moderate, and severe/extreme disability by the domains of activities and participation of the ICF. Methods Nine populations surveyed in previous prevalence studies contributed probabilistic and geographically defined samples in June 2005. The study sample was composed of 503 subjects aged ≥75 years. We implemented a two-phase screening design using the MMSE and the World Health Organization-Disability Assessment Schedule 2nd edition (WHO-DAS II, 12 items as cognitive and disability screening tools, respectively. Participants scoring within the positive range of the disability screening were administered the full WHO-DAS II (36 items; score range: 0-100 assessing the following areas: Understanding and communication, Getting along with people, Life activities, Getting around, Participation in society, and Self-care. Each disability area assessed by WHO-DAS II (36 items was reported according to the ICF severity ranges (No problem, 0-4; Mild disability, 5-24; Moderate disability, 25-49; Severe/Extreme disability, 50-100. Results The age-adjusted disability prevalence figures were: 39.17 ± 2.18%, 15.31 ± 1.61%, and 10.14 ± 1.35% for mild, moderate, and severe/extreme disability, respectively. Severe and extreme disability prevalence in mobility and life activities was three times higher than the average, and highest among women. Sex variations were minimal, although life activities for women of 85 years and over had more severe/extreme disability as compared to men (OR = 5.15 95% CI 3.19-8.32. Conclusions Disability is highly prevalent among

  17. Effects of Block Scheduling

    Directory of Open Access Journals (Sweden)

    William R. Veal

    1999-09-01

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

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

  19. Estimating exponential scheduling preferences

    DEFF Research Database (Denmark)

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

    2015-01-01

    Different assumptions about travelers' scheduling preferences yield different measures of the cost of travel time variability. Only few forms of scheduling preferences provide non-trivial measures which are additive over links in transport networks where link travel times are arbitrarily...... of car drivers' route and mode choice under uncertain travel times. Our analysis exposes some important methodological issues related to complex non-linear scheduling models: One issue is identifying the point in time where the marginal utility of being at the destination becomes larger than the marginal...

  20. The shop floor scheduling game

    NARCIS (Netherlands)

    Riezebos, Jan; Slomp, Jannes

    1995-01-01

    The aim of the shop floor scheduling game is getting participants acquainted with: - developing robust planning and scheduling procedures; - accepting orders under uncertainty and competition; - using information from cost accounting in scheduling; - creating an adequate communication structure

  1. DMEPOS Fee Schedule

    Data.gov (United States)

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

  2. Estimating exponential scheduling preferences

    DEFF Research Database (Denmark)

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

    time by maximising expected total utility over the day, their departure times are conditional on rates of utility derived at these locations. For forecasting and economic evaluation of planning alternatives, it is desirable to have simple forms of utility rates with few parameters. Several forms...... the travel time is random, Noland and Small (1995) suggested using expected utility theory to derive the reduced form of expected travel time cost that includes the cost of TTV. For the α-β-γ formulation of scheduling preferences and exponential or uniform distribution of travel time, Noland and Small (1995....... The purpose of this paper is to explore how well these scheduling preferences explain behaviour, compared to other possible scheduling models, and whether empirical estimation of the more complex exponential scheduling preferences is feasible. We use data from a stated preference survey conducted among car...

  3. CERN confirms LHC schedule

    CERN Multimedia

    2003-01-01

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

  4. Decentralized Ground Staff Scheduling

    DEFF Research Database (Denmark)

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

    2002-01-01

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

  5. Clinical Laboratory Fee Schedule

    Data.gov (United States)

    U.S. Department of Health & Human Services — Outpatient clinical laboratory services are paid based on a fee schedule in accordance with Section 1833(h) of the Social Security Act. The clinical laboratory fee...

  6. Project Schedule Simulation

    DEFF Research Database (Denmark)

    Mizouni, Rabeb; Lazarova-Molnar, Sanja

    2015-01-01

    Despite several attempts to accurately predict duration and cost of software projects, initial plans still do not reflect real-life situations. Since commitments with customers are usually decided based on these initial plans, software companies frequently fail to deliver on time and many projects...... 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...

  7. Estimating exponential scheduling preferences

    DEFF Research Database (Denmark)

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

    time by maximising expected total utility over the day, their departure times are conditional on rates of utility derived at these locations. For forecasting and economic evaluation of planning alternatives, it is desirable to have simple forms of utility rates with few parameters. Several forms...... the travel time is random, Noland and Small (1995) suggested using expected utility theory to derive the reduced form of expected travel time cost that includes the cost of TTV. For the α-β-γ formulation of scheduling preferences and exponential or uniform distribution of travel time, Noland and Small (1995....... The purpose of this paper is to explore how well these scheduling preferences explain behaviour, compared to other possible scheduling models, and whether empirical estimation of the more complex exponential scheduling preferences is feasible. We use data from a stated preference survey conducted among car...

  8. Fee Schedules - General Information

    Data.gov (United States)

    U.S. Department of Health & Human Services — A fee schedule is a complete listing of fees used by Medicare to pay doctors or other providers-suppliers. This comprehensive listing of fee maximums is used to...

  9. Physician Fee Schedule Search

    Data.gov (United States)

    U.S. Department of Health & Human Services — This website is designed to provide information on services covered by the Medicare Physician Fee Schedule (MPFS). It provides more than 10,000 physician services,...

  10. CMS Records Schedule

    Data.gov (United States)

    U.S. Department of Health & Human Services — The CMS Records Schedule provides disposition authorizations approved by the National Archives and Records Administration (NARA) for CMS program-related records...

  11. Resource Minimization Job Scheduling

    Science.gov (United States)

    Chuzhoy, Julia; Codenotti, Paolo

    Given a set J of jobs, where each job j is associated with release date r j , deadline d j and processing time p j , our goal is to schedule all jobs using the minimum possible number of machines. Scheduling a job j requires selecting an interval of length p j between its release date and deadline, and assigning it to a machine, with the restriction that each machine executes at most one job at any given time. This is one of the basic settings in the resource-minimization job scheduling, and the classical randomized rounding technique of Raghavan and Thompson provides an O(logn/loglogn)-approximation for it. This result has been recently improved to an O(sqrt{log n})-approximation, and moreover an efficient algorithm for scheduling all jobs on O((OPT)^2) machines has been shown. We build on this prior work to obtain a constant factor approximation algorithm for the problem.

  12. A naturalistic study of the acceptability and effectiveness of internet-delivered cognitive behavioural therapy for psychiatric disorders in older australians.

    Directory of Open Access Journals (Sweden)

    Louise Mewton

    Full Text Available OBJECTIVES: The current study investigates the acceptability, effectiveness and uptake of internet-delivered cognitive behavioural therapy (iCBT amongst older individuals (>60 years seeking psychiatric treatment in general practice. METHODS: The sample consisted of 2413 (mean age 39.5; range 18-83 years patients prescribed iCBT through This Way Up clinic by their primary care clinician. The intervention consisted of six fully automated, unassisted online lessons specific to four disorders major depression, generalised anxiety disorder, panic disorder or social phobia. Patients were categorised into five age groups (18-29 years, 30-39 years, 40-49 years, 50-59 years, 60 years and above. 225 (9.3% patients were aged over 60 years. Analyses were conducted across the four disorders to ensure sufficient sample sizes in the 60 years and older age group. Age differences in adherence to the six lesson courses were assessed to demonstrate acceptability. Age-based reductions in psychological distress (Kessler Psychological Distress Scale; K10 and disability (the World Health Organisation Disability Assessment Schedule; WHODAS-II were compared to demonstrate effectiveness. To evaluate the uptake of iCBT, the age distribution of those commencing iCBT was compared with the prevalence of these disorders in the 2007 Australian National Survey of Mental Health and Well-Being. RESULTS: Older adults were more likely to complete all six lessons when compared with their younger counterparts. Marginal model analyses indicated that there were significant reductions in the K10 and WHODAS-II from baseline to post-intervention, regardless of age (p<0.001. The measurement occasion by age interactions were not significant, indicating that individuals showed similar reductions in the K10 and WHODAS-II regardless of age. In general, the age distribution of individuals commencing the iCBT courses matched the age distribution of the four diagnoses in the Australian general

  13. PAR Loop Schedule Review

    Energy Technology Data Exchange (ETDEWEB)

    Schaffer, Jr.; W.F.

    1958-04-30

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

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

  15. 配电网可靠性评估中预安排停电的实用数学模型%Mathematical Model of Scheduled Outage in Reliability Assessment of Distribution Network

    Institute of Scientific and Technical Information of China (English)

    王浩浩; 管霖; 吴熳红

    2011-01-01

    目前国内城市配电网的停电事件中预安排停电占据绝对多数,但现有的配电网可靠性理论评估却只考虑了故障停电,缺少对预安排停电影响的评估模型和方法。文中分析了预安排停电的建模特点、导致预安排停电的各类工程、检修项目的不同影响范围。在此基础上,将各类预安排停电项目分为4类停电事件,并分别给出对应的可靠性评估数学模型。模型用于电网规划时,还考虑了新出线网架信息不全给转供判断带来的问题并提出简化处理方法。以珠海市香洲区2010年的项目规划为算例的结果表明,基于项目分类的预安排停电影响的模型具有一定的实用性,适用于配电网可靠性评估。%At present,the scheduled outages account for most of all the outages in the city distribution network,but the existing evaluation methods only take fault outage into account,while neglecting assessment models and methods for scheduled outage.The characteristics of the scheduled outage model and several types of construction/maintenance projects leading to scheduled outage and their impact range are analyzed first.Then,the projects are categorized into four sets based on their impact,with the mathematical model developed for each.The issue of the network structure uncertainty arising from new outlet feeders that brings difficulty to load transfer judgement is also considered in the proposed models.The planning project in Xiangzhou district of Zhuhai city is used as a real example,the results showing that the proposed scheduled outage model is effective in reliability assessment of distribution network.

  16. Courts, Scheduled Damages, and Medical Malpractice Insurance

    DEFF Research Database (Denmark)

    Bertoli, Paola; Grembi, Veronica

    We assess the impact of the introduction of schedules of non-economic damages (i.e. tiered caps systems) on the behavior of insurers operating in the medical liability market for hospitals while controlling the performance of the judicial system, measured as court backlog. Using a difference......-in-differences strategy on Italian data, we find that the introduction of schedules increases the presence of insurers (i.e. medical liability market attractiveness) only in inefficient judicial districts. In the same way, court inefficiency is attractive to insurers for average values of schedules penetration...... of the market, with an increasing positive impact of inefficiency as the territorial coverage of schedules increases. Finally, no significant impact is registered on paid premiums. Our analysis sheds light on a complex set of elements affecting the decisions of insurers in malpractice markets. The analysis...

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

  18. Measuring Community Integration in Persons With Limb Trauma and Amputation: A Systematic Review.

    Science.gov (United States)

    Resnik, Linda; Borgia, Matthew; Silver, Benjamin

    2017-03-01

    To conduct a systematic review of community integration measures used with populations with limb trauma, amputation, or both, and to evaluate each measure's focus, content, and psychometric properties. Searches of PubMed and CINAHL for the terms social participation, community integration, social function, outcome assessment, wounds and injuries, and amputation/rehabilitation. Included English-language articles with a sample size of ≥20 adults with limb trauma or amputation. Measures were deemed eligible if they contained a majority of items related to the construct of participation as defined by the International Classification of Functioning, Disability and Health. Data on internal consistency; test-retest, interrater, and intrarater reliability; content, structural, construct, concurrent, and predictive validity; responsiveness; and floor/ceiling effects were extracted from each article and confirmed by a second investigator. A total of 156 articles containing 34 measures and 94 subscales were reviewed. Psychometric properties were rated, and an overall score was calculated for each measure. Content of the highest scoring measures was examined. Scant evidence was found regarding the psychometric properties of most measures. Eight scales from 5 instruments had the strongest measurement properties: the Trinity Amputation and Prosthesis Experience (TAPES) social restriction and adjustment to limitation scales; Community Reintegration of Injured Service Members (CRIS) extent of participation and perceived limitations scales; Medical Outcomes Study 36-Item Short-Form Health Survey (SF-36) role-physical and social functioning scales; the 136-item Sickness Impact Profile (SIP) psychosocial domain scale; and the World Health Organization Disability Assessment Schedule 2.0 (WHODAS-II) 12-item total score. Eights scales from 5 instruments-the TAPES, CRIS, SF-36, the 136-item SIP, and the WHODAS-II 12-item measure-had the strongest measurement properties. Published by

  19. CMS multicore scheduling strategy

    Energy Technology Data Exchange (ETDEWEB)

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

    2014-01-01

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

  20. Model Migration Schedules

    OpenAIRE

    1981-01-01

    This report draws on the fundamental regularity exhibited by age profiles of migration all over the world to develop a system of hypothetical model schedules that can be used in multiregional population analyses carried out in countries that lack adequate migration data.

  1. Personnel Scheduling in Laboratories

    NARCIS (Netherlands)

    Franses, Philip; Post, Gerhard; Burke, Edmund; De Causmaecker, Patrick

    2003-01-01

    We describe an assignment problem particular to the personnel scheduling of organisations such as laboratories. Here we have to assign tasks to employees. We focus on the situation where this assignment problem reduces to constructing maximal matchings in a set of interrelated bipartite graphs. We d

  2. Location-based Scheduling

    DEFF Research Database (Denmark)

    Andersson, Niclas; Christensen, Knud

    The coordination of activities and resources in order to establish an effective production flow is central to the management of construction projects. The traditional technique for coordination of activities and resources in construction projects is the CPM-scheduling, which has been the predomin......The coordination of activities and resources in order to establish an effective production flow is central to the management of construction projects. The traditional technique for coordination of activities and resources in construction projects is the CPM-scheduling, which has been...... the predominant scheduling method since it was introduced in the late 1950s. Over the years, CPM has proven to be a very powerful technique for planning, scheduling and controlling projects, which among other things is indicated by the development of a large number of CPM-based software applications available...... 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...

  3. Round Robin Schedules.

    Science.gov (United States)

    Iannone, Michael A.

    1983-01-01

    Presented is a computer program written in BASIC that covers round-robin schedules for team matches in competitions. The program was originally created to help teams in a tennis league play one match against every other team. Part of the creation of the program involved use of modulo arithmetic. (MP)

  4. Harmonious personnel scheduling

    NARCIS (Netherlands)

    Fijn van Draat, Laurens; Post, Gerhard; Veltman, Bart; Winkelhuijzen, Wessel

    2006-01-01

    The area of personnel scheduling is very broad. Here we focus on the ‘shift assignment problem’. Our aim is to discuss how ORTEC HARMONY handles this planning problem. In particular we go into the structure of the optimization engine in ORTEC HARMONY, which uses techniques from genetic algorithms, l

  5. Harmonious personnel scheduling

    NARCIS (Netherlands)

    Fijn van Draat, Laurens; Post, Gerhard F.; Veltman, Bart; Winkelhuijzen, Wessel

    2006-01-01

    The area of personnel scheduling is very broad. Here we focus on the ‘shift assignment problem’. Our aim is to discuss how ORTEC HARMONY handles this planning problem. In particular we go into the structure of the optimization engine in ORTEC HARMONY, which uses techniques from genetic algorithms,

  6. Class Schedules--Computer Loaded or Student Self-Scheduled?

    Science.gov (United States)

    Wall, Edward F.

    1979-01-01

    In the two-step process of student scheduling, the initial phase of course selection is the most important. At Chesterton High School in Indiana, student self-scheduling is preferred over computer loading. (Author/MLF)

  7. The trajectory of physical and mental health from injury to 5 years after multiple trauma: a prospective, longitudinal cohort study.

    Science.gov (United States)

    Soberg, Helene L; Finset, Arnstein; Roise, Olav; Bautz-Holter, Erik

    2012-05-01

    To describe the trajectory of physical and mental health from injury to 5 years postinjury for patients with multiple trauma, and to examine predictors of recovery of physical and mental health. A prospective, longitudinal cohort study with data from injury (baseline), the return home (t1), and 1 (t2), 2 (t3), and 5 (t4) years. Hospital and community setting. Patients (N=105; mean age ± SD, 35.3±14.0y; age range, 18-67y; 83% men) with multiple trauma and a New Injury Severity Score (NISS) ≥16 treated at a regional trauma referral center. Mean NISS ± SD was 34.6±12.6, and mean Glasgow Coma Scale (GCS) score ± SD was 12.2±3.9. Not applicable. Medical Outcomes Study 36-Item Short-Form Health Survey physical component summary (PCS) and mental component summary (MCS), injury severity parameters, and World Health Organization Disability Assessment Schedule II (WHODAS II) for activities and participation. The proportion with poor physical health (women) (B=-4.24, P=.003), education (low/high) (B=3.43, P=.019), and WHODAS II cognitive function (B=.18, P<.001) and Participation in society (B=.18, P≤.001). Physical and mental health over the 5 years improved with time, but was still significantly below population means. The physical and mental health status stabilized, but the recovery trajectories differed for physical and mental health. Predictors of health were personal and injury-related factors and function in a biopsychosocial perspective. Copyright © 2012 American Congress of Rehabilitation Medicine. Published by Elsevier Inc. All rights reserved.

  8. A novel concept for scheduling and effect assessment of soft-kill against an antiship missile based on the adjoint method

    NARCIS (Netherlands)

    Weiss, M.; Vermeulen, A.; Bos, J.; Bucco, D.

    2011-01-01

    The Adjoint Method is a well establised tool for assessement of guidance loops in conceptual design studies. It allows one to perform quick assessments of the performance both in deterministic settings, to determine a nominal or average miss distance, and in stochastic settings, to determine the

  9. Revisiting conjugate schedules.

    Science.gov (United States)

    MacAleese, Kenneth R; Ghezzi, Patrick M; Rapp, John T

    2015-07-01

    The effects of conjugate reinforcement on the responding of 13 college students were examined in three experiments. Conjugate reinforcement was provided via key presses that changed the clarity of pictures displayed on a computer monitor in a manner proportional to the rate of responding. Experiment 1, which included seven parameters of clarity change per response, revealed that responding decreased as the percentage clarity per response increased for all five participants. These results indicate that each participant's responding was sensitive to intensity change, which is a parameter of conjugate reinforcement schedules. Experiment 2 showed that responding increased during conjugate reinforcement phases and decreased during extinction phases for all four participants. Experiment 3 also showed that responding increased during conjugate reinforcement and further showed that responding decreased during a conjugate negative punishment condition for another four participants. Directions for future research with conjugate schedules are briefly discussed.

  10. LiveGantt: Interactively Visualizing a Large Manufacturing Schedule.

    Science.gov (United States)

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

    2014-12-01

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

  11. Multiprocessor scheduling with rejection

    Energy Technology Data Exchange (ETDEWEB)

    Bartal, Y. [Tel-Aviv Univ. (Israel); Leonardi, S.; Marchetti-Spaccamela, A. [Universita di Roma (Italy); Sgall, J. [Mathematical Inst., Zitna (Czechoslovakia)] [and others

    1996-12-31

    We consider a version of multiprocessor scheduling with the special feature that jobs may be rejected for a certain penalty. An instance of the problem is given by m identical parallel machines and a set of n jobs, each job characterized by a processing time and a penalty. In the on-line version the jobs arrive one by one and we have to schedule or reject a job before we have any information about future jobs. The objective is to minimize the makespan of the schedule for accepted jobs plus the sum of the penalties of rejected jobs. The main result is a 1 + {phi} {approx} 2.618 competitive algorithm for the on-line version of the problem, where 0 is the golden ratio. A matching lower bound shows that this is the best possible algorithm working for all m. For fixed m we give improved bounds, in particular for m = 2 we give an optimal {phi} {approx} 1.618 competitive algorithm. For the off-line problem we present a fully polynomial approximation scheme for fixed m and an approximation algorithm which runs in time O(n log n) for arbitrary m and guarantees 2 - 1/m approximation ratio.

  12. CMS Multicore Scheduling Strategy

    CERN Document Server

    Perez-Calero Yzquierdo, Antonio

    2014-01-01

    In the next years, processor architectures based on much larger numbers of cores will be most likely the model to continue Moores Law style throughput gains. This not only results in many more jobs in parallel running the LHC Run 1 era monolithic applications. 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 multi-core jobs on the GRID based on the glideIn WMS submission infrastructure. We will present the individual components of the strategy, from special site specific queues used during provisioning of resources and implications to scheduling; to dynamic partitioning within a single pilot to allow to transition to multi-core or whole-node scheduling on site level without disallowing single-core jobs. In this presentation, we will present the experiences mad...

  13. Customer Appeasement Scheduling

    CERN Document Server

    Nikseresht, Mohammad R; Maheshwari, Anil

    2010-01-01

    Almost all of the current process scheduling algorithms which are used in modern operating systems (OS) have their roots in the classical scheduling paradigms which were developed during the 1970's. But modern computers have different types of software loads and user demands. We think it is important to run what the user wants at the current moment. A user can be a human, sitting in front of a desktop machine, or it can be another machine sending a request to a server through a network connection. We think that OS should become intelligent to distinguish between different processes and allocate resources, including CPU, to those processes which need them most. In this work, as a first step to make the OS aware of the current state of the system, we consider process dependencies and interprocess communications. We are developing a model, which considers the need to satisfy interactive users and other possible remote users or customers, by making scheduling decisions based on process dependencies and interproce...

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

    Energy Technology Data Exchange (ETDEWEB)

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

    2013-12-06

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

  15. Scheduling a C-Section

    Science.gov (United States)

    ... Pregnancy > Labor & birth > Scheduling a c-section Scheduling a c-section E-mail to a friend Please fill in all fields. Please enter ... and develop before she’s born. Why can scheduling a c-section for non-medical reasons be a ...

  16. Flexible Scheduling: Making the Transition

    Science.gov (United States)

    Creighton, Peggy Milam

    2008-01-01

    Citing literature that supports the benefits of flexible scheduling on student achievement, the author exhorts readers to campaign for flexible scheduling in their library media centers. She suggests tips drawn from the work of Graziano (2002), McGregor (2006) and Stripling (1997) for making a smooth transition from fixed to flexible scheduling:…

  17. Probabilistic Bisimulation for Realistic Schedulers

    DEFF Research Database (Denmark)

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

    2015-01-01

    . This holds in the classical context of arbitrary schedulers, but it has been argued that this class of schedulers is unrealistically powerful. This paper studies a strictly coarser notion of bisimilarity, which still enjoys these properties in the context of realistic subclasses of schedulers: Trace...

  18. Continuous Media Tasks Scheduling Algorithm

    Directory of Open Access Journals (Sweden)

    Myungryun Yoo

    2016-03-01

    Full Text Available In this paper the authors propose modified proportional share scheduling algorithm considering the characteristics of continuous media such as its continuity and time dependency. Proposed scheduling algorithm shows graceful degradation of performance in overloaded situation and decreases the number of context switching. Proposed scheduling algorithm is evaluated using several numerical tests under various conditions, especially overloaded situation.

  19. Flexible Software for Flexible Scheduling

    Science.gov (United States)

    Economou, Frossie; Jenness, Tim; Tilanus, Remo P. J.; Hirst, Paul; Adamson, Andy J.; Rippa, Mathew; Delorey, Kynan K.; Isaak, Kate G.

    The JAC Observation Management Project (OMP) provides software for the James Clerk Maxwell (JCMT) and the United Kingdom Infrared (UKIRT) telescopes that manages the life-cycle of flexibly scheduled observations. Its aim is to increase observatory efficiency under flexible (queue) scheduled observing, without depriving the principal investigator (PI) of the flexibility associated with classical scheduling.

  20. Visualization and Simulation in Scheduling

    Directory of Open Access Journals (Sweden)

    R. Čapek

    2008-01-01

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

  1. CPU Scheduling Algorithms: A Survey

    Directory of Open Access Journals (Sweden)

    Imran Qureshi

    2014-01-01

    Full Text Available Scheduling is the fundamental function of operating system. For scheduling, resources of system shared among processes which are going to be executed. CPU scheduling is a technique by which processes are allocating to the CPU for a specific time quantum. In this paper the review of different scheduling algorithms are perform with different parameters, such as running time, burst time and waiting times etc. The reviews algorithms are first come first serve, Shortest Job First, Round Robin, and Priority scheduling algorithm.

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

  3. Steps Toward Optimal Competitive Scheduling

    Science.gov (United States)

    Frank, Jeremy; Crawford, James; Khatib, Lina; Brafman, Ronen

    2006-01-01

    This paper is concerned with the problem of allocating a unit capacity resource to multiple users within a pre-defined time period. The resource is indivisible, so that at most one user can use it at each time instance. However, different users may use it at different times. The users have independent, se@sh preferences for when and for how long they are allocated this resource. Thus, they value different resource access durations differently, and they value different time slots differently. We seek an optimal allocation schedule for this resource. This problem arises in many institutional settings where, e.g., different departments, agencies, or personal, compete for a single resource. We are particularly motivated by the problem of scheduling NASA's Deep Space Satellite Network (DSN) among different users within NASA. Access to DSN is needed for transmitting data from various space missions to Earth. Each mission has different needs for DSN time, depending on satellite and planetary orbits. Typically, the DSN is over-subscribed, in that not all missions will be allocated as much time as they want. This leads to various inefficiencies - missions spend much time and resource lobbying for their time, often exaggerating their needs. NASA, on the other hand, would like to make optimal use of this resource, ensuring that the good for NASA is maximized. This raises the thorny problem of how to measure the utility to NASA of each allocation. In the typical case, it is difficult for the central agency, NASA in our case, to assess the value of each interval to each user - this is really only known to the users who understand their needs. Thus, our problem is more precisely formulated as follows: find an allocation schedule for the resource that maximizes the sum of users preferences, when the preference values are private information of the users. We bypass this problem by making the assumptions that one can assign money to customers. This assumption is reasonable; a

  4. An integrated scheduling and program management system

    Science.gov (United States)

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

    2012-09-01

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

  5. SCHEDULING PROBLEMS-AN OVERVIEW

    Institute of Scientific and Technical Information of China (English)

    Asmuliardi MULUK; Hasan AKPOLAT; Jichao XU

    2003-01-01

    There seems to be a significant gap between the theoretical and the practical aspects of scheduling problems in the job shop environment. Theoretically, scheduling systems are designed on the basis of an optimum approach to the scheduling model. However in the practice, the optimum that is built into the scheduling applications seems to face some challenges when dealing with the dynamic character of a scheduling system, for instance machine breakdown or change of orders. Scheduling systems have become quite complex in the past few years. Competitive business environments and shorter product life cycles are the imminent challenges being faced by many companies these days.These challenges push companies to anticipate a demand driven supply chain in their business environment. A demand-driven supply chain incorporates the customer view into the supply chain processes. As a consequence of this, scheduling as a core process of the demand-driven supply chain must also reflect the customer view. In addition, other approaches to solving scheduling problems, for instance approaches based on human factors, prefer the scheduling system to be more flexible in both design and implementation. After discussion of these factors, the authors propose the integration of a different set of criteria for the development of scheduling systems which not only appears to have a better flexibility but also increased customer-focus.

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

  7. Psychometric properties of the Aberrant Behavior Checklist, the Anxiety, Depression and Mood Scale, the Assessment of Dual Diagnosis and the Social Performance Survey Schedule in adults with intellectual disabilities.

    Science.gov (United States)

    Rojahn, Johannes; Rowe, Ellen W; Kasdan, Shana; Moore, Linda; van Ingen, Daniel J

    2011-01-01

    Progress in clinical research and in empirically supported interventions in the area of psychopathology in intellectual disabilities (ID) depends on high-quality assessment instruments. To this end, psychometric properties of four instruments were examined: the Aberrant Behavior Checklist (ABC), the Assessment of Dual Diagnosis (ADD), the Anxiety, Depression and Mood Scale (ADAMS), and the Social Performance Survey Schedule (SPSS). Data were collected in two community-based groups of adults with mild to profound ID (n = 263). Subscale reliability (internal consistency) ranged from fair to excellent for the ABC, the ADAMS, and the SPSS (mean coefficient α across ABC subscales was .87 (ranging from fair to excellent), the ADAMS subscales .83 (ranging from fair to good), and the SPSS subscales .91 (range from good to excellent). The ADD subscales had generally lower reliability scores with a mean of .59 (ranging from unacceptable to good). Convergent and discriminant validity was determined by bivariate Spearman ρ correlations between subscales of one instrument and the subscales of the other three instruments. For the most part, all four instruments showed solid convergent and discriminant validity. To examine the factorial validity, Confirmatory Factor Analyses (CFA) were attempted with the inter-item covariance matrix of each instrument. Generally, the data did not show good fits with the measurement models for the SPSS, ABC, or the ADAMS (CFA analyses with the ADD would not converge). However, most of the items on these three instruments had significant loadings on their respective factors.

  8. The LSST OCS scheduler design

    Science.gov (United States)

    Delgado, Francisco; Schumacher, German

    2014-08-01

    The Large Synoptic Survey Telescope (LSST) is a complex system of systems with demanding performance and operational requirements. The nature of its scientific goals requires a special Observatory Control System (OCS) and particularly a very specialized automatic Scheduler. The OCS Scheduler is an autonomous software component that drives the survey, selecting the detailed sequence of visits in real time, taking into account multiple science programs, the current external and internal conditions, and the history of observations. We have developed a SysML model for the OCS Scheduler that fits coherently in the OCS and LSST integrated model. We have also developed a prototype of the Scheduler that implements the scheduling algorithms in the simulation environment provided by the Operations Simulator, where the environment and the observatory are modeled with real weather data and detailed kinematics parameters. This paper expands on the Scheduler architecture and the proposed algorithms to achieve the survey goals.

  9. DTS: Building custom, intelligent schedulers

    Science.gov (United States)

    Hansson, Othar; Mayer, Andrew

    1994-01-01

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

  10. Littoral Combat Ship Crew Scheduling

    Science.gov (United States)

    2015-03-01

    package DON Department of the Navy F&R Fix and Relax GAMS General Algebraic Modeling System LCS Littoral Combat Ship LCSRON Littoral Combat Ship...but that can be acceptable depending on the scheduler needs. F&R produces superior long-term schedules when compared to a similar-length RH schedule...LEFT BLANK 29 IV. MODEL IMPLEMENTATION LCSS is implemented with the General Algebraic Modeling System (GAMS) using the GAMS/CPLEX (GAMS, 2014

  11. Instruction Scheduling Across Control Flow

    Directory of Open Access Journals (Sweden)

    Martin Charles Golumbic

    1993-01-01

    Full Text Available Instruction scheduling algorithms are used in compilers to reduce run-time delays for the compiled code by the reordering or transformation of program statements, usually at the intermediate language or assembly code level. Considerable research has been carried out on scheduling code within the scope of basic blocks, i.e., straight line sections of code, and very effective basic block schedulers are now included in most modern compilers and especially for pipeline processors. In previous work Golumbic and Rainis: IBM J. Res. Dev., Vol. 34, pp.93–97, 1990, we presented code replication techniques for scheduling beyond the scope of basic blocks that provide reasonable improvements of running time of the compiled code, but which still leaves room for further improvement. In this article we present a new method for scheduling beyond basic blocks called SHACOOF. This new technique takes advantage of a conventional, high quality basic block scheduler by first suppressing selected subsequences of instructions and then scheduling the modified sequence of instructions using the basic block scheduler. A candidate subsequence for suppression can be found by identifying a region of a program control flow graph, called an S-region, which has a unique entry and a unique exit and meets predetermined criteria. This enables scheduling of a sequence of instructions beyond basic block boundaries, with only minimal changes to an existing compiler, by identifying beneficial opportunities to cover delays that would otherwise have been beyond its scope.

  12. Scheduling the powering tests

    CERN Document Server

    Barbero-Soto, E; Casas-Lino, M P; Fernandez-Robles, C; Foraz, K; Pojer, M; Saban, R; Schmidt, R; Solfaroli-Camillocci, M; Vergara-Fernandez, A

    2008-01-01

    The Large Hadron Collider is now entering in its final phase before receiving beam, and the activities at CERN between 2007 and 2008 have shifted from installation work to the commissioning of the technical systems ("hardware commissioning"). Due to the unprecedented complexity of this machine, all the systems are or will be tested as far as possible before the cool-down starts. Systems are firstly tested individually before being globally tested together. The architecture of LHC, which is partitioned into eight cryogenically and electrically independent sectors, allows the commissioning on a sector by sector basis. When a sector reaches nominal cryogenic conditions, commissioning of the magnet powering system to nominal current for all magnets can be performed. This paper briefly describes the different activities to be performed during the powering tests of the superconducting magnet system and presents the scheduling issues raised by co-activities as well as the management of resources.

  13. Routing and scheduling problems

    DEFF Research Database (Denmark)

    Reinhardt, Line Blander

    In today’s globalized society, transport contributes to our daily life in many different ways. The production of the parts for a shelf ready product may take place on several continents and our travel between home and work, vacation travel and business trips has increased in distance the last......, the effectiveness of the network is of importance aiming at satisfying as many costumer demands as possible at a low cost. Routing represent a path between locations such as an origin and destination for the object routed. Sometimes routing has a time dimension as well as the physical paths. This may...... to a destination on a predefined network, the routing and scheduling of vessels in a liner shipping network given a demand forecast to be covered, the routing of manpower and vehicles transporting disabled passengers in an airport and the vehicle routing with time windows where one version studied includes edge...

  14. Visually Exploring Transportation Schedules.

    Science.gov (United States)

    Palomo, Cesar; Guo, Zhan; Silva, Cláudio T; Freire, Juliana

    2016-01-01

    Public transportation schedules are designed by agencies to optimize service quality under multiple constraints. However, real service usually deviates from the plan. Therefore, transportation analysts need to identify, compare and explain both eventual and systemic performance issues that must be addressed so that better timetables can be created. The purely statistical tools commonly used by analysts pose many difficulties due to the large number of attributes at trip- and station-level for planned and real service. Also challenging is the need for models at multiple scales to search for patterns at different times and stations, since analysts do not know exactly where or when relevant patterns might emerge and need to compute statistical summaries for multiple attributes at different granularities. To aid in this analysis, we worked in close collaboration with a transportation expert to design TR-EX, a visual exploration tool developed to identify, inspect and compare spatio-temporal patterns for planned and real transportation service. TR-EX combines two new visual encodings inspired by Marey's Train Schedule: Trips Explorer for trip-level analysis of frequency, deviation and speed; and Stops Explorer for station-level study of delay, wait time, reliability and performance deficiencies such as bunching. To tackle overplotting and to provide a robust representation for a large numbers of trips and stops at multiple scales, the system supports variable kernel bandwidths to achieve the level of detail required by users for different tasks. We justify our design decisions based on specific analysis needs of transportation analysts. We provide anecdotal evidence of the efficacy of TR-EX through a series of case studies that explore NYC subway service, which illustrate how TR-EX can be used to confirm hypotheses and derive new insights through visual exploration.

  15. Developing scheduling benchmark tests for the Space Network

    Science.gov (United States)

    Moe, Karen L.; Happell, Nadine; Brady, Sean

    1993-01-01

    A set of benchmark tests were developed to analyze and measure Space Network scheduling characteristics and to assess the potential benefits of a proposed flexible scheduling concept. This paper discusses the role of the benchmark tests in evaluating alternative flexible scheduling approaches and defines a set of performance measurements. The paper describes the rationale for the benchmark tests as well as the benchmark components, which include models of the Tracking and Data Relay Satellite (TDRS), mission spacecraft, their orbital data, and flexible requests for communication services. Parameters which vary in the tests address the degree of request flexibility, the request resource load, and the number of events to schedule. Test results are evaluated based on time to process and schedule quality. Preliminary results and lessons learned are addressed.

  16. CHILDHOOD PSYCHOPATHOLOGY MEAUSREMENT SCHEDULE: DEVELOPMENT AND STANDARDIZATION*

    OpenAIRE

    Malhotra, Savita; Varma, V.K.; Verma, S.K.; Malhotra, Anil

    1988-01-01

    SUMMARY Development and standardization of an instrument Childhood Psychopathology Measurement Schedule (CPMS) to assess psychopathology in children is reported. CPMS is standardized on Indian population and is applicable to children of both sexes in the age range of 4-14 years. It measures overall psychopathology in the form of a total scores and also the type of psychopathology in the form of eight factorially derived syndromes which have satisfactory reliability and validity. CPMS is propo...

  17. Feasibility study of an Integrated Program for Aerospace-vehicle Design (IPAD) system. Volume 6: Implementation schedule, development costs, operational costs, benefit assessment, impact on company organization, spin-off assessment, phase 1, tasks 3 to 8

    Science.gov (United States)

    Garrocq, C. A.; Hurley, M. J.; Dublin, M.

    1973-01-01

    A baseline implementation plan, including alternative implementation approaches for critical software elements and variants to the plan, was developed. The basic philosophy was aimed at: (1) a progressive release of capability for three major computing systems, (2) an end product that was a working tool, (3) giving participation to industry, government agencies, and universities, and (4) emphasizing the development of critical elements of the IPAD framework software. The results of these tasks indicate an IPAD first release capability 45 months after go-ahead, a five year total implementation schedule, and a total developmental cost of 2027 man-months and 1074 computer hours. Several areas of operational cost increases were identified mainly due to the impact of additional equipment needed and additional computer overhead. The benefits of an IPAD system were related mainly to potential savings in engineering man-hours, reduction of design-cycle calendar time, and indirect upgrading of product quality and performance.

  18. The Effectiveness of Block Scheduling.

    Science.gov (United States)

    Creamean, Sharon Lightle; Horvath, Robert Jeffery

    This report describes a program for the exploration of block scheduling. The targeted population consists of high school students in a growing, middle-class community, located in a suburban setting of a large mid-western city. The historical background of block scheduling is documented through data gathered using attendance reports, student…

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

  20. A decentralized scheduling algorithm for time synchronized channel hopping

    Directory of Open Access Journals (Sweden)

    Andrew Tinka

    2011-09-01

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

  1. Incremental Scheduling Engines for Human Exploration of the Cosmos

    Science.gov (United States)

    Jaap, John; Phillips, Shaun

    2005-01-01

    As humankind embarks on longer space missions farther from home, the requirements and environments for scheduling the activities performed on these missions are changing. As we begin to prepare for these missions it is appropriate to evaluate the merits and applicability of the different types of scheduling engines. Scheduling engines temporally arrange tasks onto a timeline so that all constraints and objectives are met and resources are not overbooked. Scheduling engines used to schedule space missions fall into three general categories: batch, mixed-initiative, and incremental. This paper presents an assessment of the engine types, a discussion of the impact of human exploration of the moon and Mars on planning and scheduling, and the applicability of the different types of scheduling engines. This paper will pursue the hypothesis that incremental scheduling engines may have a place in the new environment; they have the potential to reduce cost, to improve the satisfaction of those who execute or benefit from a particular timeline (the customers), and to allow astronauts to plan their own tasks and those of their companion robots.

  2. Astronaut Office Scheduling System Software

    Science.gov (United States)

    Brown, Estevancio

    2010-01-01

    AOSS is a highly efficient scheduling application that uses various tools to schedule astronauts weekly appointment information. This program represents an integration of many technologies into a single application to facilitate schedule sharing and management. It is a Windows-based application developed in Visual Basic. Because the NASA standard office automation load environment is Microsoft-based, Visual Basic provides AO SS developers with the ability to interact with Windows collaboration components by accessing objects models from applications like Outlook and Excel. This also gives developers the ability to create newly customizable components that perform specialized tasks pertaining to scheduling reporting inside the application. With this capability, AOSS can perform various asynchronous tasks, such as gathering/ sending/ managing astronauts schedule information directly to their Outlook calendars at any time.

  3. Probabilistic Anonymity and Admissible Schedulers

    CERN Document Server

    Garcia, Flavio D; Sokolova, Ana

    2007-01-01

    When studying safety properties of (formal) protocol models, it is customary to view the scheduler as an adversary: an entity trying to falsify the safety property. We show that in the context of security protocols, and in particular of anonymizing protocols, this gives the adversary too much power; for instance, the contents of encrypted messages and internal computations by the parties should be considered invisible to the adversary. We restrict the class of schedulers to a class of admissible schedulers which better model adversarial behaviour. These admissible schedulers base their decision solely on the past behaviour of the system that is visible to the adversary. Using this, we propose a definition of anonymity: for all admissible schedulers the identity of the users and the observations of the adversary are independent stochastic variables. We also develop a proof technique for typical cases that can be used to proof anonymity: a system is anonymous if it is possible to `exchange' the behaviour of two...

  4. The GBT Dynamic Scheduling System: A New Scheduling Paradigm

    Science.gov (United States)

    O'Neil, K.; Balser, D.; Bignell, C.; Clark, M.; Condon, J.; McCarty, M.; Marganian, P.; Shelton, A.; Braatz, J.; Harnett, J.; Maddalena, R.; Mello, M.; Sessoms, E.

    2009-09-01

    The Robert C. Byrd Green Bank Telescope (GBT) is implementing a new Dynamic Scheduling System (DSS) designed to maximize the observing efficiency of the telescope while ensuring that none of the flexibility and ease of use of the GBT is harmed and that the data quality of observations is not adversely affected. To accomplish this, the GBT DSS is implementing a dynamic scheduling system which schedules observers, rather than running scripts. The DSS works by breaking each project into one or more sessions which have associated observing criteria such as RA, Dec, and frequency. Potential observers may also enter dates when members of their team will not be available for either on-site or remote observing. The scheduling algorithm uses those data, along with the predicted weather, to determine the most efficient schedule for the GBT. The DSS provides all observers at least 24 hours notice of their upcoming observing. In the uncommon (DSS project, including the ranking and scheduling algorithms for the sessions, the scheduling probabilities generation, the web framework for the system, and an overview of the results from the beta testing which were held from June - September, 2008.

  5. TECHNICAL COORDINATION SCHEDULE & INTEGRATION

    CERN Multimedia

    W. Zeuner

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

  6. Bulletin publication schedule

    CERN Multimedia

    Publications Section, DG-CO Group

    2011-01-01

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

  7. Gain scheduling using the Youla parameterization

    DEFF Research Database (Denmark)

    Niemann, Hans Henrik; Stoustrup, Jakob

    1999-01-01

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

  8. Optimal Deadline Scheduling with Commitment

    CERN Document Server

    Chen, Shiyao; He, Ting

    2011-01-01

    We consider an online preemptive scheduling problem where jobs with deadlines arrive sporadically. A commitment requirement is imposed such that the scheduler has to either accept or decline a job immediately upon arrival. The scheduler's decision to accept an arriving job constitutes a contract with the customer; if the accepted job is not completed by its deadline as promised, the scheduler loses the value of the corresponding job and has to pay an additional penalty depending on the amount of unfinished workload. The objective of the online scheduler is to maximize the overall profit, i.e., the total value of the admitted jobs completed before their deadlines less the penalty paid for the admitted jobs that miss their deadlines. We show that the maximum competitive ratio is $3-2\\sqrt{2}$ and propose a simple online algorithm to achieve this competitive ratio. The optimal scheduling includes a threshold admission and a greedy scheduling policies. The proposed algorithm has direct applications to the chargin...

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

  10. Scheduling the Belgian soccer league.

    OpenAIRE

    Goossens, Dries; Spieksma, Frederik

    2009-01-01

    Any sports league needs a schedule of play, and such a schedule can be important, as it may influence the outcome of the sports competition itself and since it may have an impact on the interests of all parties involved. As in many other sports leagues and countries, the interest for Belgian soccer has increased over the last years. This paper describes our experiences in scheduling the highest Belgian soccer league. We describe how we automated and improved the way in which the calendar is ...

  11. When greediness fails: examples from stochastic scheduling

    NARCIS (Netherlands)

    Uetz, Marc Jochen

    The purpose of this paper is to present examples for the sometimes surprisingly different behavior of deterministic and stochastic scheduling problems. In particular, it demonstrates some seemingly counterintuitive properties of optimal scheduling policies for stochastic machine scheduling problems.

  12. When greediness fails: examples from stochastic scheduling

    NARCIS (Netherlands)

    Uetz, Marc

    2003-01-01

    The purpose of this paper is to present examples for the sometimes surprisingly different behavior of deterministic and stochastic scheduling problems. In particular, it demonstrates some seemingly counterintuitive properties of optimal scheduling policies for stochastic machine scheduling problems.

  13. Comparing Book- and Tablet-Based Picture Activity Schedules: Acquisition and Preference.

    Science.gov (United States)

    Giles, Aimee; Markham, Victoria

    2017-09-01

    Picture activity schedules consist of a sequence of images representing the order of tasks for a person to complete. Although, picture activity schedules have traditionally been presented in a book format, recently picture activity schedules have been evaluated on technological devices such as an iPod™ touch. The present study compared the efficiency of picture activity schedule acquisition on book- and tablet-based modalities. In addition, participant preference for each modality was assessed. Three boys aged below 5 years with a diagnosis of autism participated. Participants were taught to follow the schedules using both modalities. Following mastery of each modality of picture activity schedule, a concurrent-chains preference assessment was conducted to evaluate participant preference for each modality. Differences in acquisition rates across the two modalities were marginal. Preference for book- or tablet-based schedules was idiosyncratic across participants.

  14. Multiagent scheduling models and algorithms

    CERN Document Server

    Agnetis, Alessandro; Gawiejnowicz, Stanisław; Pacciarelli, Dario; Soukhal, Ameur

    2014-01-01

    This book presents multi-agent scheduling models in which subsets of jobs sharing the same resources are evaluated by different criteria. It discusses complexity results, approximation schemes, heuristics and exact algorithms.

  15. Executive Schedule C System (ESCS)

    Data.gov (United States)

    Office of Personnel Management — Used to store information on Federal employees in the Senior Executive Service (SES) and appointed employees in the Schedule C System. Every four years, just after...

  16. The GBT Dynamic Scheduling System

    Science.gov (United States)

    McCarty, M. T.; Balser, D. S.; Braatz, J.; Clark, M. H.; Condon, J.; Creager, R. E.; Maddalena, R. J.; Marganian, P.; O'Neil, K.; Sessoms, E.; Shelton, A. L.

    2012-09-01

    The Robert C. Byrd Green Bank Telescope (GBT) Dynamic Scheduling System (DSS), in use since September, 2009, was designed to maximize observing efficiency while preserving telescope flexibility and data quality without creating undue adversity for the observers. Using observing criteria; observer availability and qualifications for remote observing; three-dimensional weather forecasts; and telescope state, the DSS software optimally schedules observers 24 to 48 hours in advance for a telescope that has a wide-range of capabilities and a geographical location with variable weather patterns. The DSS project was closed October 28, 2011 and will now enter a continuing maintenance and enhancement phase. Recent improvements include a new resource calendar for incorporating telescope maintenance activities, a sensitivity calculator that leverages the scheduling algorithms to facilitate consistent tools for proposal preparation, improved support for monitoring observations, scheduling of high frequency continuum and spectral line observations for both sparse and fully sampled array receivers, and additional session parameters for observations having special requirements.

  17. Schedule Sales Query Raw Data

    Data.gov (United States)

    General Services Administration — Schedule Sales Query presents sales volume figures as reported to GSA by contractors. The reports are generated as quarterly reports for the current year and the...

  18. Future aircraft networks and schedules

    Science.gov (United States)

    Shu, Yan

    2011-07-01

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

  19. Scheduling commercial advertisements for television

    OpenAIRE

    Garcia-Villoria, Alberto; Salhi, Said

    2014-01-01

    The problem of scheduling the commercial advertisements in the television industry is investigated. Each advertiser client demands that the multiple airings of the same brand advertisement should be as spaced as possible over a given time period. Moreover, audience rating requests have to be taken into account in the scheduling. This is the first time this hard decision problem is dealt with in the literature. We design two mixed integer linear programming (MILP) models. Two constructive heur...

  20. Effect of signaling reinforcement on resistance to change in a multiple schedule.

    Science.gov (United States)

    Bell, Matthew C; Seip, Katharine M; Fitzsimmons, Kathleen S

    2007-01-10

    This study evaluated the effect of a signal on resistance to change using a multiple schedule of reinforcement. Experiment 1 presented pigeons with three schedules: a signaled delay to reinforcement schedule (a two-link chain schedule with a variable-interval 120-s initial link followed by a 5-s fixed-time schedule), an unsignaled delay schedule (a comparable two-link tandem schedule), and an immediate, zero-delay variable-interval 125-s schedule. Two separate disruption procedures assessed resistance to change: extinction and adding a variable-time 20-s schedule of reinforcement to the inter-component interval. Resistance to change tests were conducted twice, once with the signal stimulus (the terminal link of the chain schedule) present and once with it absent. Results from both disruption procedures showed that signal absence reduced resistance to change for the pre-signal stimulus. In probe choice tests subjects strongly preferred the signal stimulus over the unsignaled stimulus and exhibited no reliable preference when given a choice between the signal stimulus and immediate stimulus. Experiment 2 presented two equal signaled schedules where, during resistance to change tests, the signal remained for one schedule and was removed for the second. Resistance to change was consistently lower when the signal was absent.

  1. Dynamic Extra Buses Scheduling Strategy in Public Transport

    Directory of Open Access Journals (Sweden)

    Bin Yu

    2015-06-01

    Full Text Available This paper presents a dynamic extra buses scheduling strategy to improve the transit service of transit routes. In this strategy, in order to decide when to dispatch an extra bus, the service reliability of transit route is assessed firstly. A model aimed at maximizing the benefit of the extra buses scheduling strategy is constructed to determine how many stops extra buses need to skip from the terminal to accommodate passengers at the following stops. A heuristic algorithm is defined and implemented to estimate the service reliability of transit route and to optimize the initial stop of extra buses scheduling strategy. Finally, the strategy is tested on two examples: a simple and a real-life transit route in the Dalian city in China. The results show that the extra buses scheduling strategy based on terminal stops with a reasonable threshold can save 8.01% waiting time of passengers.

  2. An Improved Round Robin Scheduling Algorithm for CPU scheduling

    Directory of Open Access Journals (Sweden)

    Rakesh Kumar yadav

    2010-07-01

    Full Text Available There are many functions which are provided by operating system like process management, memory management, file management, input/outputmanagement, networking, protection system and command interpreter system. In these functions, the process management is most important function because operating system is a system program that means at the runtime process interact with hardware. Therefore, we can say that for improving the efficiency of a CPU we need to manage all process. For managing the process we use various types scheduling algorithm. There are many algorithm are available for CPU scheduling. But all algorithms have its own deficiency and limitations. In this paper, I proposed a new approach for round robin scheduling algorithm which helps to improve the efficiency of CPU.

  3. An Optimized Round Robin Scheduling Algorithm for CPU Scheduling

    Directory of Open Access Journals (Sweden)

    Ajit Singh

    2010-10-01

    Full Text Available The main objective of this paper is to develop a new approach for round robin scheduling which help to improve the CPU efficiency in real time and time sharing operating system. There are many algorithms available for CPU scheduling. But we cannot implemented in real time operating system because of high context switch rates, large waiting time, large response time, large trn around time and less throughput. The proposed algorithm improves all the drawback of simple round robin architecture. The author have also given comparative analysis of proposed with simple round robin scheduling algorithm. Therefore, the author strongly feel that the proposed architecture solves all the problem encountered in simple round robin architecture by decreasing the performance parameters to desirable extent and thereby increasing the system throughput.

  4. 75 FR 39629 - FOIA Fee Schedule Update

    Science.gov (United States)

    2010-07-12

    ... 1703 FOIA Fee Schedule Update AGENCY: Defense Nuclear Facilities Safety Board. ACTION: Establishment of... Information Act (FOIA) Fee Schedule Update pursuant to 10 CFR 1703.107(b)(6) of the Board's regulations. DATES... update the FOIA Fee Schedule once every 12 months. The previous Fee Schedule Update was published in...

  5. 76 FR 43819 - FOIA Fee Schedule Update

    Science.gov (United States)

    2011-07-22

    ... SAFETY BOARD 10 CFR Part 1703 FOIA Fee Schedule Update AGENCY: Defense Nuclear Facilities Safety Board... publishing its Freedom of Information Act (FOIA) Fee Schedule Update pursuant to the Board's regulations... General Manager will update the FOIA Fee Schedule once every 12 months. The previous Fee Schedule...

  6. Gain scheduling using the youla parameterization

    DEFF Research Database (Denmark)

    Niemann, H.H.; Stoustrup, Jakob

    1999-01-01

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

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

  8. Nurse Scheduling Using Genetic Algorithm

    Directory of Open Access Journals (Sweden)

    Komgrit Leksakul

    2014-01-01

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

  9. Batch Scheduling a Fresh Approach

    Science.gov (United States)

    Cardo, Nicholas P.; Woodrow, Thomas (Technical Monitor)

    1994-01-01

    The Network Queueing System (NQS) was designed to schedule jobs based on limits within queues. As systems obtain more memory, the number of queues increased to take advantage of the added memory resource. The problem now becomes too many queues. Having a large number of queues provides users with the capability to gain an unfair advantage over other users by tailoring their job to fit in an empty queue. Additionally, the large number of queues becomes confusing to the user community. The High Speed Processors group at the Numerical Aerodynamics Simulation (NAS) Facility at NASA Ames Research Center developed a new approach to batch job scheduling. This new method reduces the number of queues required by eliminating the need for queues based on resource limits. The scheduler examines each request for necessary resources before initiating the job. Also additional user limits at the complex level were added to provide a fairness to all users. Additional tools which include user job reordering are under development to work with the new scheduler. This paper discusses the objectives, design and implementation results of this new scheduler

  10. Feature-based telescope scheduler

    Science.gov (United States)

    Naghib, Elahesadat; Vanderbei, Robert J.; Stubbs, Christopher

    2016-07-01

    Feature-based Scheduler offers a sequencing strategy for ground-based telescopes. This scheduler is designed in the framework of Markovian Decision Process (MDP), and consists of a sub-linear online controller, and an offline supervisory control-optimizer. Online control law is computed at the moment of decision for the next visit, and the supervisory optimizer trains the controller by simulation data. Choice of the Differential Evolution (DE) optimizer, and introducing a reduced state space of the telescope system, offer an efficient and parallelizable optimization algorithm. In this study, we applied the proposed scheduler to the problem of Large Synoptic Survey Telescope (LSST). Preliminary results for a simplified model of LSST is promising in terms of both optimality, and computational cost.

  11. Scheduling Linearly Indexed Assignment Codes

    Science.gov (United States)

    Kailath, Thomas; Roychowdhury, Vwani P.

    1989-05-01

    It has been recently shown that linearly indexed Assignment Codes can be efficiently used for coding several problems especially in signal processing and matrix algebra. In fact, mathematical expressions for many algorithms are directly in the form of linearly indexed codes, and examples include the formulas for matrix multiplication, any m-dimensional convolution/correlation, matrix transposition, and solving matrix Lyapunov's equation. Systematic procedures for converting linearly indexed Assignment Codes to localized algorithms that are closely related to Regular Iterative Algorithms (RIAs) have also been developed. These localized algorithms can be often efficiently scheduled by modeling them as RIAs; however, it is not always efficient to do so. In this paper we shall analyze and develop systematic procedures for determining efficient schedules directly for the linearly indexed ACs and the localized algorithms. We shall also illustrate our procedures by determining schedules for examples such as matrix transposition and Gauss-Jordan elimination algorithm.

  12. Schedulability Analysis for Java Finalizers

    DEFF Research Database (Denmark)

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

    2010-01-01

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

  13. Optimal randomized scheduling by replacement

    Energy Technology Data Exchange (ETDEWEB)

    Saias, I.

    1996-05-01

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

  14. Schedulability Analysis for Java Finalizers

    DEFF Research Database (Denmark)

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

    2010-01-01

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

  15. Endogenous scheduling preferences and congestion

    DEFF Research Database (Denmark)

    Fosgerau, Mogens; Small, Kenneth

    2010-01-01

    Dynamic models of congestion so far rely on exogenous scheduling preferences of travelers, based for example on disutility of deviation from a preferred departure or arrival time for a trip. This paper provides a more fundamental view in which travelers derive utility just from consumption...... and leisure, but agglomeration economies at home and at work lead to scheduling preferences forming endogenously. Using bottleneck congestion technology, we obtain an equilibrium queuing pattern consistent with a general version of the Vickrey bottleneck model. However, the policy implications are different....... Compared to the predictions of an analyst observing untolled equilibrium and taking scheduling preferences as exogenous, we find that both the optimal capacity and the marginal external cost of congestion have changed. The benefits of tolling are greater, and the optimal time varying toll is different....

  16. Environmental surveillance master sampling schedule

    Energy Technology Data Exchange (ETDEWEB)

    Bisping, L.E.

    1997-01-01

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

  17. A Disk Scheduling Algorithm: SPFF

    Institute of Scientific and Technical Information of China (English)

    HU Ming

    2005-01-01

    We put forward an optimal disk schedule with n disk requests and prove its optimality mathematically. Generalizing the idea of an optimal disk schedule, we remove the limit of n requests and, at the same time, consider the dynamically arrival model of disk requests to obtain an algorithm, shortest path first-fit first (SPFF). This algorithm is based on the shortest path of disk head motion constructed by all the pendent requests. From view of the head-moving distance, it has the stronger globality than SSTF. From view of the head-moving direction, it has the better flexibility than SCAN. Therefore, SPFF keeps the advantage of SCAN and, at the same time, absorbs the strength of SSTF. The algorithm SPFF not only shows the more superiority than other scheduling polices, but also have higher adjustability to meet the computer system's different demands.

  18. Safe self-scheduling: A parallel loop scheduling scheme for shared-memory multiprocessors

    Energy Technology Data Exchange (ETDEWEB)

    Liu, J. [Western Oregon State College, Monmouth, OR (United States); Saletore, V.A. [Oregon State Univ., Corvallis, OR (United States); Lewis, T.G. [Naval Postgraduate School, Monterey, CA (United States)

    1994-12-01

    In this paper we present Safe Self-Scheduling (SSS), a new scheduling scheme that schedules parallel loops with variable length iteration execution times not known at compile time. The scheme assumes a shared memory space. SSS combines static scheduling with dynamic scheduling and draws favorable advantages from each. First, it reduces the dynamic scheduling overhead by statistically scheduling a major portion of loop iterations. Second, the workload is balanced with simple and efficient self-scheduling scheme by applying a new measure, the smallest critical chore size. Experimental results comparing SSS with other scheduling schemes indicate that SSS surpasses other scheduling schemes. In the experiment on Gauss-Jordan, an application that is suitable for static scheduling schemes, SSS is the only self-scheduling scheme that outperforms the static scheduling scheme. This indicates that SSS achieves a balanced workload with a very small amount of overhead.

  19. Micro-Opportunistic Scheduling: The Micro-Boss Factory Scheduler

    Science.gov (United States)

    1994-01-01

    M.R. Garey and D.S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman and Co., 1979. [13] Eliyahu M. Goldratt ...techniques is the one developed by Goldratt and his colleagues within the context of the OPT factory scheduling system [13, 15, 10]. OPT demonstrated

  20. Scheduling to Minimize Energy and Flow Time in Broadcast Scheduling

    CERN Document Server

    Moseley, Benjamin

    2010-01-01

    In this paper we initiate the study of minimizing power consumption in the broadcast scheduling model. In this setting there is a wireless transmitter. Over time requests arrive at the transmitter for pages of information. Multiple requests may be for the same page. When a page is transmitted, all requests for that page receive the transmission simulteneously. The speed the transmitter sends data at can be dynamically scaled to conserve energy. We consider the problem of minimizing flow time plus energy, the most popular scheduling metric considered in the standard scheduling model when the scheduler is energy aware. We will assume that the power consumed is modeled by an arbitrary convex function. For this problem there is a $\\Omega(n)$ lower bound. Due to the lower bound, we consider the resource augmentation model of Gupta \\etal \\cite{GuptaKP10}. Using resource augmentation, we give a scalable algorithm. Our result also gives a scalable non-clairvoyant algorithm for minimizing weighted flow time plus energ...

  1. Hubble Systems Optimize Hospital Schedules

    Science.gov (United States)

    2009-01-01

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

  2. Endogenous scheduling preferences and congestion

    DEFF Research Database (Denmark)

    Fosgerau, Mogens; Small, Kenneth

    2010-01-01

    Dynamic models of congestion so far rely on exogenous scheduling preferences of travelers, based for example on disutility of deviation from a preferred departure or arrival time for a trip. This paper provides a more fundamental view in which travelers derive utility just from consumption...... and leisure, but agglomeration economies at home and at work lead to scheduling preferences forming endogenously. Using bottleneck congestion technology, we obtain an equilibrium queuing pattern consistent with a general version of the Vickrey bottleneck model. However, the policy implications are different...

  3. Preference and resistance to change in concurrent variable-interval schedules.

    Science.gov (United States)

    Bell, Matthew C; Williams, Ben A

    2002-02-01

    Pigeons were trained on a multiple schedule in which separate concurrent schedules were presented in the two components of the schedule. During one component, concurrent variable-interval 40-sec variable-interval 80-sec schedules operated. In the second component, concurrent variable-interval 40-sec variable-interval 20-sec schedules operated. After stable baseline performance was obtained in both components, extinction probe choice tests were presented to assess preference between the variable-interval 40-sec schedules from the two components. The variable-interval 40-sec schedule paired with the variable-interval 80-sec schedule was preferred over the variable-interval 40-sec schedule paired with the variable-interval 20-sec schedule. The subjects were also exposed to several resistance-to-change manipulations: (1) prefeeding prior to the experimental session, (2) a free-food schedule added to timeout periods separating components, and (3) extinction. The results indicated that preference and resistance to change do not necessarily covary.

  4. The CHI 2013 interactive schedule

    DEFF Research Database (Denmark)

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

    2013-01-01

    is available. The CHI'13 Interactive Schedule helps attendees navigate this wealth of video content in order to identify events they would like to attend. It consists of a number of large display screens throughout the conference venue which cycle through a video playlist of events. Attendees can interact...

  5. A scheduling model for astronomy

    Science.gov (United States)

    Solar, M.; Michelon, P.; Avarias, J.; Garces, M.

    2016-04-01

    Astronomical scheduling problem has several external conditions that change dynamically at any time during observations, like weather condition (humidity, temperature, wind speed, opacity, etc.), and target visibility conditions (target over the horizon, Sun/Moon blocking the target). Therefore, a dynamic re-scheduling is needed. An astronomical project will be scheduled as one or more Scheduling Blocks (SBs) as an atomic unit of astronomical observations. We propose a mixed integer linear programming (MILP) solution to select the best SBs, favors SBs with high scientific values, and thus maximizing the quantity of completed observation projects. The data content of Atacama Large Millimeter/Submillimeter Array (ALMA) projects of cycle 0 and cycle 1 were analyzed, and a synthetic set of tests of the real instances was created. Two configurations, one of 5000 SBs in a 3 months season and another 10,000 SBs a 6 months season were created. These instances were evaluated with excellent results. Through the testing it is showed that the MILP proposal has optimal solutions.

  6. Lifetime Improvement by Battery Scheduling

    NARCIS (Netherlands)

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

    2012-01-01

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

  7. Lifetime improvement by battery scheduling

    NARCIS (Netherlands)

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

    2011-01-01

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

  8. Lifetime Improvement by Battery Scheduling

    NARCIS (Netherlands)

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

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

  9. Lifetime improvement by battery scheduling

    NARCIS (Netherlands)

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

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

  10. CROP UNDER DEFICIT IRRIGATION SCHEDULING

    African Journals Online (AJOL)

    This study presents crop coefficient (Kc) values of TMV 1 -ST maize variety ... given time from planting to the time it is harvested. ... real time irrigation scheduling for high frequent and non-fiequent water .... 10 m, and the average soil bulk density was 1420 kg/m'. ...... Performance Evaluation of Fadama Irrigation Practice.

  11. Environmental surveillance master sampling schedule

    Energy Technology Data Exchange (ETDEWEB)

    Bisping, L.E.

    1996-02-01

    Environmental surveillance of the Hanford Site and surrounding areas is conducted by the Pacific Northwest National Laboratory (PNNL) for the US Department of Energy (DOE). This document contains the planned 1996 schedules for routine collection of samples for the Surface Environmental Surveillance Project (SESP), Drinking Water Project, and Ground-Water Surveillance Project.

  12. Decentralized Real-Time Scheduling

    Science.gov (United States)

    1990-08-01

    917-932, August, 1987. [ Daniels 86] D. C. Daniels and H. F. Wedde. Real-Time Performance of a Completely Distributed Operating System. In Proceedings...imnmediate execuoon The schedule c.-eated by the SeltctPhaseProcfj procedure is an ordere-d lis t of mocl -phnise pairs, each placed according to the

  13. Cooperation in Networks and Scheduling

    NARCIS (Netherlands)

    van Velzen, S.

    2005-01-01

    This thesis deals with various models of cooperation in networks and scheduling. The main focus is how the benefits of this cooperation should be divided among the participating individuals. A major part of this analysis is concerned with stability of the cooperation. In addition, allocation rules a

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

  15. BEE COLONIES APPLIED TO MULTIPROCESSOR SCHEDULING

    OpenAIRE

    Butt, Nouman

    2009-01-01

    In order to achieve the high performance, we need to have an efficient scheduling of a parallelprogram onto the processors in multiprocessor systems that minimizes the entire executiontime. This problem of multiprocessor scheduling can be stated as finding a schedule for ageneral task graph to be executed on a multiprocessor system so that the schedule length can be minimize [10]. This scheduling problem is known to be NP- Hard.In multi processor task scheduling, we have a number of CPU’s on ...

  16. Self-directed practice schedule enhances learning of suturing skills.

    Science.gov (United States)

    Safir, Oleg; Williams, Camille K; Dubrowski, Adam; Backstein, David; Carnahan, Heather

    2013-12-01

    Most preoperative surgical training programs experience challenges with the availability of expert surgeons to teach trainees. Some research suggests that trainees may benefit from being allowed to actively shape their learning environments, which could alleviate some of the time and resource pressures in surgical training. The purpose of this study was to investigate the effects of self-directed or prescribed practice schedules (random or blocked) on learning suturing skills. Participants watched an instructional video for simple interrupted, vertical mattress and horizontal mattress suturing then completed a pretest to assess baseline skills. Participants were assigned to 1 of 4 practice groups: self-directed practice schedule, prescribed blocked practice schedule, prescribed random practice schedule or matched to the self-directed group (control). Practice of the skill was followed by a delayed (1 h) posttest. Improvement from pretest to posttest was determined based on differences in performance time and expert-based assessments. Analyses revealed a significant effect of group for difference in performance time of the simple interrupted suture. Random practice did not show the expected advantage for skill learning, but there was an advantage of self-directed practice. Self-directed practice schedules may be desirable for optimal learning of simple technical skills, even when expert instruction is available. Instructors must also take into account the interaction between task difficulty and conditions of practice to develop ideal training environments.

  17. A Scheduling Problem for Hospital Operating Theatre

    CERN Document Server

    Sufahani, Suliadi F; Ismail, Zuhaimy

    2012-01-01

    This paper provides a classification of real scheduling problems. Various ways have been examined and described on the problem. Scheduling problem faces a tremendous challenges and difficulties in order to meet the preferences of the consumer. Dealing with scheduling problem is complicated, inefficient and time-consuming. This study aims to develop a mathematical model for scheduling the operating theatre during peak and off peak time. Scheduling problem is a well known optimization problem and the goal is to find the best possible optimal solution. In this paper, we used integer linear programming technique for scheduling problem in a high level of synthesis. In addition, time and resource constrained scheduling was used. An optimal result was fully obtained by using the software GLPK/AMPL. This model can be adopted to solve other scheduling problems, such as the Lecture Theatre, Cinemas and Work Shift.

  18. Immunization Schedules for Infants and Children

    Science.gov (United States)

    ... Everyone: Easy-to-read Schedules Infants and Children Preteens and Teens Adults Display Immunization Schedules and Quiz ... file Microsoft Word file Microsoft Excel file Audio/Video file Apple Quicktime file RealPlayer file Text file ...

  19. DME Prosthetics Orthotics, and Supplies Fee Schedule

    Data.gov (United States)

    U.S. Department of Health & Human Services — Durable Medical Equipment, Prosthetics-Orthotics, and Supplies Fee Schedule. The list contains the fee schedule amounts, floors, and ceilings for all procedure codes...

  20. GSA eLibrary Schedules and Contracts

    Data.gov (United States)

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

  1. CMS Planning and Scheduling System

    CERN Document Server

    Kotamaki, M

    1998-01-01

    The paper describes the procedures and the system to build and maintain the schedules needed to manage time, resources, and progress of the CMS project. The system is based on the decomposition of the project into work packages, which can be each considered as a complete project with its own structure. The system promotes the distribution of the decision making and responsibilities to lower levels in the organisation by providing a state-of-the-art system to formalise the external commitments of the work packages without limiting their ability to modify their internal schedules to best meet their commitments. The system lets the project management focus on the interfaces between the work packages and alerts the management immediately if a conflict arises. The proposed system simplifies the planning and management process and eliminates the need for a large, centralised project management system.

  2. LDRD Report: Scheduling Irregular Algorithms

    Energy Technology Data Exchange (ETDEWEB)

    Boman, Erik G. [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)

    2014-10-01

    This LDRD project was a campus exec fellowship to fund (in part) Donald Nguyen’s PhD research at UT-Austin. His work has focused on parallel programming models, and scheduling irregular algorithms on shared-memory systems using the Galois framework. Galois provides a simple but powerful way for users and applications to automatically obtain good parallel performance using certain supported data containers. The naïve user can write serial code, while advanced users can optimize performance by advanced features, such as specifying the scheduling policy. Galois was used to parallelize two sparse matrix reordering schemes: RCM and Sloan. Such reordering is important in high-performance computing to obtain better data locality and thus reduce run times.

  3. Dynamic Broadcast Scheduling in DDBMS

    Directory of Open Access Journals (Sweden)

    Babu Santhalingam,

    2011-01-01

    Full Text Available This system will address the problem of online scheduling sequential data objects with the principle of periodicity in the context of dynamic information dissemination. Many modern information applications spread dynamically generated data objects and answer the complex query for retrieving multiple data objects. In dynamic environments, data streams need to be online processed rather than being stored and later retrieved to answer queries. Particularly, data objects are produced dynamically by the information providers, interleaved and disseminated efficiently by the broadcasting servers, and associated sequentially in the client sides. The proposed algorithm with a well-specific gain measure function prominently outperforms the FIFO schedule and is able to minimize the mean service access time to the extent close to the theoretical optimum.

  4. Building Better Nurse Scheduling Algorithms

    CERN Document Server

    Aickelin, Uwe

    2008-01-01

    The aim of this research is twofold: Firstly, to model and solve a complex nurse scheduling problem with an integer programming formulation and evolutionary algorithms. Secondly, to detail a novel statistical method of comparing and hence building better scheduling algorithms by identifying successful algorithm modifications. The comparison method captures the results of algorithms in a single figure that can then be compared using traditional statistical techniques. Thus, the proposed method of comparing algorithms is an objective procedure designed to assist in the process of improving an algorithm. This is achieved even when some results are non-numeric or missing due to infeasibility. The final algorithm outperforms all previous evolutionary algorithms, which relied on human expertise for modification.

  5. HOW GOOD IS A DENSE SHOP SCHEDULE?

    Institute of Scientific and Technical Information of China (English)

    陈礴; 俞文(鱼此)

    2001-01-01

    In this paper, we study a class of simple and easy-to-construct shop schedules, known as dense schedules. We present tight bounds on the maximum deviation in makespan of dense flow-shop and job-shop schedules from their optimal ones. For dense open-shop schedules, we do the same for the special case of four machines and thus add a stronger supporting case for proving a standing conjecture.

  6. Scheduling Coast Guard District Cutters

    Science.gov (United States)

    1992-09-01

    DESCRIPTION ..... ............ .. 14 D. COSTS, PENALTIES, AND MEASURES OF EFFECTIVENESS 15 iv IV . COMPUTATIONAL EXPERIENCE ............ 19 A. TEST PROBLEMS...used. Using the model of Chapter III, computational performance for a year’s worth of actual data from the First District is presented in Chapter IV ...2G, B-2NY, B-2SAR, C); t - week the cutter assumes the patrol status. COSTO - cost of scheduling cutter i to patrol k; (1 if ship i is available for

  7. Environmental surveillance master sampling schedule

    Energy Technology Data Exchange (ETDEWEB)

    Bisping, L.E.

    1995-02-01

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

  8. Susceptibility of optimal train schedules to stochastic disturbances of process times

    DEFF Research Database (Denmark)

    Larsen, Rune; Pranzo, Marco; D’Ariano, Andrea;

    2013-01-01

    This work focuses on the stochastic evaluation of train schedules computed by a microscopic scheduler of railway operations based on deterministic information. The research question is to assess the degree of sensitivity of various rescheduling algorithms to variations in process times (running...... and dwell times). In fact, the objective of railway traffic management is to reduce delay propagation and to increase disturbance robustness of train schedules at a network scale. We present a quantitative study of traffic disturbances and their effects on the schedules computed by simple and advanced...

  9. The Willoughby Schedule: A Replication Utilizing Physical Education and Recreation Majors.

    Science.gov (United States)

    Crume, Charles T., Jr.

    1986-01-01

    Assessed the self-concept level of physical education and recreation students on the Willoughby Schedule. Compared with original Willoughby Schedule validation and Hestand, Howard and Gregory replication data, the study population of physical education and recreation students had significantly more positive self-concept scores. (Author/KS)

  10. The Effects of Varying Schedules of Incentive Delivery on Technical Training.

    Science.gov (United States)

    Pritchard, Robert D.; And Others

    The research reported here was initiated and designed to assess the impact of various schedules of incentive delivery (schedules of reinforcement) on performance and attitudes in an Air Force-related setting. Civilian subjects matching the characteristics of Air Force trainees were hired to work for four weeks, one week under each of four…

  11. 77 FR 43084 - Multiple Award Schedule (MAS) Program Continuous Open Season-Operational Change

    Science.gov (United States)

    2012-07-23

    ... ADMINISTRATION Multiple Award Schedule (MAS) Program Continuous Open Season- Operational Change AGENCY: Federal... to assess and improve the performance of the Multiple Award Schedule (MAS) contracts operated by GSA. GSA is proposing this operational change to enhance the performance of and modernize the MAS program...

  12. Guidelines of Decommissioning Schedule Establishment

    Energy Technology Data Exchange (ETDEWEB)

    Oh, Jae Yong; Yun, Taesik; Kim, Younggook; Kim, Hee-Geun [KHNP CRI, Daejeon (Korea, Republic of)

    2016-10-15

    Decommissioning has recently become an issue highlighted in Korea due to the Permanent Shutdown (PS) of Kori-1 plant. Since Korea Hydro and Nuclear Power (KHNP) Company decided the PS of Kori-1 instead of further continued operation, Kori-1 will be the first decommissioning plant of the commercial reactors in Korea. Korean regulatory authority demands Initial Decommissioning Plan (IDP) for all the plants in operation and under construction. In addition, decommissioning should be considered for the completion of the life cycle of NPPs. To date, Korea has no experience regarding decommissioning of the commercial reactor and a lot of uncertainties will be expected due to its site-specific factors. However, optimized decommissioning process schedule must be indispensable in the safety and economic efficiency of the project. Differed from USA, Korea has no experience and know-hows of the operation and site management for decommissioning. Hence, in Korea, establishment of decommissioning schedule has to give more weight to safety than precedent cases. More economical and rational schedule will be composed by collecting and analyzing the experience data and site-specific data and information as the decommissioning progresses. In a long-range outlook, KHNP having capability of NPP decommissioning will try to decommissioning business in Korea and foreign countries.

  13. Comparing the content of participation instruments using the International Classification of Functioning, Disability and Health

    Directory of Open Access Journals (Sweden)

    Singer Joel

    2009-11-01

    Full Text Available Abstract Background The concept of participation is recognized as an important rehabilitation outcome and instruments have been developed to measure participation using the International Classification of Functioning, Disability and Health (ICF. To date, few studies have examined the content of these instruments to determine how participation has been operationalized. The purpose of this study was to compare the content of participation instruments using the ICF classification. Methods A systematic literature search was conducted to identify instruments that assess participation according to the ICF. Instruments were considered to assess participation and were included if the domains contain content from a minimum of three ICF chapters ranging from Chapter 3 Communication to Chapter 9 Community, social and civic life in the activities and participation component. The instrument content was examined by first identifying the meaningful concepts in each question and then linking these concepts to ICF categories. The content analysis included reporting the 1 ICF chapters (domains covered in the activities and participation component, 2 relevance of the meaningful concepts to the activities and participation component and 3 context in which the activities and participation component categories are evaluated. Results Eight instruments were included: Impact on Participation and Autonomy, Keele Assessment of Participation, Participation Survey/Mobility, Participation Measure-Post Acute Care, Participation Objective Participation Subjective, Participation Scale (P-Scale, Rating of Perceived Participation and World Health Organization Disability Assessment Schedule II (WHODAS II. 1351 meaningful concepts were identified in the eight instruments. There are differences among the instruments regarding how participation is operationalized. All the instruments cover six to eight of the nine chapters in the activities and participation component. The P

  14. 19 CFR 122.63 - Scheduled airlines.

    Science.gov (United States)

    2010-04-01

    ... 19 Customs Duties 1 2010-04-01 2010-04-01 false Scheduled airlines. 122.63 Section 122.63 Customs... AIR COMMERCE REGULATIONS Clearance of Aircraft and Permission To Depart § 122.63 Scheduled airlines... scheduled airlines covered by this subpart. (a) Clearance at other than airport of final departure. Aircraft...

  15. Response Strength in Extreme Multiple Schedules

    Science.gov (United States)

    McLean, Anthony P.; Grace, Randolph C.; Nevin, John A.

    2012-01-01

    Four pigeons were trained in a series of two-component multiple schedules. Reinforcers were scheduled with random-interval schedules. The ratio of arranged reinforcer rates in the two components was varied over 4 log units, a much wider range than previously studied. When performance appeared stable, prefeeding tests were conducted to assess…

  16. Models and algorithms for stochastic online scheduling

    NARCIS (Netherlands)

    Megow, N.; Uetz, Marc Jochen; Vredeveld, T.

    We consider a model for scheduling under uncertainty. In this model, we combine the main characteristics of online and stochastic scheduling in a simple and natural way. Job processing times are assumed to be stochastic, but in contrast to traditional stochastic scheduling models, we assume that

  17. 77 FR 41258 - FOIA Fee Schedule Update

    Science.gov (United States)

    2012-07-13

    ... SAFETY BOARD 10 CFR Part 1703 FOIA Fee Schedule Update AGENCY: Defense Nuclear Facilities Safety Board... publishing its Freedom of Information Act (FOIA) Fee Schedule Update pursuant to the Board's regulations..., the Board's General Manager will update the FOIA Fee Schedule once every 12 months. The previous...

  18. Optimization of Daily Flight Training Schedules

    Science.gov (United States)

    2014-03-01

    training syllabus . 14. SUBJECT TERMS Scheduling, optimization, flight training, Advance Strike Training, pilot 15. NUMBER OF...SKEDSOs that can help them increase throughput of students in the advanced strike training syllabus . vi THIS PAGE INTENTIONALLY LEFT BLANK vii...instructor pilots with student naval aviators to achieve syllabus events. The schedule is built manually each day by squadron scheduling officers (SKEDSOs

  19. Centralized scheduling an unanticipated revenue cycle opportunity.

    Science.gov (United States)

    O'Neill, Daniel P; Kenniff, Peter B

    2007-09-01

    Centralized outpatient scheduling can provide acute care hospitals with accessibility and service levels equal to freestanding facilities, enabling hospitals to recapture lost market share. Two implementation strategies are critical to the success of centralized scheduling: Correctly developing the schedule. Managing the incoming call volume.

  20. An improved scheduling algorithm for linear networks

    KAUST Repository

    Bader, Ahmed

    2017-02-09

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

  1. Response Strength in Extreme Multiple Schedules

    Science.gov (United States)

    McLean, Anthony P.; Grace, Randolph C.; Nevin, John A.

    2012-01-01

    Four pigeons were trained in a series of two-component multiple schedules. Reinforcers were scheduled with random-interval schedules. The ratio of arranged reinforcer rates in the two components was varied over 4 log units, a much wider range than previously studied. When performance appeared stable, prefeeding tests were conducted to assess…

  2. AUTOMATING SELECTION OF OPTIMAL PACKET SCHEDULING DURING VOIP-TRAFFIC TRANSMISSION

    Directory of Open Access Journals (Sweden)

    Yuliya A. Balakshina

    2016-11-01

    Full Text Available The usage of various packet scheduling disciplines in computer networking devices as a mechanism to ensure the quality of service is described. Stages for selection of necessary parameters values of packet scheduling during VoIP-traffic transmission in computer networks are defined. VoIP-traffic was set as a research object because there are strict requirements of VoIP-applications to the network transmission parameters. With the aid of training and experimental simulation system the numerous experiments for parameters selection of the most common packet scheduling disciplines were carried out (FIFO, WFQ, non-preemptive priority queueing. The example that illustrates the ability to adjust the weighting coefficients of WFQ packet scheduling discipline is presented. Approximate analytical dependences are obtained and they will significantly reduce system administrators’ efforts to assess and modify the parameters of packet scheduling in network devices. A method of automating selection of the optimal packet scheduling discipline is formulated.

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

  4. Rate-optimal scheduling of recursive DSP algorithms based on the scheduling-range chart

    NARCIS (Netherlands)

    Heemstra de Groot, Sonia M.; Herrmann, Otto E.

    1990-01-01

    A method for rate-optimal scheduling of recursive DSP algorithms is presented. The approach is based on the determination of the scheduling window of each operation and the construction of a scheduling-range chart. The information in the chart is used during scheduling to optimize some quality crite

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

  6. Bayesian Optimisation Algorithm for Nurse Scheduling

    CERN Document Server

    Li, Jingpeng

    2008-01-01

    Our research has shown that schedules can be built mimicking a human scheduler by using a set of rules that involve domain knowledge. This chapter presents a Bayesian Optimization Algorithm (BOA) for the nurse scheduling problem that chooses such suitable scheduling rules from a set for each nurses assignment. Based on the idea of using probabilistic models, the BOA builds a Bayesian network for the set of promising solutions and samples these networks to generate new candidate solutions. Computational results from 52 real data instances demonstrate the success of this approach. It is also suggested that the learning mechanism in the proposed algorithm may be suitable for other scheduling problems.

  7. MOV reliability evaluation and periodic verification scheduling

    Energy Technology Data Exchange (ETDEWEB)

    Bunte, B.D.

    1996-12-01

    The purpose of this paper is to establish a periodic verification testing schedule based on the expected long term reliability of gate or globe motor operated valves (MOVs). The methodology in this position paper determines the nominal (best estimate) design margin for any MOV based on the best available information pertaining to the MOVs design requirements, design parameters, existing hardware design, and present setup. The uncertainty in this margin is then determined using statistical means. By comparing the nominal margin to the uncertainty, the reliability of the MOV is estimated. The methodology is appropriate for evaluating the reliability of MOVs in the GL 89-10 program. It may be used following periodic testing to evaluate and trend MOV performance and reliability. It may also be used to evaluate the impact of proposed modifications and maintenance activities such as packing adjustments. In addition, it may be used to assess the impact of new information of a generic nature which impacts safety related MOVs.

  8. Flowering schedule in a perennial plant

    DEFF Research Database (Denmark)

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

    2015-01-01

    Optimal timing of reproduction within a season may be influenced by several abiotic and biotic factors. These factors sometimes affect different components of fitness, making assessments of net selection difficult. We used estimates of offspring fitness to examine how pre-dispersal seed predation...... influences selection on flowering schedule in an herb with a bimodal flowering pattern, Actaea spicata. Within individuals, seeds from flowers on early terminal inflorescences had a higher germination rate and produced larger seedlings than seeds from flowers on late basal inflorescences. Reproductive value......, estimated using demographic integral projection models and accounting for size-dependent differences in future performance, was two times higher for intact seeds from early flowers than for seeds from late flowers. Fruits from late flowers were, however, much more likely to escape seed predation than fruits...

  9. Simplified Scheduling for Underwater Acoustic Networks

    Directory of Open Access Journals (Sweden)

    Wouter van Kleunen

    2013-01-01

    Full Text Available The acoustic propagation speed under water poses significant challenges to the design of underwater sensor networks and their medium access control protocols. Similar to the air, scheduling transmissions under water has significant impact on throughput, energy consumption, and reliability. In this paper we present an extended set of simplified scheduling constraints which allows easy scheduling of underwater acoustic communication. We also present two algorithms for scheduling communications, i.e. a centralized scheduling approach and a distributed scheduling approach. The centralized approach achieves the highest throughput while the distributed approach aims to minimize the computation and communication overhead. We further show how the centralized scheduling approach can be extended with transmission dependencies to reduce the end-to-end delay of packets. We evaluate the performance of the centralized and distributed scheduling approaches using simulation. The centralized approach outperforms the distributed approach in terms of throughput, however we also show the distributed approach has significant benefits in terms of communication and computational overhead required to setup the schedule. We propose a novel way of estimating the performance of scheduling approaches using the ratio of modulation time and propagation delay. We show the performance is largely dictated by this ratio, although the number of links to be scheduled also has a minor impact on the performance.

  10. Reactive Scheduling in Multipurpose Batch Plants

    Science.gov (United States)

    Narayani, A.; Shaik, Munawar A.

    2010-10-01

    Scheduling is an important operation in process industries for improving resource utilization resulting in direct economic benefits. It has a two-fold objective of fulfilling customer orders within the specified time as well as maximizing the plant profit. Unexpected disturbances such as machine breakdown, arrival of rush orders and cancellation of orders affect the schedule of the plant. Reactive scheduling is generation of a new schedule which has minimum deviation from the original schedule in spite of the occurrence of unexpected events in the plant operation. Recently, Shaik & Floudas (2009) proposed a novel unified model for short-term scheduling of multipurpose batch plants using unit-specific event-based continuous time representation. In this paper, we extend the model of Shaik & Floudas (2009) to handle reactive scheduling.

  11. Routine environmental monitoring schedule, calendar year 1995

    Energy Technology Data Exchange (ETDEWEB)

    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.

  12. Robust and Flexible Scheduling with Evolutionary Computation

    DEFF Research Database (Denmark)

    Jensen, Mikkel T.

    (schedules expected to perform well after some degree of modification when the environment changes). This thesis presents two fundamentally different approaches for scheduling job shops facing machine breakdowns. The first method is called neighbourhood based robustness and is based on an idea of minimising...... 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...... suboptimal when it is implemented and subjected to the uncertainty of the real world. For this reason it is very important to find methods capable of creating robust schedules (schedules expected to perform well after a minimal amount of modification when the environment changes) or flexible schedules...

  13. Prevalence of depression and its effect on disability in patients with age-related macular degeneration

    Directory of Open Access Journals (Sweden)

    Banerjee Anindya

    2008-01-01

    Full Text Available Aims: To estimate depression in patients with age-related macular degeneration (AMD and study the relationships among depression, visual acuity, and disability. Materials and Methods: It was a cross-sectional study with consecutive sampling (n = 53 of patients with AMD aged 50 years and above attending the retina clinic of a tertiary care hospital in North India. Depression, general disability and vision-specific disability were assessed in subjects meeting selection criteria. Assessments were done using the fourth edition of Diagnostic and Statistical Manual of mental disorders (DSM- IV Geriatric Depression Scale (GDS, Structured Clinical Interview for DSM-IV Axis -I Disorders, Clinical Version (SCID-CV, World Health Organization Disability Assessment Schedule-II (WHODAS-II and Daily Living Tasks dependent on Vision scale (DLTV. Non-parametric correlation analyses and regression analyses were performed. Results: Out of 53 participants, 26.4% (n = 14 met DSM-IV criteria for the diagnosis of depressive disorder. Depressed patients had significantly greater levels of general and vision-specific disability than non-depressed patients. General disability was predicted better by depression and vision-specific disability than by visual acuity. Conclusion: Depression is a major concern in patients with AMD and contributes more to disability than visual impairment.

  14. The Vessel Schedule Recovery Problem

    DEFF Research Database (Denmark)

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

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

  15. Scheduling of an aircraft fleet

    Science.gov (United States)

    Paltrinieri, Massimo; Momigliano, Alberto; Torquati, Franco

    1992-01-01

    Scheduling is the task of assigning resources to operations. When the resources are mobile vehicles, they describe routes through the served stations. To emphasize such aspect, this problem is usually referred to as the routing problem. In particular, if vehicles are aircraft and stations are airports, the problem is known as aircraft routing. This paper describes the solution to such a problem developed in OMAR (Operative Management of Aircraft Routing), a system implemented by Bull HN for Alitalia. In our approach, aircraft routing is viewed as a Constraint Satisfaction Problem. The solving strategy combines network consistency and tree search techniques.

  16. Effect of unsignaled delays between stimuli in a chain schedule on responding and resistance to change.

    Science.gov (United States)

    Bell, Matthew C; Gomez, Belen E

    2008-03-01

    Behavioral momentum theory is an evolving theoretical account of the strength of behavior. One challenge for the theory is determining the role of signal stimuli in determining response strength. This study evaluated the effect of an unsignaled delay between the initial link and terminal link of a two-link chain schedule on resistance to change using a multiple schedule of reinforcement. Pigeons were presented two different signaled delay to reinforcement schedules. Both schedules employed a two-link chain schedule with a variable interval 120-s initial link followed by a 5-s fixed time terminal link schedule. One of the schedules included a 5-s unsignaled delay between the initial link and the terminal link. Resistance to change was assessed with two separate disruption procedures: extinction and adding a variable time 20-s schedule of reinforcement to the inter-component interval. Baseline responding was lower in the schedule with the unsignaled delay but resistance to change for the initial link was unaffected by the unsignaled delay. The results suggest that not all unsignaled delays are equal in their effect on resistance to change.

  17. Environmental surveillance master sampling schedule

    Energy Technology Data Exchange (ETDEWEB)

    Bisping, L.E.

    1994-02-01

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

  18. An Improved Algorithm for Reliability Assessment of Distribution Network Considering Complex Load Transfer and Scheduled Outage%考虑复杂转供和预安排停电的配电网可靠性评估

    Institute of Scientific and Technical Information of China (English)

    邱生敏; 王浩浩; 管霖

    2011-01-01

    A method to simplify distribution network and classify nodes is proposed to reduce calculation burden.Considering capacity constraint, the method to judge whether power load can be transferred via tie-line after the fault is researched and a method to calculate the reliability index based on the judgment of transferring is proposed. The influence of scheduled outage on reliability of distribution network is analyzed and a method to calculate the reliability index of distribution network under scheduled outage is given. The total reliability index of distribution network is the very summation of above-mentioned two calculated reliability indices. Results of calculation example show that the proposed method is feasible.%为减少计算量,提出了配电网网络简化及节点分类方法.在考虑容量约束的情况下,分析了故障后判断负荷能否通过联络线实现转供的方法,提出了基于转供判断的配电网可靠性指标计算方法.分析了预安排停电对配电网可靠性的影响,提出了预安排停电情况下的配电网可靠性指标计算方法.将以上2部分可靠性指标相加可得配电网总的可靠性指标.算例结果验证了该方法的可行性.

  19. Perceptions of quality of life and disability in homeless persons with schizophrenia and persons with schizophrenia living in non-institutional housing.

    Science.gov (United States)

    van der Plas, A G M; Hoek, H W; van Hoeken, D; Valencia, E; van Hemert, A M

    2012-11-01

    Homelessness is common in persons with schizophrenia. It is unclear how housing conditions and homelessness affect their quality of life and their disability. To explore the self-perceived quality of life and disability of homeless persons with schizophrenia and of those of persons with schizophrenia living in non-institutional housing. Seventy-six not-homeless and 50 homeless persons with schizophrenia were assessed using the World Health Organization's Quality of Life - short version (WHOQOL-Bref) and Disability Assessment Schedule (WHODAS-II). Univariate comparisons of the two groups were made for sociodemographic variables, clinical characteristics, perceived quality of life and disability. A regression model was used to adjust for potential confounding factors between quality of life, disability and housing. After controlling for age, gender, marital status and age of first hospital admission, homeless persons had more positive scores for the quality of life domain 'health', for the disability domain 'getting along with people' and for the total disability score than persons in non-institutional housing. Contrary to our expectations, the persons in non-institutional housing reported a lower quality of life and more disability than the homeless people. Future research should clarify whether non-institutional housing in and of itself can improve the well-being of people with schizophrenia.

  20. BIM-BASED SCHEDULING OF CONSTRUCTION

    DEFF Research Database (Denmark)

    Andersson, Niclas; Büchmann-Slorup, Rolf

    2010-01-01

    overlap of the design and construction processes. Consequently, the overall scheduling is primarily based on intuition and personal experiences, rather than well founded figures of the specific project. Finally, the overall schedule is comprehensive and complex, and consequently, difficult to overview......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...

  1. Minimally disruptive schedule repair for MCM missions

    Science.gov (United States)

    Molineaux, Matthew; Auslander, Bryan; Moore, Philip G.; Gupta, Kalyan M.

    2015-05-01

    Mine countermeasures (MCM) missions entail planning and operations in very dynamic and uncertain operating environments, which pose considerable risk to personnel and equipment. Frequent schedule repairs are needed that consider the latest operating conditions to keep mission on target. Presently no decision support tools are available for the challenging task of MCM mission rescheduling. To address this capability gap, we have developed the CARPE system to assist operation planners. CARPE constantly monitors the operational environment for changes and recommends alternative repaired schedules in response. It includes a novel schedule repair algorithm called Case-Based Local Schedule Repair (CLOSR) that automatically repairs broken schedules while satisfying the requirement of minimal operational disruption. It uses a case-based approach to represent repair strategies and apply them to new situations. Evaluation of CLOSR on simulated MCM operations demonstrates the effectiveness of case-based strategy. Schedule repairs are generated rapidly, ensure the elimination of all mines, and achieve required levels of clearance.

  2. PRACTICAL IMPLICATIONS OF LOCATION-BASED SCHEDULING

    DEFF Research Database (Denmark)

    Andersson, Niclas; Christensen, Knud

    2007-01-01

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

  3. Greedy Maximal Scheduling in Wireless Networks

    CERN Document Server

    Li, Qiao

    2010-01-01

    In this paper we consider greedy scheduling algorithms in wireless networks, i.e., the schedules are computed by adding links greedily based on some priority vector. Two special cases are considered: 1) Longest Queue First (LQF) scheduling, where the priorities are computed using queue lengths, and 2) Static Priority (SP) scheduling, where the priorities are pre-assigned. We first propose a closed-form lower bound stability region for LQF scheduling, and discuss the tightness result in some scenarios. We then propose an lower bound stability region for SP scheduling with multiple priority vectors, as well as a heuristic priority assignment algorithm, which is related to the well-known Expectation-Maximization (EM) algorithm. The performance gain of the proposed heuristic algorithm is finally confirmed by simulations.

  4. 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...... overlap of the design and construction processes. Consequently, the overall scheduling is primarily based on intuition and personal experiences, rather than well founded figures of the specific project. Finally, the overall schedule is comprehensive and complex, and consequently, difficult to overview...... 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...

  5. Fair Scheduling in Networks Through Packet Election

    CERN Document Server

    Jagabathula, Srikanth

    2008-01-01

    We consider the problem of designing a fair scheduling algorithm for discrete-time constrained queuing networks. Each queue has dedicated exogenous packet arrivals. There are constraints on which queues can be served simultaneously. This model effectively describes important special instances like network switches, interference in wireless networks, bandwidth sharing for congestion control and traffic scheduling in road roundabouts. Fair scheduling is required because it provides isolation to different traffic flows; isolation makes the system more robust and enables providing quality of service. Existing work on fairness for constrained networks concentrates on flow based fairness. As a main result, we describe a notion of packet based fairness by establishing an analogy with the ranked election problem: packets are voters, schedules are candidates and each packet ranks the schedules based on its priorities. We then obtain a scheduling algorithm that achieves the described notion of fairness by drawing upon ...

  6. Two-Dimensional Scheduling: A Review

    Directory of Open Access Journals (Sweden)

    Zhuolei Xiao

    2013-07-01

    Full Text Available In this study, we present a literature review, classification schemes and analysis of methodology for scheduling problems on Batch Processing machine (BP with both processing time and job size constraints which is also regarded as Two-Dimensional (TD scheduling. Special attention is given to scheduling problems with non-identical job sizes and processing times, with details of the basic algorithms and other significant results.

  7. Spent nuclear fuel project integrated schedule plan

    Energy Technology Data Exchange (ETDEWEB)

    Squires, K.G.

    1995-03-06

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

  8. Scheduling and routing Tactical Aerial Reconnaissance Vehicles

    OpenAIRE

    1990-01-01

    Approved for public release; distribution unlimited. In this thesis we study the Marine Corps Tactical Aerial Reconnaissance Vehicle routing and scheduling problem. the present method of routing and scheduling is presented, along with possible implications for routing and scheduling when future expansion of vehicle assets becomes available. A review of current literature is given and comparisons are drawn between our problem and recent work. A model for the problem, which we call the Multi...

  9. Spent nuclear fuel project integrated schedule plan

    Energy Technology Data Exchange (ETDEWEB)

    Squires, K.G.

    1995-03-06

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

  10. Network-Aware HEFT Scheduling for Grid

    Directory of Open Access Journals (Sweden)

    Muhammad Murtaza Yousaf

    2014-01-01

    Full Text Available We present a network-aware HEFT. The original HEFT does not take care of parallel network flows while designing its schedule for a computational environment where computing nodes are physically at distant locations. In the proposed mechanism, such data transfers are stretched to their realistic completion time. A HEFT schedule with stretched data transfers exhibits the realistic makespan of the schedule. It is shown how misleading a schedule can be if the impact of parallel data transfers that share a bottleneck is ignored. A network-aware HEFT can be used to yield a benefit for Grid applications.

  11. GRID SCHEDULING USING ENHANCED ANT COLONY ALGORITHM

    Directory of Open Access Journals (Sweden)

    P. Mathiyalagan

    2010-10-01

    Full Text Available Grid computing is a high performance computing used to solve larger scale computational demands. Task scheduling is a major issue in grid computing systems. Scheduling of tasks is the NP hard problem. The heuristic approach provides optimal solution for NP hard problems .The ant colony algorithm provides optimal solution. The existing ant colony algorithm takes more time to schedule the tasks. In this paper ant colony algorithm improved by enhancing pheromone updating rule such that it schedules the tasks efficiently and better resource utilization. The simulation results prove that proposed method reduces the execution time of tasks compared to existing ant colony algorithm.

  12. 15 CFR 700.14 - Preferential scheduling.

    Science.gov (United States)

    2010-01-01

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

  13. Scheduling By Using Fuzzy Logic in Manufacturing

    Directory of Open Access Journals (Sweden)

    Miss. Ashwini. A. Mate

    2014-07-01

    Full Text Available This paper represents the scheduling process in furniture manufacturing unit. It gives the fuzzy logic application in flexible manufacturing system. Flexible manufacturing systems are production system in furniture manufacturing unit. FMS consist of same multipurpose numerically controlled machines. Here in this project the scheduling has been done in FMS by using fuzzy logic tool in Matlab software. The fuzzy logic based scheduling model in this paper will deals with the job and best alternative route selection with multi-criteria of machine. Here two criteria for job and sequencing and routing with rules. This model is applicable to the scheduling of any manufacturing industry.

  14. Flexible Personnel Scheduling in the Parallel Environment

    Institute of Scientific and Technical Information of China (English)

    XU Ben-zhu; ZHANG Xing-ling

    2014-01-01

    In the view of staff shortages and the huge inventory of products in the current market, we put forward a personnel scheduling model in the target of closing to the delivery date considering the parallelism. Then we designed a scheduling algorithm based on genetic algorithm and proposed a flexible parallel decoding method which take full use of the personal capacity. Case study results indicate that the flexible personnel scheduling considering the order-shop scheduling, machine automatic capabilities and personnel flexible in the target of closing to the delivery date optimize the allocation of human resources, then maximize the efficiency.

  15. CASSIUS: The Cassini Uplink Scheduler

    Science.gov (United States)

    Bellinger, Earl

    2012-01-01

    The Cassini Uplink Scheduler (CASSIUS) is cross-platform software used to generate a radiation sequence plan for commands being sent to the Cassini spacecraft. Because signals must travel through varying amounts of Earth's atmosphere, several different modes of constant telemetry rates have been devised. These modes guarantee that the spacecraft and the Deep Space Network agree with respect to the data transmission rate. However, the memory readout of a command will be lost if it occurs on a telemetry mode boundary. Given a list of spacecraft message files as well as the available telemetry modes, CASSIUS can find an uplink sequence that ensures safe transmission of each file. In addition, it can predict when the two on-board solid state recorders will swap. CASSIUS prevents data corruption by making sure that commands are not planned for memory readout during telemetry rate changes or a solid state recorder swap.

  16. Turn your fee schedule into a valuable management tool.

    Science.gov (United States)

    Joyce, Michael C

    2003-01-01

    This article describes a method of performing a fee schedule analysis that will give you some important management information and tools. By using the methodology described in this article to set your fees, you will confirm that your fees are sufficient, assess your cash flow position, determine the approximate value of your accounts receivable, and estimate the collectible amounts of any new services being considered.

  17. Dosing Schedules for Pneumococcal Conjugate Vaccine

    Science.gov (United States)

    2014-01-01

    Since second generation pneumococcal conjugate vaccines (PCVs) targeting 10 and 13 serotypes became available in 2010, the number of national policy makers considering these vaccines has steadily increased. An important consideration for a national immunization program is the timing and number of doses—the schedule—that will best prevent disease in the population. Data on disease epidemiology and the efficacy or effectiveness of PCV schedules are typically considered when choosing a schedule. Practical concerns, such as the existing vaccine schedule, and vaccine program performance are also important. In low-income countries, pneumococcal disease and deaths typically peak well before the end of the first year of life, making a schedule that provides PCV doses early in life (eg, a 6-, 10- and 14-week schedule) potentially the best option. In other settings, a schedule including a booster dose may address disease that peaks in the second year of life or may be seen to enhance a schedule already in place. A large and growing body of evidence from immunogenicity studies, as well as clinical trials and observational studies of carriage, pneumonia and invasive disease, has been systematically reviewed; these data indicate that schedules of 3 or 4 doses all work well, and that the differences between these regimens are subtle, especially in a mature program in which coverage is high and indirect (herd) effects help enhance protection provided directly by a vaccine schedule. The recent World Health Organization policy statement on PCVs endorsed a schedule of 3 primary doses without a booster or, as a new alternative, 2 primary doses with a booster dose. While 1 schedule may be preferred in a particular setting based on local epidemiology or practical considerations, achieving high coverage with 3 doses is likely more important than the specific timing of doses. PMID:24336059

  18. 75 FR 66195 - Schedules of Controlled Substances: Placement of Propofol Into Schedule IV

    Science.gov (United States)

    2010-10-27

    ... Propofol Into Schedule IV; Proposed Rule #0;#0;Federal Register / Vol. 75, No. 207 / Wednesday, October 27... Schedules of Controlled Substances: Placement of Propofol Into Schedule IV AGENCY: Drug Enforcement... propofol, including its salts, isomers, and salts of isomers whenever the existence of such salts, isomers...

  19. 37 CFR 2.85 - Classification schedules.

    Science.gov (United States)

    2010-07-01

    ... 37 Patents, Trademarks, and Copyrights 1 2010-07-01 2010-07-01 false Classification schedules. 2..., DEPARTMENT OF COMMERCE RULES OF PRACTICE IN TRADEMARK CASES Classification § 2.85 Classification schedules. (a) International classification system. Section 6.1 of this chapter sets forth the...

  20. 10 CFR 51.15 - Time schedules.

    Science.gov (United States)

    2010-01-01

    ... REGULATORY FUNCTIONS National Environmental Policy Act-Regulations Implementing Section 102(2) § 51.15 Time... 10 Energy 2 2010-01-01 2010-01-01 false Time schedules. 51.15 Section 51.15 Energy NUCLEAR... NEPA review in accordance with any time schedule established under this section. (b) As specified in...

  1. Robust scheduling in an uncertain environment

    NARCIS (Netherlands)

    Wilson, M.

    2016-01-01

    This thesis presents research on scheduling in an uncertain environment, which forms a part of the rolling stock life cycle logistics applied research and development program funded by Dutch railway industry companies. The focus therefore lies on scheduling of maintenance operations on rolling stock

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

    NARCIS (Netherlands)

    L.G. Kroon (Leo); M. Fischetti (Matteo)

    2000-01-01

    textabstract: In this paper we describe the use of a set covering model with additional constraints for scheduling train drivers and conductors for the Dutch railway operator NS Reizigers. The schedules were generated according to new rules originating from the project "Destination: Customer"

  3. Improved MLWDF scheduler for LTE downlink transmission

    Science.gov (United States)

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

    2016-11-01

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

  4. On green routing and scheduling problem

    CERN Document Server

    Touati, Nora

    2012-01-01

    The vehicle routing and scheduling problem has been studied with much interest within the last four decades. In this paper, some of the existing literature dealing with routing and scheduling problems with environmental issues is reviewed, and a description is provided of the problems that have been investigated and how they are treated using combinatorial optimization tools.

  5. On green routing and scheduling problem

    OpenAIRE

    Touati, Nora; Jost, Vincent

    2011-01-01

    The vehicle routing and scheduling problem has been studied with much interest within the last four decades. In this paper, some of the existing literature dealing with routing and scheduling problems with environmental issues is reviewed, and a description is provided of the problems that have been investigated and how they are treated using combinatorial optimization tools.

  6. 5 CFR 293.511 - Retention schedule.

    Science.gov (United States)

    2010-01-01

    ... RECORDS Employee Medical File System Records § 293.511 Retention schedule. (a) Temporary EMFS records must... accordance with General Records Schedule (GRS) 1, item 21, issued by the National Archives and Records Administration (NARA). (b) Occupational Medical Records considered to be long-term records must be maintained...

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

  8. Downlink Scheduling in Long Term Evolution

    Directory of Open Access Journals (Sweden)

    Anwar Hossain

    2015-06-01

    Full Text Available This is an investigated research article on resource block scheduling of Long Term Evolution (LTE. LTE is one of the evolutions of the Universal Mobile Telecommunication System (UMTS. It provides internet access to mobile users through smart phone, laptop and other android devices. LTE offers a high speed data and multimedia services. It supports data rates up to 100 Mbps in the downlink and 50 Mbps in the uplink transmission. Our research investigation was aim to the downlink scheduling. We have considered The Best CQI scheduling algorithm and the Round Robin scheduling algorithm. The implementation, analysis and comparison of these scheduling algorithms have been performed through MATLAB simulator. We have analyzed the impact of the scheduling schemes on the throughput and the fairness of both scheduling schemes. Here we have proposed a new scheduling algorithm that achieves a compromise between the throughput and the fairness. Orthogonal Frequency Division Multiplexing (OFDM has been adopted as the downlink transmission scheme. We have considered the impact of the channel delay on the throughput. In addition, MIMO transceiver systems have been implemented to increase the throughput

  9. Scheduling in high performance buffered crossbar switches

    NARCIS (Netherlands)

    Mhamdi, L.

    2007-01-01

    High performance routers are the basic building blocks of the Internet. Most high performance routers built today use crossbars and a centralized scheduler. Due to their high scheduling complexity, crossbar-based routers are not scalable and cannot keep pace with the explosive growth of the Internet

  10. Scheduling parameters in flexible manufacturing cells

    NARCIS (Netherlands)

    Slomp, J.; Gaalman, G.J.C.; Ahmad, M.M.; Sullivan, W.G.; Migliore, H.; Randhawa, S.

    1998-01-01

    The existence of a well-designed scheduling procedure is a major condition for an effective integration of a flexible manufacturing cell (FMC) in the material flow of a firm. This paper shows the presence and relative importance of three parameter types in the scheduling of operations on a flexible

  11. Scheduling parameters in flexible manufacturing cells

    NARCIS (Netherlands)

    Slomp, J.; Gaalman, G.J.C.; Ahmad, M.M.; Sullivan, W.G.; Migliore, H.; Randhawa, S.

    1998-01-01

    The existence of a well-designed scheduling procedure is a major condition for an effective integration of a flexible manufacturing cell (FMC) in the material flow of a firm. This paper shows the presence and relative importance of three parameter types in the scheduling of operations on a flexible

  12. Schedule-extended synchronous dataflow graphs

    NARCIS (Netherlands)

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

    2013-01-01

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

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

  14. A question of matching rather than scheduling

    NARCIS (Netherlands)

    van de Velde, S.L.

    1995-01-01

    Proper scheduling maintenance for Air Force C-130 aircraft involves the prevention of mismatches concerning the availability of the aircraft and a new wing kit which would prolong its use. Scheduling maintenance problems include the designation of wing kits in the production sequence to match for a

  15. Unrelated Machine Scheduling with Stochastic Processing Times

    NARCIS (Netherlands)

    Skutella, Martin; Sviridenko, Maxim; Uetz, Marc

    2016-01-01

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

  16. Unrelated Machine Scheduling with Stochastic Processing Times

    NARCIS (Netherlands)

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

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

  17. Machine scheduling with resource dependent processing times

    NARCIS (Netherlands)

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

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

  18. Dishabituation Produces Interactions during Multiple Schedules

    Science.gov (United States)

    McSweeney, Frances K.; Kowal, Benjamin P.; Murphy, Eric S.; Isava, Duane M.

    2004-01-01

    McSweeney and Weatherly (1998) argued that differential habituation to the reinforcer contributes to the behavioral interactions observed during multiple schedules. The present experiment confirmed that introducing dishabituators into one component of a multiple schedule increases response rate in the other, constant, component. During baseline,…

  19. Scheduling identical jobs on uniform parallel machines

    NARCIS (Netherlands)

    M. Dessouky (Mohamed); B. Lageweg (Ben); J.K. Lenstra; S.L. van de Velde (Steef)

    1990-01-01

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

  20. Agent-based scheduling for aircraft deicing

    NARCIS (Netherlands)

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

    2006-01-01

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

  1. Scheduling Algorithm for Complex Product Development

    Institute of Scientific and Technical Information of China (English)

    LIUMin; ZHANGLong; WUCheng

    2004-01-01

    This paper describes the Complex product development project scheduling problem (CPDPSP) with a great number of activities, complicated resource, precedence and calendar constraints. By the conversion of precedence constraint relations, the CPDPSP is simplified. Then, according to the predictive control principle, we propose a new scheduling algorithm Based on prediction (BoP-procedure). In order to get the problem characteristics coming from resource status and precedence constraints of the scheduling problem at the scheduling time, a sub-project is constructed on the basis of a sub-AoN (Activity on node) graph of the project. Then, we use the modified GDH-procedure to solve the sub-project scheduling problem and to obtain the maximum feasible active subset for determining the activity group which satisfies resource, precedence and calendar constraints and has the highest scheduling priority at the scheduling time. Additionaily, we make a great number of numerical computations and compare the performance of BoP-procedure algorithm with those of other scheduling algorithms. Computation results show that the BoP-procedure algorithm is more suitable for the CPDPSP. At last, we discuss briefly future research work in the CPDPSP.

  2. NEW NONSTANDARD JOB SHOP SCHEDULING ALGORITHM

    Institute of Scientific and Technical Information of China (English)

    XIE Zhiqiang; YE Guangjie; ZHANG Dali; TAN Guangyu

    2008-01-01

    Considering the complex constraint between operations in nonstandard job shop scheduling problem (NJSSP), critical path of job manufacturing tree is determined according to priority scheduling function constructed. Operations are divided into dependent operations and independent operations with the idea of subsection, and corresponding scheduling strategy is put forward according to operation characteristic in the segment and the complementarities of identical function machines. Forward greedy rule is adopted mainly for dependent operations to make operations arranged in the right position of machine selected, then each operation can be processed as early as possible, and the total processing time of job can be shortened as much as possible. For independent operations optimum scheduling rule is adopted mainly, the inserting position of operations will be determined according to the gap that the processing time of operations is subtracted from idle time of machine, and the operation will be inserted in the position with minimal gap. Experiments show, under the same conditions, the result that operations are scheduled according to the object function constructed, and the scheduling strategy adopted is better than the result that operations are scheduled according to efficiency scheduling algorithm.

  3. Shaping Academic Task Engagement with Percentile Schedules

    Science.gov (United States)

    Athens, Elizabeth S.; Vollmer, Timothy R.; St. Peter Pipkin, Claire C.

    2007-01-01

    The purpose of this study was to examine the use of percentile schedules as a method of quantifying the shaping procedure in an educational setting. We compared duration of task engagement during baseline measurements for 4 students to duration of task engagement during a percentile schedule. As a secondary purpose, we examined the influence on…

  4. 40 CFR 716.60 - Reporting schedule.

    Science.gov (United States)

    2010-07-01

    ... 40 Protection of Environment 30 2010-07-01 2010-07-01 false Reporting schedule. 716.60 Section 716.60 Protection of Environment ENVIRONMENTAL PROTECTION AGENCY (CONTINUED) TOXIC SUBSTANCES CONTROL ACT HEALTH AND SAFETY DATA REPORTING General Provisions § 716.60 Reporting schedule. (a) General requirements...

  5. State Teacher Salary Schedules. Policy Analysis

    Science.gov (United States)

    Griffith, Michael

    2016-01-01

    In the United States most teacher compensation issues are decided at the school district level. However, a group of states have chosen to play a role in teacher pay decisions by instituting statewide teacher salary schedules. Education Commission of the States has found that 17 states currently make use of teacher salary schedules. This education…

  6. Psychometric Properties of the "Aberrant Behavior Checklist," the "Anxiety, Depression and Mood Scale," the "Assessment of Dual Diagnosis" and the "Social Performance Survey Schedule" in Adults with Intellectual Disabilities

    Science.gov (United States)

    Rojahn, Johannes; Rowe, Ellen W.; Kasdan, Shana; Moore, Linda; van Ingen, Daniel J.

    2011-01-01

    Progress in clinical research and in empirically supported interventions in the area of psychopathology in intellectual disabilities (ID) depends on high-quality assessment instruments. To this end, psychometric properties of four instruments were examined: the "Aberrant Behavior Checklist" (ABC), the "Assessment of Dual Diagnosis" (ADD), the…

  7. Psychometric Properties of the "Aberrant Behavior Checklist," the "Anxiety, Depression and Mood Scale," the "Assessment of Dual Diagnosis" and the "Social Performance Survey Schedule" in Adults with Intellectual Disabilities

    Science.gov (United States)

    Rojahn, Johannes; Rowe, Ellen W.; Kasdan, Shana; Moore, Linda; van Ingen, Daniel J.

    2011-01-01

    Progress in clinical research and in empirically supported interventions in the area of psychopathology in intellectual disabilities (ID) depends on high-quality assessment instruments. To this end, psychometric properties of four instruments were examined: the "Aberrant Behavior Checklist" (ABC), the "Assessment of Dual…

  8. Garbage Collection Scheduling of Aperiodic Tasks

    Institute of Scientific and Technical Information of China (English)

    Ning Zhang; Guang-Ze Xiong

    2009-01-01

    In the previous work of garbage collection (GC) models, scheduling analysis was given based on an assumption that there were no aperiodic mutator tasks. However, it is not true in practical real-time systems. The GC algorithm which can schedule aperiodic tasks is proposed, and the variance of live memory is analyzed. In this algorithm, active tasks are deferred to be processed by GC until the states of tasks become inactive, and the saved sporadic server time can be used to schedule aperiodic tasks. Scheduling the sample task sets demonstrates that this algorithm in this paper can schedule aperiodic tasks and decrease GC work. Thus, the GC algorithm proposed is more flexible and portable.

  9. Human choice under schedules of negative reinforcement.

    Science.gov (United States)

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

    2015-12-01

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

  10. Dynamic Scheduling of Flexible Job Shops

    Institute of Scientific and Technical Information of China (English)

    SHAHID Ikramullah Butt; SUN Hou-fang

    2007-01-01

    Aim of this research is to minimize makespan in the flexible job shop environment by the use of genetic algorithms and scheduling rules.Software is developed using genetic algorithms and scheduling rules based on certain constraints such as non-preemption of jobs,recirculation,set up times,non-breakdown of machines etc.Purpose of the software is to develop a schedule for flexible job shop environment,which is a special case of job shop scheduling problem.Scheduling algorithm used in the software is verified and tested by using MT10 as benchmark problem,presented in the flexible job shop environment at the end.LEKIN(R) software results are also compared with results of the developed software by the use of MT10 benchmark problem to show that the latter is a practical software and can be used successfully at BIT Training Workshop.

  11. Scheduler Vulnerabilities and Attacks in Cloud Computing

    CERN Document Server

    Zhou, Fangfei; Desnoyers, Peter; Sundaram, Ravi

    2011-01-01

    In hardware virtualization a hypervisor provides multiple Virtual Machines (VMs) on a single physical system, each executing a separate operating system instance. The hypervisor schedules execution of these VMs much as the scheduler in an operating system does, balancing factors such as fairness and I/O performance. As in an operating system, the scheduler may be vulnerable to malicious behavior on the part of users seeking to deny service to others or maximize their own resource usage. Recently, publically available cloud computing services such as Amazon EC2 have used virtualization to provide customers with virtual machines running on the provider's hardware, typically charging by wall clock time rather than resources consumed. Under this business model, manipulation of the scheduler may allow theft of service at the expense of other customers, rather than merely reallocating resources within the same administrative domain. We describe a flaw in the Xen scheduler allowing virtual machines to consume almost...

  12. ISAPS: Intelligent Scheduling And Planning System

    Energy Technology Data Exchange (ETDEWEB)

    King, M.S.; Rutherford, W.C.; Grice, J.V. (Allied-Signal Aerospace Co., Kansas City, MO (USA). Kansas City Div.); Kessel, K.L.; Orel, M. (Intellicorp, Mountain View, CA (USA))

    1990-08-01

    ISAPS is a scheduling and planning tool for shop floor personnel working in a Flexible Manufacturing System (FMS) environment. The ISAP system has two integrated components: the Predictive Scheduler (PS) and the Reactive Scheduler (RS). These components work cooperatively to satisfy the four goals of the ISAP system, which are: (G1) meet production due dates, (G2) maximize machining center utilization, (G3) minimize cutting tool migration, and (G4) minimize product flow time. The PS is used to establish schedules for new production requirements. The RS is used to adjust the schedules produced by the PS for unforeseen events that occur during production operations. The PS and RS subsystems have been developed using IntelliCorp's Knowledge Engineering Environment (KEE), an expert system development shell, and Common LISP. Software Quality Assurance (SQA) techniques have been incorporated throughout the development effort to assure the ISAP system meets the manufacturing goals and end user requirements. 5 refs., 4 figs.

  13. Approximation algorithm for multiprocessor parallel job scheduling

    Institute of Scientific and Technical Information of China (English)

    陈松乔; 黄金贵; 陈建二

    2002-01-01

    Pk|fix|Cmax problem is a new scheduling problem based on the multiprocessor parallel job, and it is proved to be NP-hard problem when k≥3. This paper focuses on the case of k=3. Some new observations and new techniques for P3|fix|Cmax problem are offered. The concept of semi-normal schedulings is introduced, and a very simple linear time algorithm Semi-normal Algorithm for constructing semi-normal schedulings is developed. With the method of the classical Graham List Scheduling, a thorough analysis of the optimal scheduling on a special instance is provided, which shows that the algorithm is an approximation algorithm of ratio of 9/8 for any instance of P3|fix|Cmax problem, and improves the previous best ratio of 7/6 by M.X.Goemans.

  14. Routine environmental monitoring schedule, calendar year 1997

    Energy Technology Data Exchange (ETDEWEB)

    Markes, B.M., Westinghouse Hanford

    1996-12-10

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

  15. TECHNICAL COORDINATION, SCHEDULE AND INTEGRATION

    CERN Multimedia

    A. Ball

    Introduction Despite the holiday season affecting available manpower, many key internal milestones have been passed over the summer, thanks to the dedication and commitment of the team at point 5. In particular, the installation on, and within, YB0 has progressed steadily through several potentially difficult phases. The v36 planning contingency of lowering YB-1 and YB-1 wheels on schedule in October, before Tracker installation, will be executed in order to give more time to complete YB0 services work, whilst still being consistent with completion of heavy lowering by the end of 2007. Safety In the underground areas the peak level of activity and parallel work has been reached and this will continue for the coming months. Utmost vigilance is required of everybody working underground and this must be maintained. However, it is encouraging to note that the compliance with safety rules is, in general, good. More and more work will be carried out from scaffolding and mobile access platforms. (cherry-picke...

  16. TECHNICAL COORDINATION, SCHEDULE AND INTEGRATION

    CERN Multimedia

    A. Ball

    Introduction and Schedule After nearly seven months of concentrated effort, the installation of services on YB0 moved off the CMS critical path in late November. In line with v36 planning provisions, the additional time needed to finish this challeng¬ing task was accommodated by reducing sequential dependencies between assembly tasks, putting more tasks (especially heavy logistic movements) in parallel with activities on, or within, the central wheel. Thus the lowering of wheels YB-1 and YB -2 and of disk YE-3 is already complete, the latter made possible, in the shadow of YB0 work, by inverting the order of the 3 endcap disks in the surface building. Weather conditions permitting, the Tracker will be transported to point 5 during CMS week for insertion in EB before CERN closes. The lowering of the last two disks will take place mid- and end-of January, respectively. Thus central beampipe installation can be confidently planned to start in February as foreseen, allowing closure of CMS in time for CRA...

  17. TECHNICAL COORDINATION, SCHEDULE AND INTEGRATION

    CERN Multimedia

    A. Ball

    Introduction Since the lowering of YB0 in February, less spectacular but nonetheless crucial progress has been made along the critical path to CMS completion. The YB0 has been aligned with the beamline to a fraction of a mm, and the HCAL has been fully installed. Cabling scaffolding for YB0 services has been built and one half (-z end) of the ECAL barrel has been installed. The YB0 services installation has begun, with two of the major technical challenges delaying bulk installation, namely PP1 detailed design, manufacture and installation plus Tracker cooling pipe insulation, now apparently solved. Significant difficulties in detailed design, integration and procurement of cable ducts remain. Despite this, the design of the +end is close to complete, and Tracker power cable installation on two sectors of the +end is well advanced. A new master schedule, v36.0, is being prepared to account for the updated actual situation at point 5 and for the revised LHC machine planning. Safety The enormous amount of...

  18. Performance analysis of active schedules in identical parallel machine

    Institute of Scientific and Technical Information of China (English)

    Changjun WANG; Yugeng XI

    2007-01-01

    Active schedule is one of the most basic and popular concepts in production scheduling research. For identical parallel machine scheduling with jobs' dynamic arrivals, the tight performance bounds of active schedules under the measurement of four popular objectives are respectively given in this paper. Similar analysis method and conclusions can be generalized to static identical parallel machine and single machine scheduling problem.

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

  20. Reliability and validity of the Chinese version of WHO Disability Assessment Schedule 2.0 in mental disability assessment%世界卫生组织残疾评定量表第2版中文版在精神残疾评定中的信效度检验

    Institute of Scientific and Technical Information of China (English)

    王莲娥; 周洁; 金欢

    2013-01-01

    目的:检验世界卫生组织残疾评定量表第2版中文版(WHO-DASⅡ)在精神残疾评定中的信度和效度,以探讨其在精神疾病患者中的适用性.方法:对218例精神残疾者进行WHO-DASⅡ评定,采用相关分析和Cronbach α系数检验量表内部一致性信度;应用探索和验证性因素分析检验量表结构效度;以不同精神疾病的得分差异检验量表的实证效度.结果:总量表内部一致性Cronbach α系数为0.93,6个分量表α系数在0.69~0.94之间;评定者一致性为0.93.除分量表6外其余5个分量表内部各条目间、6个分量表之间以及分量表与总分之间均呈正相关(r =0.17 ~0.91,P<0.05).探索性因素分析显示,6个因子累积解释的总方差为63.68%,所有因子特征根均大于1;但各因子包含题项均与原量表不一致;验证性因素分析显示原量表结构与样本的拟合度较差(x2/df=4.24,P<0.001、GFI=0.57、NFI=0.58、CFI =0.64、RMSEA =0.12).器质性精神障碍组的总分和理解与交流、身体移动、自我照料3个分量表得分均高于情感性精神障碍组和精神分裂症组(P<0.05).结论:世界卫生组织残疾评定量表第2版中文版具有较好的内部一致性信度和实证效度,但结构效度不理想,有待进一步探索和验证.%Objective: To test the reliability and validity of the Chinese version of WHO Disability Assessment Schedule 2.0( WHO-DASⅡ) in mental disability assessment Methods: Totally 218 patients with mental disability were assessed with the WHO-DAS Ⅱ. The consistency of the scale was tested by using correlation analysis and Cronbach's a coefficient The constructive validity was tested by using exploratory factory analysis (EFA) and confirmatory factory analysis (CFA). The score difference in different mental patients was used to test the validate validity. Results:The Cronbach's a coefficient of the WHO-DAS Ⅱ was 0.93, the coefficient of the subscales ranged from 0

  1. Energy-optimal programming and scheduling of the manufacturing operations

    Science.gov (United States)

    Badea, N.; Frumuşanu, G.; Epureanu, A.

    2016-08-01

    The shop floor energy system covers the energy consumed for both the air conditioning and manufacturing processes. At the same time, most of energy consumed in manufacturing processes is converted in heat released in the shop floor interior and has a significant influence on the microclimate. Both these components of the energy consumption have a time variation that can be realistic assessed. Moreover, the consumed energy decisively determines the environmental sustainability of the manufacturing operation, while the expenditure for running the shop floor energy system is a significant component of the manufacturing operations cost. Finally yet importantly, the energy consumption can be fundamentally influenced by properly programming and scheduling of the manufacturing operations. In this paper, we present a method for modeling and energy-optimal programming & scheduling the manufacturing operations. In this purpose, we have firstly identified two optimization targets, namely the environmental sustainability and the economic efficiency. Then, we have defined three optimization criteria, which can assess the degree of achieving these targets. Finally, we have modeled the relationship between the optimization criteria and the parameters of programming and scheduling. In this way, it has been revealed that by adjusting these parameters one can significantly improve the sustainability and efficiency of manufacturing operations. A numerical simulation has proved the feasibility and the efficiency of the proposed method.

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

  3. NRC comprehensive records disposition schedule. Revision 3

    Energy Technology Data Exchange (ETDEWEB)

    NONE

    1998-02-01

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

  4. STATUS OF SCHEDULE TRIBES IN ANDHRA PRADESH

    Directory of Open Access Journals (Sweden)

    Dr. P. Subramanyachary

    2013-01-01

    Full Text Available Schedule Tribes (ST’s are Indian population groups that are explicitly recognized by the constitution of India order 1950. The order lists 744 tribes across 22 states in its first schedule. In Andhra Pradesh 33 types of Schedule Tribes are living in 8 districts. ST’s are 6.6% are in total population of Andhra Pradesh. They have rich heritage along with their innocent life style. As they are living in hill areas and forests they have some peculiar characters like indications of primitive traits, distinctive culture, and shyness of contact with other communities, geographical isolation, backwardness etc. So, for their development central and state governments are implementing different programmes and schemes since 1951. After the Ministry of Tribal affairs were constituted in 1999, there is more focus on development of Schedule Tribes in Indian society especially in Andhra Pradesh. The persisting problems like low literacy and high drop-outs, inadequate health services, lack of nutrition food, extreme poverty, and ineffective implementation of schemes etc are putting them away from economic development. Hence, there should be more commitment by both central and state government and local bodies to develop Schedule Tribes in the society. As literacy is 37% NGO’s and other voluntary organizations have to play key role to bring awareness among schedule tribes regarding programs and scheme for their development. Awareness and participation of Schedule Tribes in the implementation of policies leads to prosperity of ST community in the state as well as country.

  5. Use of Data Mining in Scheduler Optimization

    CERN Document Server

    Anderson, George; Nelwamondo, Fulufhelo V

    2010-01-01

    The operating system's role in a computer system is to manage the various resources. One of these resources is the Central Processing Unit. It is managed by a component of the operating system called the CPU scheduler. Schedulers are optimized for typical workloads expected to run on the platform. However, a single scheduler may not be appropriate for all workloads. That is, a scheduler may schedule a workload such that the completion time is minimized, but when another type of workload is run on the platform, scheduling and therefore completion time will not be optimal; a different scheduling algorithm, or a different set of parameters, may work better. Several approaches to solving this problem have been proposed. The objective of this survey is to summarize the approaches based on data mining, which are available in the literature. In addition to solutions that can be directly utilized for solving this problem, we are interested in data mining research in related areas that have potential for use in operat...

  6. Downlink Scheduling for Multiclass Traffic in LTE

    Directory of Open Access Journals (Sweden)

    Madan Ritesh

    2009-01-01

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

  7. Assessment methodology of the summer time schedule change (CHV) in Mexico: 10 years of application; Metodologia de evaluacion del cambio de horario de verano (CHV) en Mexico: 10 anos de aplicacion

    Energy Technology Data Exchange (ETDEWEB)

    Maqueda Zamora, Martin Roberto; Perez Rebolledo, Hugo [Instituto de Investigaciones Electricas, Cuernavaca, Morelos (Mexico)

    2008-07-01

    The Summer Time is strongly bound to the rational use of the natural resources, since it is a measure that contributes to the care of the country energy resources and the improvement of the environment. This measure consists of advancing the clock one hour in the months that have greater insolation in the country and when doing it, the electrical energy demand is reduced, a saving in the consumption of the same is obtained, resulting in a reduction of the fossil fuel consumption that is needed to generate electric energy and also the emission of polluting agents to the environment is detained. It is to emphasize that the sustainable development and the environment depend on the energy efficient use. With the application of the Summertime Schedule, the entire country participate in the care of the energy resources that are derived from their application and generates in the population a culture of the care of the energy and the environment. This program is applied to world-wide level, including the industrialized countries. In this paper the methodology implemented by the Instituto de Investigaciones Electricas (IIE) is presented, to realize the calculations of saving in electrical power consumption and the quantification of the avoided demand, as well as the main results obtained in 10 years of application of the measure in Mexico. [Spanish] El horario de verano esta fuertemente ligado al uso racional de los recursos naturales, ya que es una medida que contribuye al cuidado de los recursos energeticos del pais y la mejora del medio ambiente. Esta medida consiste en adelantar el reloj una hora en los meses que se tiene mayor insolacion en el pais y al hacerlo, se reduce la demanda de energia electrica, se tiene un ahorro en el consumo de la misma y como resultado se reduce el consumo de combustibles fosiles que se necesitan para generar la energia electrica y tambien se dejan de emitir contaminantes al medio ambiente. Cabe resaltar que el desarrollo sustentable y el

  8. Optimal radiotherapy dose schedules under parametric uncertainty

    Science.gov (United States)

    Badri, Hamidreza; Watanabe, Yoichi; Leder, Kevin

    2016-01-01

    We consider the effects of parameter uncertainty on the optimal radiation schedule in the context of the linear-quadratic model. Our interest arises from the observation that if inter-patient variability in normal and tumor tissue radiosensitivity or sparing factor of the organs-at-risk (OAR) are not accounted for during radiation scheduling, the performance of the therapy may be strongly degraded or the OAR may receive a substantially larger dose than the allowable threshold. This paper proposes a stochastic radiation scheduling concept to incorporate inter-patient variability into the scheduling optimization problem. Our method is based on a probabilistic approach, where the model parameters are given by a set of random variables. Our probabilistic formulation ensures that our constraints are satisfied with a given probability, and that our objective function achieves a desired level with a stated probability. We used a variable transformation to reduce the resulting optimization problem to two dimensions. We showed that the optimal solution lies on the boundary of the feasible region and we implemented a branch and bound algorithm to find the global optimal solution. We demonstrated how the configuration of optimal schedules in the presence of uncertainty compares to optimal schedules in the absence of uncertainty (conventional schedule). We observed that in order to protect against the possibility of the model parameters falling into a region where the conventional schedule is no longer feasible, it is required to avoid extremal solutions, i.e. a single large dose or very large total dose delivered over a long period. Finally, we performed numerical experiments in the setting of head and neck tumors including several normal tissues to reveal the effect of parameter uncertainty on optimal schedules and to evaluate the sensitivity of the solutions to the choice of key model parameters.

  9. Individual differences in strategic flight management and scheduling

    Science.gov (United States)

    Wickens, Christopher D.; Raby, Mireille

    1991-01-01

    A group of 30 instrument-rated pilots was made to fly simulator approaches to three airports under conditions of low, medium, and high workload conditions. An analysis is presently conducted of the difference in discrete task scheduling between the group of 10 highest and 10 lowest performing pilots in the sample; this categorization was based on the mean of various flight-profile measures. The two groups were found to differ from each other only in terms of the time when specific events were conducted, and of the optimality of scheduling for certain high-priority tasks. These results are assessed in view of the relative independence of task-management skills from aircraft-control skills.

  10. Individual differences in strategic flight management and scheduling

    Science.gov (United States)

    Wickens, Christopher D.; Raby, Mireille

    1991-01-01

    A group of 30 instrument-rated pilots was made to fly simulator approaches to three airports under conditions of low, medium, and high workload conditions. An analysis is presently conducted of the difference in discrete task scheduling between the group of 10 highest and 10 lowest performing pilots in the sample; this categorization was based on the mean of various flight-profile measures. The two groups were found to differ from each other only in terms of the time when specific events were conducted, and of the optimality of scheduling for certain high-priority tasks. These results are assessed in view of the relative independence of task-management skills from aircraft-control skills.

  11. Fewer intensive care unit refusals and a higher capacity utilization by using a cyclic surgical case schedule

    NARCIS (Netherlands)

    Houdenhoven, van Mark; Oostrum, van Jeroen M.; Wullink, Gerhard; Hans, Erwin; Hurink, Johann L.; Bakker, Jan; Kazemier, Geert

    2008-01-01

    Purpose: Mounting health care costs force hospital managers to maximize utilization of scarce resources and simultaneously improve access to hospital services. This article assesses the benefits of a cyclic case scheduling approach that exploits a master surgical schedule (MSS). An MSS maximizes ope

  12. The Use of Descriptive Analysis to Identify and Manipulate Schedules of Reinforcement in the Treatment of Food Refusal

    Science.gov (United States)

    Casey, Sean D.; Cooper-Brown, Linda J.; Wacker, David P.; Rankin, Barbara E.

    2006-01-01

    The feeding behaviors of a child diagnosed with failure to thrive were assessed using descriptive analysis methodology to identify the schedules of reinforcement provided by the child's parents. This analysis revealed that the child's appropriate feeding behaviors (i.e., bite acceptance, self-feeding) were on a lean schedule of positive…

  13. Scheduling and Subcontracting under Parallel Machines

    Institute of Scientific and Technical Information of China (English)

    CHEN Rong-jun; TANG Guo-chun

    2012-01-01

    In this paper,we study a model on joint decisions of scheduling and subcontracting,in which jobs(orders) can be either processed by parallel machines at the manufacturer in-house or subcontracted to a subcontractor.The manufacturer needs to determine which jobs should be produced in-house and which jobs should be subcontracted.Furthermore,it needs to determine a production schedule for jobs to be produced in-house.We discuss five classical scheduling objectives as production costs.For each problem with different objective functions,we give optimality conditions and propose dynamic programming algorithms.

  14. New schedulability analysis for WiDom

    OpenAIRE

    Vahabi, Maryam; Andersson, Björn

    2010-01-01

    WiDom is a wireless prioritized medium access control (MAC) protocol which offers a very large number of priority levels. Hence, it brings the potential for employing non-preemptive static-priority scheduling and schedulability analysis for a wireless channel assuming that the overhead of WiDom is modeled properly. One schedulability analysis for WiDom has already been proposed but recent research has created a new version of WiDom with lower overhead (we call it: WiDo...

  15. Concurrent Scheduling of Event-B Models

    CERN Document Server

    Boström, Pontus; Sere, Kaisa; Waldén, Marina; 10.4204/EPTCS.55.11

    2011-01-01

    Event-B is a refinement-based formal method that has been shown to be useful in developing concurrent and distributed programs. Large models can be decomposed into sub-models that can be refined semi-independently and executed in parallel. In this paper, we show how to introduce explicit control flow for the concurrent sub-models in the form of event schedules. We explore how schedules can be designed so that their application results in a correctness-preserving refinement step. For practical application, two patterns for schedule introduction are provided, together with their associated proof obligations. We demonstrate our method by applying it on the dining philosophers problem.

  16. Simultaneous scheduling of machines and mobile robots

    DEFF Research Database (Denmark)

    Dang, Vinh Quang; Nielsen, Izabela Ewa

    2013-01-01

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

  17. Proposed Schedule for Fenton Hill Experiments

    Energy Technology Data Exchange (ETDEWEB)

    Albright, James N. [Los Alamos National Lab. (LANL), Los Alamos, NM (United States); Brown, Donald W. [Los Alamos National Lab. (LANL), Los Alamos, NM (United States)

    1990-10-22

    To help in planning Fenton Hill experimental operations in concert with preparations for the Long-Term Flow Test (LTFT) next summer, the following schedule is proposed. This schedule fits some of the realities of the next few months, including the Laboratory closure during the Holidays, the seismic monitoring tests in Roswell, and the difficulties of operating during the winter months. Whenever possible, cyclic pumping operations during the colder months will be scheduled so that the pump will be on during the late evening and early morning hours to prevent freezeup.

  18. Multiprocessor Scheduling Using Parallel Genetic Algorithm

    Directory of Open Access Journals (Sweden)

    Nourah Al-Angari

    2012-07-01

    Full Text Available Tasks scheduling is the most challenging problem in the parallel computing. Hence, the inappropriate scheduling will reduce or even abort the utilization of the true potential of the parallelization. Genetic algorithm (GA has been successfully applied to solve the scheduling problem. The fitness evaluation is the most time consuming GA operation for the CPU time, which affect the GA performance. The proposed synchronous master-slave algorithm outperforms the sequential algorithm in case of complex and high number of generations problem.

  19. Schedule Uncertainty Control: A Literature Review

    Science.gov (United States)

    Jun-yan, Liu

    Risk control on project schedule is one of the focus problems in the academic circle and the practical area all the time. Lots of research about risk control on project schedule have been fulfilled and many achievements have appeared in recent several decades. The literature on the techniques of schedule uncertainty control was reviewed. A summary analysis on those chievements is presented such as CPM, PERT, MC, BBN, and so on and in light of that summary analysis a deep discussion in terms of advantages and disadvantages of existing research has been analyzed, so that researchers can continue to refine their research.

  20. Bridging the Gap Between Planning and Scheduling

    Science.gov (United States)

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

    2000-01-01

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

  1. NEWS OF THE NATIONAL IMMUNIZATION SCHEDULE

    Directory of Open Access Journals (Sweden)

    O. V. Shamsheva

    2014-01-01

    Full Text Available The article presents the changes Immunization Schedule Russia introduced in 2014. In new Schedule now is the vaccination against pneumococcal disease for all children of 2 months with revaccination at 4 and 15 months old; excluded from the Schedule second revaccination against tuberculosis. At risk groups to be vaccinated against the flu, entered pregnant women and persons subject to military conscription. Recommendations on use of vaccines containing relevant antigens for the Russian Federation, to provide maximum effectiveness of immunization and vaccines that do not contain preservatives in children under 1 year of age. Offered to create a council of experts in the field of vaccinology and vaccine prevention

  2. Examining the generality of children's preference for contingent reinforcement via extension to different responses, reinforcers, and schedules.

    Science.gov (United States)

    Luczynski, Kevin C; Hanley, Gregory P

    2010-01-01

    Studies that have assessed whether children prefer contingent reinforcement (CR) or noncontingent reinforcement (NCR) have shown that they prefer CR. Preference for CR has, however, been evaluated only under continuous reinforcement (CRF) schedules. The prevalence of intermittent reinforcement (INT) warrants an evaluation of whether preference for CR persists as the schedule of reinforcement is thinned. In the current study, we evaluated 2 children's preference for contingent versus noncontingent delivery of highly preferred edible items for academic task completion under CRF and INT schedules. Children (a) preferred CR to NCR under the CRF schedule, (b) continued to prefer CR as the schedule of reinforcement became intermittent, and (c) exhibited a shift in preference from CR to NCR as the schedule became increasingly thin. These findings extend the generality of and provide one set of limits to the preference for CR. Applied implications, variables controlling preferences, and future research are discussed.

  3. Second-order schedules of token reinforcement: effects of varying the schedule of food presentation1

    Science.gov (United States)

    Malagodi, E. F.; Webbe, Frank M.; Waddell, Thomas R.

    1975-01-01

    In the initial link of a complex schedule, one discriminative stimulus was presented and lever pressing produced tokens on fixed-ratio schedules. In the terminal link, signalled by a second discriminative stimulus, deposits of the tokens produced food. With two rats, the terminal link was presented after each sixth component schedule of token reinforcement was completed. With the other two rats, the terminal link was presented following the first component schedule completed after a fixed interval. During the terminal link, each token deposit initially produced food. The schedule of food presentation was subsequently increased such that an increasing number of token deposits in the terminal link was required for each food presentation. Rates of lever pressing in the initial link were inversely related to the schedule of food presentation in the terminal link. These results are similar to those of experiments that have varied schedules of food presentation in chained schedules. Rates and patterns of responding controlled throughout the initial link were more similar to those ordinarily controlled by second-order brief-stimulus schedules than to those controlled by comparable extended chained schedules. PMID:16811869

  4. Recent reinforcement-schedule research and applied behavior analysis

    OpenAIRE

    Lattal, Kennon A; Neef, Nancy A

    1996-01-01

    Reinforcement schedules are considered in relation to applied behavior analysis by examining several recent laboratory experiments with humans and other animals. The experiments are drawn from three areas of contemporary schedule research: behavioral history effects on schedule performance, the role of instructions in schedule performance of humans, and dynamic schedules of reinforcement. All of the experiments are discussed in relation to the role of behavioral history in current schedule pe...

  5. Home Appliance Load Scheduling with SEMIAH

    DEFF Research Database (Denmark)

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

    2015-01-01

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

  6. Integrated Job Scheduling and Network Routing

    DEFF Research Database (Denmark)

    Gamst, Mette; Pisinger, David

    2013-01-01

    We consider an integrated job scheduling and network routing problem which appears in Grid Computing and production planning. The problem is to schedule a number of jobs at a finite set of machines, such that the overall profit of the executed jobs is maximized. Each job demands a number...... of resources which must be sent to the executing machine through a network with limited capacity. A job cannot start before all of its resources have arrived at the machine. The scheduling problem is formulated as a Mixed Integer Program (MIP) and proved to be NP-hard. An exact solution approach using Dantzig...... instances with 1,000 jobs and 1,000 machines covering 24 hours of scheduling activity on a Grid network. The algorithm is also compared to simulations of a real-life Grid, and results show that the solution quality significantly increases when solving the problem to optimality. The promising results...

  7. Onboard Autonomous Scheduling Intelligence System Project

    Data.gov (United States)

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

  8. Scheduling job shop - A case study

    Science.gov (United States)

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

    2016-08-01

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

  9. Schedule Sales Query Report Generation System

    Data.gov (United States)

    General Services Administration — Schedule Sales Query presents sales volume figures as reported to GSA by contractors. The reports are generated as quarterly reports for the current year and the...

  10. Intelligent Feedback Scheduling of Control Tasks

    Directory of Open Access Journals (Sweden)

    Fatin I. Telchy

    2014-12-01

    Full Text Available an efficient feedback scheduling scheme based on the proposed Feed Forward Neural Network (FFNN scheme is employed to improve the overall control performance while minimizing the overhead of feedback scheduling which exposed using the optimal solutions obtained offline by mathematical optimization methods. The previously described FFNN is employed to adapt online the sampling periods of concurrent control tasks with respect to changes in computing resource availability. The proposed intelligent scheduler will be examined with different optimization algorithms. An inverted pendulum cost function is used in these experiments. Then, simulation of three inverted pendulums as intelligent Real Time System (RTS is described in details. Numerical simulation results demonstrates that the proposed scheme can reduce the computational overhead significantly while delivering almost the same overall control performance as compared to optimal feedback scheduling

  11. Oversubscribed Mission Scheduler Conflict Resolution System Project

    Data.gov (United States)

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

  12. Individualized Project Physics in a Modular Schedule.

    Science.gov (United States)

    Cange, Francis

    1985-01-01

    Project Physics is taught at Gibault High School (Waterloo, IL) using a modular schedule and learning activity packets. A description of the course, instructional strategies used, and the learning activity packets is provided. (JN)

  13. Physician Fee Schedule Carrier Specific Files

    Data.gov (United States)

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

  14. Hanford Site Environmental Surveillance Master Sampling Schedule

    Energy Technology Data Exchange (ETDEWEB)

    Bisping, Lynn E.

    2000-01-27

    This document contains the CY2000 schedules for the routine collection of samples for the Surface Environmental Surveillance Project (SESP) and Drinking Water Monitoring Project. Each section includes sampling locations, sample types, and analyses to be performed.

  15. Generator scheduling under competitive environment using genetic ...

    African Journals Online (AJOL)

    DR OKE

    Some hybrid methods are GA and artificial ...... Market Operations in Electric Power Systems: forecasting, scheduling, and risk ... artificial intelligence applications to power system optimization problems, evolutionary computation, neural ...

  16. Alternative Work Schedules Increase Employee Satisfaction.

    Science.gov (United States)

    Turney, John R.; Cohen, Stanley L.

    1983-01-01

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

  17. The Composition of the Master Schedule

    Science.gov (United States)

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

    2010-01-01

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

  18. 29 CFR 1952.173 - Developmental schedule.

    Science.gov (United States)

    2010-07-01

    ...) Inservice training plans for enforcement personnel will be developed within 18 months of plan approval. (f... Inspection Scheduling System will be fully implemented and in operation March 31, 1975....

  19. The GBT Dynamic Scheduling System: An Update

    Science.gov (United States)

    Clark, M. H.; Balser, D. S.; Braatz, J.; Condon, J.; Creager, R. E.; McCarty, M. T.; Maddalena, R. J.; Marganian, P.; O'Neil, K.; Sessoms, E.; Shelton, A. L.

    2011-07-01

    The Robert C. Byrd Green Bank Telescope's (GBT) Dynamic Scheduling System (DSS), in production use since September 2009, was designed to maximize observing efficiency while maintaining the GBT's flexibility, improving data quality, and minimizing any undue adversity for the observers. Using observing criteria, observer availability and qualifications, three-dimensional weather forecasts, and telescope state, the DSS software is capable of optimally scheduling observers 24 to 48 hours in advance on a telescope having a wide-range of capabilities in a geographical location with variable weather patterns. Recent improvements for the GBT include an expanded frequency coverage (0.390-90 GHz), proper treatment of fully sampled array receivers, increasingly diverse observing criteria, the ability to account for atmospheric instability from clouds, and new tools for scheduling staff to control and interact with generated schedules and the underlying database.

  20. NASA Deep Space Network Operations Scheduling

    Science.gov (United States)

    Enari, D. M.

    The functioning of the Deep Space Network Operations Scheduling, Jet Propulsion Laboratory, CA is reviewed. The primary objectives of the Operations Scheduling are: to schedule the worldwide global allocation of ground communications, tracking facilities, and equipment; and to provide deep space telecommunications for command, tracking, telemetry, and control in support of flight mission operations and tests. Elements of the earth set are Deep Space Stations (DSS) which provide the telecommunications link between the earth and spacecraft; NASA Communications Network; Network Data Processing Area; Network Operations Control Area which provides operational direction to the DSS; Mission Control and Computing systems; and Mission Support areas which provide flight control of the spacecraft. Elements of the space set include mission priorities and requirements which determine the spacecraft queue for allocating network resources. Scheduling is discussed in terms of long-range (3 years), mid-range (8 weeks), and short-range (2 weeks).

  1. 5 CFR 1631.14 - Fee schedule.

    Science.gov (United States)

    2010-01-01

    ... Disclosure of Records Under the Freedom of Information Act, 5 U.S.C. 552 § 1631.14 Fee schedule. (a) Manual... contract with private sector services to locate, reproduce, and disseminate records in response to FOIA...

  2. Parallel Machine Scheduling with Special Jobs

    Institute of Scientific and Technical Information of China (English)

    2006-01-01

    This paper considers parallel machine scheduling with special jobs. Normal jobs can be processed on any of the parallel machines, while the special jobs can only be processed on one machine. The problem is analyzed for various manufacturing conditions and service requirements. The off-line scheduling problem is transformed into a classical parallel machine scheduling problem. The on-line scheduling uses the FCFS (first come, first served), SWSC (special window for special customers), and FFFS (first fit, first served) algorithms to satisfy the various requirements. Furthermore, this paper proves that FCFS has a competitive ratio of m, where m is the number of parallel machines, and this bound is asymptotically tight, SWSC has a competitive ratio of 2 and FFFS has a competitive ratio of , and these bounds are tight.

  3. Scheduling support for transactional memory contention management

    DEFF Research Database (Denmark)

    Maldonado, Walther; Marler, Patrick; Felber, Pascal

    2010-01-01

    traditionally resolved by consulting an STM-level contention manager. Consequently, the contention managers of these "conventional" TM implementations suffer from a lack of precision and often fail to ensure reasonable performance in high-contention workloads. Recently, scheduling-based TM contention-management...... has been proposed for increasing TM efficiency under high-contention [2, 5, 19]. However, only user-level schedulers have been considered. In this work, we propose, implement and evaluate several novel kernel-level scheduling support mechanisms for TM contention management. We also investigate...... different strategies for efficient communication between the kernel and the user-level TM library. To the best of our knowledge, our work is the first to investigate kernel-level support for TM contention management. We have introduced kernel-level TM scheduling support into both the Linux and Solaris...

  4. Intelligent perturbation algorithms for space scheduling optimization

    Science.gov (United States)

    Kurtzman, Clifford R.

    1990-01-01

    The optimization of space operations is examined in the light of optimization heuristics for computer algorithms and iterative search techniques. Specific attention is given to the search concepts known collectively as intelligent perturbation algorithms (IPAs) and their application to crew/resource allocation problems. IPAs iteratively examine successive schedules which become progressively more efficient, and the characteristics of good perturbation operators are listed. IPAs can be applied to aerospace systems to efficiently utilize crews, payloads, and resources in the context of systems such as Space-Station scheduling. A program is presented called the MFIVE Space Station Scheduling Worksheet which generates task assignments and resource usage structures. The IPAs can be used to develop flexible manifesting and scheduling for the Industrial Space Facility.

  5. RESOURCE SCHEDULING IN CLOUD ENVIRONMET: A SURVEY

    Directory of Open Access Journals (Sweden)

    Neeraj Mangla

    2016-06-01

    Full Text Available Cloud Computing offers the avant-garde services at a stretch that are too attractive for any cloud user to ignore. With its growing application and popularization, IT companies are rapidly deploying distributed data centers globally, posing numerous challenges in terms of scheduling of resources under different administrative domains. This perspective brings out certain vital factors for efficient scheduling of resources providing a wide genre of characteristics, diversity in context of level of service agreements and that too with user-contingent elasticity. In this paper, a comprehensive survey of research related to various aspects of cloud resource scheduling is provided. A comparative analysis of various resource scheduling techniques focusing on key performance parameters like Energy efficiency, Virtual Machine allocation and migration, Cost-effectiveness and Service-Level Agreement is also presented.

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

    Directory of Open Access Journals (Sweden)

    Zhe Xu

    2014-01-01

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

  7. Self-Healing Distributed Scheduling Platform

    OpenAIRE

    Frincu M.E.; Villegas N.M.; Petcu D.; Muller H.A.; Rouvoy R.

    2011-01-01

    International audience; Distributed systems require effective mechanisms to manage the reliable provisioning of computational resources from different and distributed providers. Moreover, the dynamic environment that affects the behaviour of such systems and the complexity of these dynamics demand autonomous capabilities to ensure the behaviour of distributed scheduling platforms and to achieve business and user objectives. In this paper we propose a self-adaptive distributed scheduling platf...

  8. Maritime wideband communication networks video transmission scheduling

    CERN Document Server

    Yang, Tingting

    2014-01-01

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

  9. Coordinating, Scheduling, Processing and Analyzing IYA09

    Science.gov (United States)

    Gipson, John; Behrend, Dirk; Gordon, David; Himwich, Ed; MacMillan, Dan; Titus, Mike; Corey, Brian

    2010-01-01

    The IVS scheduled a special astrometric VLBI session for the International Year of Astronomy 2009 (IYA09) commemorating 400 years of optical astronomy and 40 years of VLBI. The IYA09 session is the most ambitious geodetic session to date in terms of network size, number of sources, and number of observations. We describe the process of designing, coordinating, scheduling, pre-session station checkout, correlating, and analyzing this session.

  10. Heuristic Based Task Scheduling In Grid

    Directory of Open Access Journals (Sweden)

    Manpreet Singh

    2012-09-01

    Full Text Available Grid computing is concerned with coordinated resource sharing and problem solving in dynamic, multi-institutional virtual organizations. Efficient scheduling of complex applications in a grid environment reveals several challenges due to its high heterogeneity, dynamic behavior and space shared utilization. Objectives of scheduling algorithms are increase in system throughput, efficiency and reduction in task completion time. The main focus of this paper is to highlight the merits of resource and task selection technique based on certain heuristics.

  11. Revised data taking schedule with ion beams

    CERN Document Server

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

    2009-01-01

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

  12. Advanced Reactors Transition Program Resource Loaded Schedule

    Energy Technology Data Exchange (ETDEWEB)

    GANTT, D.A.

    2000-01-12

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

  13. Advanced Reactors Transition Program Resource Loaded Schedule

    Energy Technology Data Exchange (ETDEWEB)

    BOWEN, W.W.

    1999-11-08

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

  14. Instrumental uncertainty as a determinant of behavior under interval schedules of reinforcement

    Directory of Open Access Journals (Sweden)

    Alicia DeRusso

    2010-05-01

    Full Text Available Interval schedules of reinforcement are known to generate habitual behavior, the performance of which is less sensitive to revaluation of the earned reward and to alterations in the action-outcome contingency. Here we report results from experiments using different types of interval schedules of reinforcement in mice to assess the effect of uncertainty, in the time of reward availability, on habit formation. After limited training, lever pressing under fixed interval (FI, low interval uncertainty or random interval schedules (RI, higher interval uncertainty was sensitive to devaluation, but with more extended training, performance of animals trained under RI schedules became more habitual, i.e. no longer sensitive to devaluation, whereas performance of those trained under FI schedules remained goal-directed. When the press-reward contingency was reversed by omitting reward after pressing but presenting reward in the absence of pressing, lever pressing in mice previously trained under FI decreased more rapidly than that of mice trained under RI schedules. Further analysis revealed that action-reward contiguity is dramatically reduced in lever pressing under RI schedules, whereas action-reward correlation does not vary significantly. These data indicate that the extent of goal-directedness could vary as a function of temporal uncertainty.

  15. A Data Scheduling and Management Infrastructure for the TEAM Network

    Science.gov (United States)

    Andelman, S.; Baru, C.; Chandra, S.; Fegraus, E.; Lin, K.; Unwin, R.

    2009-04-01

    The objective of the Tropical Ecology Assessment and Monitoring Network (www.teamnetwork.org) is "To generate real time data for monitoring long-term trends in tropical biodiversity through a global network of TEAM sites (i.e. field stations in tropical forests), providing an early warning system on the status of biodiversity to effectively guide conservation action". To achieve this, the TEAM Network operates by collecting data via standardized protocols at TEAM Sites. The standardized TEAM protocols include the Climate, Vegetation and Terrestrial Vertebrate Protocols. Some sites also implement additional protocols. There are currently 7 TEAM Sites with plans to grow the network to 15 by June 30, 2009 and 50 TEAM Sites by the end of 2010. Climate Protocol The Climate Protocol entails the collection of climate data via meteorological stations located at the TEAM Sites. This includes information such as precipitation, temperature, wind direction and strength and various solar radiation measurements. Vegetation Protocol The Vegetation Protocol collects standardized information on tropical forest trees and lianas. A TEAM Site will have between 6-9 1ha plots where trees and lianas larger than a pre-specified size are mapped, identified and measured. This results in each TEAM Site repeatedly measuring between 3000-5000 trees annually. Terrestrial Vertebrate Protocol The Terrestrial Vertebrate Protocol collects standardized information on mid-sized tropical forest fauna (i.e. birds and mammals). This information is collected via camera traps (i.e. digital cameras with motion sensors housed in weather proof casings). The images taken by the camera trap are reviewed to identify what species are captured in the image by the camera trap. The image and the interpretation of what is in the image are the data for the Terrestrial Vertebrate Protocol. The amount of data collected through the TEAM protocols provides a significant yet exciting IT challenge. The TEAM Network is

  16. Critical Machine Based Scheduling -A Review

    Science.gov (United States)

    Vivek, P.; Saravanan, R.; Chandrasekaran, M.; Pugazhenthi, R.

    2017-03-01

    This article aims to identify the natural occurrence of the critical machines in scheduling. The exciting scheduling in the real time manufacturing environment is focused on considering equal weight-age of all the machines, but very few researchers were considered the real time constraint(s) like processor/ machine/ workstation availability, etc.,. This article explores the gap between the theory and practices by identifying the critical machine in scheduling and helps the researcher to find the suitable problem in their case study environment. Through the literature survey, it is evident that, in scheduling the occurrence of the critical machine is in nature. The critical machine is found in various names and gives a various range of weight-age based on the particular manufacturing environment and it plays a vital role in scheduling which includes one or more circumstances of occurrence in the production environment. Very few researchers were reported that in manufacturing environment, the critical machine occurrence is in nature, but most of the researchers were focused to optimize the manufacturing environment by only reducing the cycle time. In real-time manufacturing environment, the scheduling of critical machine(s) was keenly monitored and some weight-age was considered.

  17. Stochastic Modeling of Airlines' Scheduled Services Revenue

    Science.gov (United States)

    Hamed, M. M.

    1999-01-01

    Airlines' revenue generated from scheduled services account for the major share in the total revenue. As such, predicting airlines' total scheduled services revenue is of great importance both to the governments (in case of national airlines) and private airlines. This importance stems from the need to formulate future airline strategic management policies, determine government subsidy levels, and formulate governmental air transportation policies. The prediction of the airlines' total scheduled services revenue is dealt with in this paper. Four key components of airline's scheduled services are considered. These include revenues generated from passenger, cargo, mail, and excess baggage. By addressing the revenue generated from each schedule service separately, air transportation planners and designers are able to enhance their ability to formulate specific strategies for each component. Estimation results clearly indicate that the four stochastic processes (scheduled services components) are represented by different Box-Jenkins ARIMA models. The results demonstrate the appropriateness of the developed models and their ability to provide air transportation planners with future information vital to the planning and design processes.

  18. Force dynamics in fixed-ratio schedules.

    Science.gov (United States)

    Pinkston, Jonathan W; McBee, Lindsey N

    2014-03-01

    Fixed-ratio schedules are widely used in behavioral research. Although fixed-ratio schedules often conjure up relationships to work and effort, little is known about effort-related measures in these schedules. Early research had shown that force and effort of operant behavior vary systematically during the execution of ratio schedules, and the goal of the present study was to revisit early research on force dynamics in fixed-ratio schedules. Four rats earned sucrose by pressing an isometric force transducer. Presses produced sucrose after ten or twenty responses. In general, the force of responses increased then decreased systematically across the ratio. The possibility that decreases in force during ratio execution was due to a trade-off with the differential reinforcement of short inter-response times (IRT) was investigated in an additional condition where sucrose was made available according to a tandem fixed-ratio 19 inter-response (IRT)> t schedule. The tandem IRT requirement did not eliminate decreasing trends in force across the ratio; unexpectedly, the tandem requirement did eliminate increases in force early in the ratio, which may reflect sequence-level organization operating in the control of force dynamics.

  19. Optimal Schedules in Multitask Motor Learning.

    Science.gov (United States)

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

    2016-04-01

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

  20. Prescribed Travel Schedules for Fatigue Management

    Science.gov (United States)

    Whitmire, Alexandra; Johnston, Smith; Lockley, Steven

    2011-01-01

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

  1. Interactive Dynamic Mission Scheduling for ASCA

    Science.gov (United States)

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

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

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

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

  4. Different training schedules influence platelet aggregation in show jumping horses.

    Science.gov (United States)

    Giannetto, C; Arfuso, F; Fazio, F; Giudice, E; Pietro, S Di; Bruschetta, D; Piccione, G

    2017-03-28

    Depending on the intensity, duration and type of physical exercise, equine metabolism has to adapt to nervous, cardiovascular, endocrine and respiratory system requirements. In horses, exercise and training are known to have considerable effects on the mechanisms of hemostatic system involving platelet activity. The aim of the present study was to evaluate the effect of different training schedules on platelet aggregation in 15 Italian Saddle jumping horses. Animals were divided into three equal groups: Group A was subjected to a high intensity-training program; group B to a light training program, group C included sedentary horses. From each animal, blood samples were collected by jugular venipuncture at rest on the 1st, 3rd and 5th days, and afterwards, once a week, for a total of 5 weeks data recording, in order to assess the maximum degree of platelet aggregation and the initial velocity of aggregation (slope) platelet aggregation. Two-way analysis of variance (ANOVA) showed a significant effect of the different training schedules on studied parameters. The results revealed a different degree of platelet aggregation and a different initial velocity of platelet aggregation that changes during the different training schedules in horses that could represent a different protective endothelial mechanism. These findings could have an important role for a clearer knowledge of the physiological reference values of platelet aggregation and for a better interpretation of these variations during the training.

  5. Microcomputer-based vehicle routing and scheduling: An overview

    Energy Technology Data Exchange (ETDEWEB)

    Klein, A.J.

    1987-08-01

    Commercially available vehicle-routing and scheduling packages were surveyed to assess capabilities, categorize key characteristics, compare individual packages, and select candidate software for additional testing. Among the key characteristics addressed were backhauling, distance and vehicle travel-time calculation, geocoding, speed zones, natural barriers, time-window constraints, vehicle/stop matching constraints, and other constraints such as vehicle/driver operating costs. The survey included review of vendor literature, telephone interviews, site visits to review software, and the testing of demonstration packages on a set of sample distribution networks. Thirteen packages were reviewed; these were categorized by price and performance as follows; (1) inexpensive packages (costing $2000 or less), which solve the basic vehicle-routing problem but are somewhat limited in their ability to handle large numbers of vehicles and stops; (2) medium-priced systems (from $5000 to $20,000), which offer more capability to handle constraints such as multiple pickup and delivery, time windows, and multiple depots and provide manual intervention capability and enhanced graphics; (3) very expensive systems (from $50,000 to about $150,000), which can handle real-time situations in scheduling last-minute route changes and employ sophisticated graphics tools to change route schedules interactively. Out of the 13 packages, four demonstration vehicle-routing packages were obtained for testing of 4 sample networks; two of the packages were found to be capable of solving most vehicle-routing problem constraints for two versions of 21-city and 30-city networks.

  6. Forecasting project schedule performance using probabilistic and deterministic models

    Directory of Open Access Journals (Sweden)

    S.A. Abdel Azeem

    2014-04-01

    Full Text Available Earned value management (EVM was originally developed for cost management and has not widely been used for forecasting project duration. In addition, EVM based formulas for cost or schedule forecasting are still deterministic and do not provide any information about the range of possible outcomes and the probability of meeting the project objectives. The objective of this paper is to develop three models to forecast the estimated duration at completion. Two of these models are deterministic; earned value (EV and earned schedule (ES models. The third model is a probabilistic model and developed based on Kalman filter algorithm and earned schedule management. Hence, the accuracies of the EV, ES and Kalman Filter Forecasting Model (KFFM through the different project periods will be assessed and compared with the other forecasting methods such as the Critical Path Method (CPM, which makes the time forecast at activity level by revising the actual reporting data for each activity at a certain data date. A case study project is used to validate the results of the three models. Hence, the best model is selected based on the lowest average percentage of error. The results showed that the KFFM developed in this study provides probabilistic prediction bounds of project duration at completion and can be applied through the different project periods with smaller errors than those observed in EV and ES forecasting models.

  7. Multi-DAGs Scheduling Integrating with Security and Availability in Cloud Environment

    Institute of Scientific and Technical Information of China (English)

    LIU Yaqiu; SHAO Hongrun; JING Weipeng; QIU Zhaowen

    2015-01-01

    In view of the issue concerns multiple Di-rected acyclic graphs (DAGs) scheduling in multi-tenant cloud computing environment, a scheduling strategy that integrate security and availability is proposed to satisfy the tenants’ requirements for resource security and avail-ability, as thus it can not only protect the users’ privacy and data security but also advance the success rate. The proposal assesses resource reputation to ensure jobs can be scheduled onto relatively security nodes; during task scheduling, it classifies the DAGs to achieve fairness; in the process of resources allocation, the objective function would maximize the user’s security satisfaction and mini-mize the deviation of availability; meanwhile, it takes ad-vantage of “time chips” flexibly to promote resource uti-lization rate; afterwards, we present a Greedy algorithm integrating with security and availability (GISA) to im-plement the strategy. The experimental results show the correctness and superior of the novel strategy.

  8. Susceptibility of optimal train schedules to stochastic disturbances of process times

    DEFF Research Database (Denmark)

    Larsen, Rune; Pranzo, Marco; D’Ariano, Andrea

    2013-01-01

    This work focuses on the stochastic evaluation of train schedules computed by a microscopic scheduler of railway operations based on deterministic information. The research question is to assess the degree of sensitivity of various rescheduling algorithms to variations in process times (running...... and dwell times). In fact, the objective of railway traffic management is to reduce delay propagation and to increase disturbance robustness of train schedules at a network scale. We present a quantitative study of traffic disturbances and their effects on the schedules computed by simple and advanced...... rescheduling algorithms. Computational results are based on a complex and densely occupied Dutch railway area; train delays are computed based on accepted statistical distributions, and dwell and running times of trains are subject to additional stochastic variations. From the results obtained on a real case...

  9. Better Schedule Performance Assessments Derived from Integrated Master Plan-Referenced Schedule Metrics

    Science.gov (United States)

    2011-10-01

    et w ee n Ta b le 2 & T ab le 3 C o n tr ac t L ev el m et ri cs r efl ec t in co m p le te t as ks d el et ed f ro m b as el in e d u...et w ee n Ta b le 2 & T ab le 4 C o nt ra ct L ev el m et ri cs r efl ec t in co m p le te t as ks d el et ed f ro m b as el in e d u ri

  10. The Use of Project Time Management Processes and the Schedule Performance of Construction Projects in Mexico

    Directory of Open Access Journals (Sweden)

    Rómel G. Solís-Carcaño

    2015-01-01

    Full Text Available Delays have been frequently reported as the cause of several conflicts that affect the different parties involved in construction projects. Project Time Management (PTM includes a number of planning and controlling processes that are recommended for complying with requirements related to project time. The study reported in this paper aimed at assessing the use of PTM processes and its relation with project schedule performance (i.e., timely completion. Seven PTM processes and seventy-seven tasks associated with them were identified from the literature that is globally relevant to project management. The study included the assessment of fourteen school construction projects executed by a public agency in the Yucatan Peninsula, Mexico. These projects were monitored during the construction phase in order to measure two different variables: the use of processes related to PTM (i.e., schedule planning and controlling processes and the project schedule performance. For each of these projects a Use Index was obtained for assessing the first variable, while the Schedule Performance Index and the Schedule Variance were computed to assess the second one. The results demonstrated there is statistical dependence between these two variables. Most of the projects that attained timely completion also made a greater use of the PTM processes.

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

    Science.gov (United States)

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

    2014-01-01

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

  12. 77 FR 33980 - Proposed FOIA Fee Schedule Update

    Science.gov (United States)

    2012-06-08

    ... NUCLEAR FACILITIES SAFETY BOARD 10 CFR Part 1703 Proposed FOIA Fee Schedule Update AGENCY: Defense Nuclear... the SUPPLEMENTARY INFORMATION to the Board's proposed FOIA Fee Schedule Update published in the... update the FOIA Fee Schedule once every 12 months. Previous Fee Schedule Updates were published in...

  13. Store-Forward and its implications for Proportional Scheduling

    NARCIS (Netherlands)

    Walton, N.S.

    2014-01-01

    The Proportional Scheduler was recently proposed as a scheduling algorithm for multi-hop switch networks. For these networks, the BackPressure scheduler is the classical benchmark. For networks with fixed routing, the Proportional Scheduler is maximum stable, myopic and, furthermore, will alleviate

  14. Topology-based hierarchical scheduling using deficit round robin

    DEFF Research Database (Denmark)

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

    2009-01-01

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

  15. 5 CFR 610.121 - Establishment of work schedules.

    Science.gov (United States)

    2010-01-01

    ... 5 Administrative Personnel 1 2010-01-01 2010-01-01 false Establishment of work schedules. 610.121 Section 610.121 Administrative Personnel OFFICE OF PERSONNEL MANAGEMENT CIVIL SERVICE REGULATIONS HOURS OF DUTY Weekly and Daily Scheduling of Work Work Schedules § 610.121 Establishment of work schedules....

  16. Planning and Scheduling for Environmental Sensor Networks

    Science.gov (United States)

    Frank, J. D.

    2005-12-01

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

  17. Realistic Scheduling Mechanism for Smart Homes

    Directory of Open Access Journals (Sweden)

    Danish Mahmood

    2016-03-01

    Full Text Available In this work, we propose a Realistic Scheduling Mechanism (RSM to reduce user frustration and enhance appliance utility by classifying appliances with respective constraints and their time of use effectively. Algorithms are proposed regarding functioning of home appliances. A 24 hour time slot is divided into four logical sub-time slots, each composed of 360 min or 6 h. In these sub-time slots, only desired appliances (with respect to appliance classification are scheduled to raise appliance utility, restricting power consumption by a dynamically modelled power usage limiter that does not only take the electricity consumer into account but also the electricity supplier. Once appliance, time and power usage limiter modelling is done, we use a nature-inspired heuristic algorithm, Binary Particle Swarm Optimization (BPSO, optimally to form schedules with given constraints representing each sub-time slot. These schedules tend to achieve an equilibrium amongst appliance utility and cost effectiveness. For validation of the proposed RSM, we provide a comparative analysis amongst unscheduled electrical load usage, scheduled directly by BPSO and RSM, reflecting user comfort, which is based upon cost effectiveness and appliance utility.

  18. Hybrid Scheduling Model for Independent Grid Tasks

    Directory of Open Access Journals (Sweden)

    J. Shanthini

    2015-01-01

    Full Text Available Grid computing facilitates the resource sharing through the administrative domains which are geographically distributed. Scheduling in a distributed heterogeneous environment is intrinsically very hard because of the heterogeneous nature of resource collection. Makespan and tardiness are two different measures of scheduling, and many of the previous researches concentrated much on reduction of makespan, which measures the machine utilization. In this paper, we propose a hybrid scheduling algorithm for scheduling independent grid tasks with the objective of reducing total weighted tardiness of grid tasks. Tardiness is to measure the due date performance, which has a direct impact on cost for executing the jobs. In this paper we propose BG_ATC algorithm which is a combination of best gap (BG search and Apparent Tardiness Cost (ATC indexing algorithm. Furthermore, we implemented these two algorithms in two different phases of the scheduling process. In addition to that, the comparison was made on results with various benchmark algorithms and the experimental results show that our algorithm outperforms the benchmark algorithms.

  19. Alternative work schedules for female pharmacists.

    Science.gov (United States)

    Mason, N A; Perry, W R; Ryan, M L

    1991-01-01

    The impact of the increased proportion of women in pharmacy is discussed, and two leadership positions for which part-time work schedules were implemented are described. Issues associated with the increased representation of women include pharmacist shortages, loss of future leaders, decreased staff productivity related to inadequate day-care services, and a reduced earning potential of pharmacists. Many of these problems can be addressed by altering benefit packages and work schedules to enable employees to raise children while continuing to work. Specific strategies include legislation, day-care programs, flex time and flex scheduling, telecommuting, and the creation of alternative work schedules or permanent part-time positions. At the University of Michigan, a part-time position that combines faculty and clinical responsibilities has been in place since 1988. At The Washington Hospital Center, one of the three assistant director of pharmacy positions is part-time. The women in both positions have met or exceeded job performance requirements while raising a family. Issues raised by the increasing number of female pharmacists must be addressed by the profession. Part-time work schedules are one strategy for enabling female pharmacists to meet both their family and career responsibilities.

  20. Hybrid stop schedule of urban rail train

    Directory of Open Access Journals (Sweden)

    Zhengmin Tan

    2015-01-01

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

  1. Scheduling Future Water Supply Investments Under Uncertainty

    Science.gov (United States)

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

    2014-12-01

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

  2. Analysis of Transmissions Scheduling with Packet Fragmentation

    Directory of Open Access Journals (Sweden)

    Nir Menakerman

    2001-12-01

    Full Text Available We investigate a scheduling problem in which packets, or datagrams, may be fragmented. While there are a few applications to scheduling with datagram fragmentation, our model of the problem is derived from a scheduling problem present in data over CATV networks. In the scheduling problem datagrams of variable lengths must be assigned (packed into fixed length time slots. One of the capabilities of the system is the ability to break a datagram into several fragments. When a datagram is fragmented, extra bits are added to the original datagram to enable the reassembly of all the fragments. We convert the scheduling problem into the problem of bin packing with item fragmentation, which we define in the following way: we are asked to pack a list of items into a minimum number of unit capacity bins. Each item may be fragmented in which case overhead units are added to the size of every fragment. The cost associated with fragmentation renders the problem NP-hard, therefore an approximation algorithm is needed. We define a version of the well-known Next-Fit algorithm, capable of fragmenting items, and investigate its performance. We present both worst case and average case results and compare them to the case where fragmentation is not allowed.

  3. Communication contention in APN list scheduling algorithm

    Institute of Scientific and Technical Information of China (English)

    TANG XiaoYong; LI KenLi; PADUA Divid

    2009-01-01

    Task scheduling is an essential aspect of parallel process system. This NP-hard problem assumes fully connected homogeneous processors and ignores contention on the communication links. However, as arbitrary processor network (APN), communication contention has a strong influence on the execution time of a parallel application. This paper investigates the Incorporation of contention awareness into task scheduling. The innovation is the idea of dynamically scheduling edges to links, for which we use the earliest finish communication time search algorithm based on shortest-path search method. The other novel idea proposed in this paper is scheduling priority based on recursive rank computation on heterogeneous arbitrary processor network. In the end, to reduce time complexity of algorithm, a parallel algorithm is proposed and speedup O(PPE) is achieved. The comparison study, based on both randomly generated graphs and the graphs of some real applications, shows that our scheduling algorithm significantly surpasses classic and static communication contention awareness algorithm, especially for high data transmission rate parallel application.

  4. Hybrid Scheduling Model for Independent Grid Tasks.

    Science.gov (United States)

    Shanthini, J; Kalaikumaran, T; Karthik, S

    2015-01-01

    Grid computing facilitates the resource sharing through the administrative domains which are geographically distributed. Scheduling in a distributed heterogeneous environment is intrinsically very hard because of the heterogeneous nature of resource collection. Makespan and tardiness are two different measures of scheduling, and many of the previous researches concentrated much on reduction of makespan, which measures the machine utilization. In this paper, we propose a hybrid scheduling algorithm for scheduling independent grid tasks with the objective of reducing total weighted tardiness of grid tasks. Tardiness is to measure the due date performance, which has a direct impact on cost for executing the jobs. In this paper we propose BG_ATC algorithm which is a combination of best gap (BG) search and Apparent Tardiness Cost (ATC) indexing algorithm. Furthermore, we implemented these two algorithms in two different phases of the scheduling process. In addition to that, the comparison was made on results with various benchmark algorithms and the experimental results show that our algorithm outperforms the benchmark algorithms.

  5. SDRAM bus schedule of HDTV video decoder

    Science.gov (United States)

    Wang, Hui; He, Yan L.; Yu, Lu

    2001-12-01

    In this paper, a time division multiplexed task scheduling (TDM) is designed for HDTV video decoder is proposed. There are three tasks: to fetch decoded data from SDRAM for displaying (DIS), read the reference data from SDRAM for motion compensating (REF) and write the motion compensated data back to SDRAM (WB) on the bus. The proposed schedule is based on the novel 4 banks interlaced SDRAM storage structure which results in less overhead on read/write time. Two SDRAM of 64M bits (4Bank×512K×32bit) are used. Compared with two banks, the four banks storage strategy read/write data with 45% less time. Therefore the process data rates for those three tasks are reduced. TDM is developed by round robin scheduling and fixed slot allocating. There are both MB slot and task slot. As a result the conflicts on bus are avoided, and the buffer size is reduced 48% compared with the priority bus scheduling. Moreover, there is a compacted bus schedule for the worst case of stuffing owning to the reduced executing time on tasks. The size of buffer is reduced and the control logic is simplified.

  6. Buffer Size Setting Method for DBR Scheduling

    Science.gov (United States)

    Park, Soonyoung; Woo, Kiyun; Fujimura, Shigeru

    There are many kinds of delay in real-world production systems caused by many reasons including unexpected accidents. A delay of order may inflict great damages for not only itself but also the other affected orders. To prevent these types of loss from frequent delay, DBR (Drum-Buffer-Rope) scheduling method of TOC (Theory of Constraints) manages production schedule observing the state of time buffers. The current buffer size setting method for DBR scheduling is very simple and depends on user's experience. Although it makes possible to keep the due time for production orders, it leads to the redundant production lead time and stock. For DBR scheduling, it is not clear how the buffer size should be set. Therefore, this paper proposes a buffer size setting method for DBR scheduling providing a numerical model for the buffer size. In addition, a simulation gives the result of comparison between the current method and the proposed method, and the effect of the proposed method is shown.

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

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

    Science.gov (United States)

    2012-10-17

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

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

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

    Science.gov (United States)

    Muscettola, Nicola; Smith, Steven S.

    1996-01-01

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

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

    NARCIS (Netherlands)

    Oostrum, van J.M.; Houdenhoven, van M.; Hurink, J.L.; Hans, E.W.; Wullink, G.; Kazemier, G.

    2005-01-01

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

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

    Science.gov (United States)

    2013-05-08

    ... may lead to limited physical or psychological dependence relative to drugs in Schedule III. On the... psychological dependence relative to the drugs or other substances in Schedule III. This finding is based on the... significant additional manpower, capital investment, or recordkeeping burdens. The only additional...

  13. Noncontingent reinforcement: a further examination of schedule effects during treatment.

    Science.gov (United States)

    Wallace, Michele D; Iwata, Brian A; Hanley, Gregory P; Thompson, Rachel H; Roscoe, Eileen M

    2012-01-01

    We conducted 2 studies to determine whether dense and thin NCR schedules exert different influences over behavior and whether these influences change as dense schedules are thinned. In Study 1, we observed that thin as well as dense NCR schedules effectively decreased problem behavior exhibited by 3 individuals. In Study 2, we compared the effects of 2 NCR schedules in multielement designs, one with and the other without an extinction (EXT) component, while both schedules were thinned. Problem behavior remained low as the NCR schedule with EXT was thinned, but either (a) did not decrease initially or (b) subsequently increased as the NCR schedule without EXT was thinned. These results suggest that dense schedules of NCR decrease behavior by altering its motivating operation but that extinction occurs as the NCR schedule is thinned. The benefits and limitations of using dense or thin NCR schedules are discussed.

  14. A scheduling framework applied to digital publishing workflows

    Science.gov (United States)

    Lozano, Wilson; Rivera, Wilson

    2006-02-01

    This paper presents the advances in developing a dynamic scheduling technique suitable for automating digital publishing workflows. Traditionally scheduling in digital publishing has been limited to timing criteria. The proposed scheduling strategy takes into account contingency and priority fluctuations. The new scheduling algorithm, referred to as QB-MUF, gives high priority to jobs with low probability of failing according to artifact recognition and workflow modeling critera. The experimental results show the suitability and efficiency of the scheduling strategy.

  15. A Hybrid Genetic Algorithm for the Job Shop Scheduling Problem

    OpenAIRE

    Gonçalves, José Fernando; Mendes, J. J. M.; Resende, Maurício G. C.

    2005-01-01

    This paper presents a hybrid genetic algorithm for the Job Shop Scheduling problem. The chromosome representation of the problem is based on random keys. The schedules are constructed using a priority rule in which the priorities are defined by the genetic algorithm. Schedules are constructed using a procedure that generates parameterized active schedules. After a schedule is obtained a local search heuristic is applied to improve the solution. The approach is tested on a set o...

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

  17. Optimal Scheduling of Domestic Appliances via MILP

    Directory of Open Access Journals (Sweden)

    Zdenek Bradac

    2014-12-01

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

  18. Effects of 4X4 Block Scheduling

    Directory of Open Access Journals (Sweden)

    R. Brian Cobb

    1999-02-01

    Full Text Available The effects of a 4 X 4 block scheduling program in a middle school on a variety of student measures were investigated. These measures included standardized achievement tests in mathematics, reading, and writing, cumulative and semester grades in middle school and high school, attendance rates, and enrollment rates in advanced high school courses (in mathematics only. The block scheduling program had been in effect for four years allowing analyses of current middle and high school students who had experienced a minimum of one and one-half years of block scheduling while in middle school. The primary research design was a post-test only, matched pairs design. Students were matched on school characteristics, gender, ethnicity, grade level, and 5th grade standardized reading scores. Results were relatively consistent with the extant literature and generally positive.

  19. An introduction to optimal satellite range scheduling

    CERN Document Server

    Vázquez Álvarez, Antonio José

    2015-01-01

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

  20. Deterministic Real-time Thread Scheduling

    CERN Document Server

    Yun, Heechul; Sha, Lui

    2011-01-01

    Race condition is a timing sensitive problem. A significant source of timing variation comes from nondeterministic hardware interactions such as cache misses. While data race detectors and model checkers can check races, the enormous state space of complex software makes it difficult to identify all of the races and those residual implementation errors still remain a big challenge. In this paper, we propose deterministic real-time scheduling methods to address scheduling nondeterminism in uniprocessor systems. The main idea is to use timing insensitive deterministic events, e.g, an instruction counter, in conjunction with a real-time clock to schedule threads. By introducing the concept of Worst Case Executable Instructions (WCEI), we guarantee both determinism and real-time performance.

  1. Scheduling jobs that arrive over time

    Energy Technology Data Exchange (ETDEWEB)

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

    1995-04-06

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

  2. Load scheduling for decentralized CHP plants

    DEFF Research Database (Denmark)

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

    This report considers load scheduling for decentralized combined heat and power plants where the revenue from selling power to the transmission company and the fuel cost may be time-varying. These plants produce both heat and power with a fixed ratio between these outputs. A heat storage facility...... is used to be able to deviate from this restriction. The load scheduling must be performed with only approximate knowledge about the future. At present in Denmark this uncertainty is only associated with the heat demand, but in the future revenues of produced energy and the fuel costs might also...... be uncertain and dependent on time. It is suggested to use a combination of background knowledge of the operator and computer tools to solve the scheduling problem. More specificly it is suggested that the plant is equipped with (i) an automatic on-line system for forecasting the heat demand, (ii...

  3. Simultaneous scheduling of machines and mobile robots

    DEFF Research Database (Denmark)

    Dang, Vinh Quang; Nielsen, Izabela Ewa

    2013-01-01

    This paper deals with the problem of simultaneously scheduling machines and a number of autonomous mobile robots in a flexible manufacturing system (FMS). Besides capability of transporting materials between machines, the considered mobile robots are different from other material handling devices...... in terms of their advanced ability to perform tasks at machines by using their manipulation arms. The mobile robots thus have to be scheduled in relation to scheduling of machines so as to increase the efficiency of the overall system. The performance criterion is to minimize time required to complete all...... tasks or makespan. A heuristic based on genetic algorithm is developed to find the best solution for the problem. A numerical example is investigated to demonstrate results of the proposed approach. The implementation of the proposed approach in a multi-agent system is also generally described....

  4. Distributed job scheduling in MetaCentrum

    Science.gov (United States)

    Tóth, Šimon; Ruda, Miroslav

    2015-05-01

    MetaCentrum - The Czech National Grid provides access to various resources across the Czech Republic. The utilized resource management and scheduling system is based on a heavily modified version of the Torque Batch System. This open source resource manager is maintained in a local fork and was extended to facilitate the requirements of such a large installation. This paper provides an overview of unique features deployed in MetaCentrum. Notably, we describe our distributed setup that encompasses several standalone independent servers while still maintaining full cooperative scheduling across the grid. We also present the benefits of our virtualized infrastructure that enables our schedulers to dynamically request ondemand virtual machines, that are then used to facilitate the varied requirements of users in our system, as well as enabling support for user requested virtual clusters that can be further interconnected using a private VLAN.

  5. Dispatch Scheduling to Maximize Exoplanet Detection

    Science.gov (United States)

    Johnson, Samson; McCrady, Nate; MINERVA

    2016-01-01

    MINERVA is a dedicated exoplanet detection telescope array using radial velocity measurements of nearby stars to detect planets. MINERVA will be a completely robotic facility, with a goal of maximizing the number of exoplanets detected. MINERVA requires a unique application of queue scheduling due to its automated nature and the requirement of high cadence observations. A dispatch scheduling algorithm is employed to create a dynamic and flexible selector of targets to observe, in which stars are chosen by assigning values through a weighting function. I designed and have begun testing a simulation which implements the functions of a dispatch scheduler and records observations based on target selections through the same principles that will be used at the commissioned site. These results will be used in a larger simulation that incorporates weather, planet occurrence statistics, and stellar noise to test the planet detection capabilities of MINERVA. This will be used to heuristically determine an optimal observing strategy for the MINERVA project.

  6. Energy-aware scheduling on multiprocessor platforms

    CERN Document Server

    Li, Dawei

    2014-01-01

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

  7. Enabling Adaptive Grid Scheduling and Resource Management

    CERN Document Server

    Lazarevic, Aleksandar; Prnjat, Ognjen

    2007-01-01

    Wider adoption of the Grid concept has led to an increasing amount of federated computational, storage and visualisation resources being available to scientists and researchers. Distributed and heterogeneous nature of these resources renders most of the legacy cluster monitoring and management approaches inappropriate, and poses new challenges in workflow scheduling on such systems. Effective resource utilisation monitoring and highly granular yet adaptive measurements are prerequisites for a more efficient Grid scheduler. We present a suite of measurement applications able to monitor per-process resource utilisation, and a customisable tool for emulating observed utilisation models. We also outline our future work on a predictive and probabilistic Grid scheduler. The research is undertaken as part of UK e-Science EPSRC sponsored project SO-GRM (Self-Organising Grid Resource Management) in cooperation with BT.

  8. S-CHART - SCHEDULING CHART PROGRAM

    Science.gov (United States)

    Klinkner, E. R.

    1994-01-01

    The Scheduling Chart Program (S-Chart) uses simple menu choices to produce high quality Gantt type scheduling and production time-line charts with minimal data entry requirements. The software produces high quality charts (20, 40, and 80 day options) in 10-20 minutes including start up, data entry, and printing. Reprints take less than one minute. Some of the more significant features are as follows: speed and ease of use with menu driven selections from start to finish, storage and catalogs of all data sets for rapid access and manipulation, compact program size to permit storage of dozens of data sets on the program disc, and creation of ASCII text files of graphs for rapid printing. The final product of the plot routine is an extended ASCII character file which shows the events scheduled and actual work dates. This file may be printed from the program, from DOS, or imported to a word processor for customizing. S-Chart is not intended to take the place of commercial scheduling/project management software. However, it is a simple, somewhat limited Gantt chart plotter and scheduling tracking program with an emphasis on straightforward data entry. There is no complex relationship building between the scheduled events. Dates are entered as dates, not as algebraic functions. All the files of S-Chart, except for the graph picture and the stand-alone executable, were written in 100% dBASE III compatible code. The executable code was created with CLIPPER and the graph picture files are written in ASCII code. S-Chart was implemented on an IBM PC series machine under DOS and requires 215k bytes of memory. The program was developed in 1988.

  9. Research on schedulers for astronomical observatories

    Science.gov (United States)

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

    2012-09-01

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

  10. Long-term home care scheduling

    DEFF Research Database (Denmark)

    Gamst, Mette; Jensen, Thomas Sejr

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

  11. Scheduling projects with multiskill learning effect.

    Science.gov (United States)

    Zha, Hong; Zhang, Lianying

    2014-01-01

    We investigate the project scheduling problem with multiskill learning effect. A new model is proposed to deal with the problem, where both autonomous and induced learning are considered. In order to obtain the optimal solution, a genetic algorithm with specific encoding and decoding schemes is introduced. A numerical example is used to illustrate the proposed model. The computational results show that the learning effect cannot be neglected in project scheduling. By means of determining the level of induced learning, the project manager can balance the project makespan with total cost.

  12. Real-time systems scheduling fundamentals

    CERN Document Server

    Chetto, Maryline

    2014-01-01

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

  13. Scheduling Guide for Program Managers. Revision

    Science.gov (United States)

    1994-07-01

    delivery schedule is often used.) "* Value of time . & A tough and disciplined approach to 7.1 PROGRAM MANAGER’S meeting the published schedule is required...7.3 VALUE OF TIME tal program cost is shown graphically in Figure 7-1. According to the late John H. Richardson, president of Hughes Aircraft Company...consideration. Concentration value of time in decision making all con- on the system or product often overlooks tribute to the manager’s repertoire of good a key

  14. Linear Time Algorithms for Parallel Machine Scheduling

    Institute of Scientific and Technical Information of China (English)

    Zhi Yi TAN; Yong HE

    2007-01-01

    This paper addresses linear time algorithms for parallel machine scheduling problems. We introduce a kind of threshold algorithms and discuss their main features. Three linear time threshold algorithm classes DT, PT and DTm are studied thoroughly. For all classes, we study their best possible algorithms among each class. We also present their application to several scheduling problems.The new algorithms are better than classical algorithms in time complexity and/or worst-case ratio.Computer-aided proof technique is used in the proof of main results, which greatly simplifies the proof and decreases case by case analysis.

  15. Workshop Scheduling in the MRO Context

    Science.gov (United States)

    Rupp, Benjamin; Pauli, Dirk; Feller, Sebastian; Skyttä, Manu

    2010-09-01

    Scheduling is an important task in production planning, as it can significantly increase the productivity of a workshop. In this paper we concentrate on a job-shop problem which arises at workshops of typical MRO service providers. An MRO does not only need to minimize the production time (the makespan) and maximize the plant utilization, it also needs to maximize the service and protection level of its stock. Hence, it has several objective functions which usually contradict each other. In this paper we present the novel CTO algorithm which helps to find a schedule regarding the mentioned objective functions.

  16. Scheduling of Development Projects with Uncertain Iterations

    Institute of Scientific and Technical Information of China (English)

    2001-01-01

    This paper studies the scheduling of design projects in concurrent development process with uncertain num ber of feedback revisions. An optimization based methodology that combines heuristic algorithm, artificial intelligence (fuzzy, genetic algorithm) and scheduling theory is developed. In the algorithm, weighting values of some key factors are defined by genetic algorithm. In addition, fuzzy logic is used to decide the ability coefficients of different roles taken by designers. Moreover, the process of pre-release and feedback revision is realized. Simulation example is a fraction of practical development project, and satisfied results are obtained.

  17. An Augmented Lagrangian Approach for Scheduling Problems

    Science.gov (United States)

    Nishi, Tatsushi; Konishi, Masami

    The paper describes an augmented Lagrangian decomposition and coordination approach for solving single machine scheduling problems to minimize the total weighted tardiness. The problem belongs to the class of NP-hard combinatorial optimization problem. We propose an augmented Lagrangian decomposition and coordination approach, which is commonly used for continuous optimization problems, for solving scheduling problems despite the fact that the problem is nonconvex and non-differentiable. The proposed method shows a good convergence to a feasible solution without heuristically constructing a feasible solution. The performance of the proposed method is compared with that of an ordinary Lagrangian relaxation.

  18. S-Chart - Scheduling-Chart Program

    Science.gov (United States)

    Klinkner, Eric R.

    1990-01-01

    Schedule Chart Program (S-Chart) produces quickly, through array of simple menu choices, high-quality Gantt-type scheduling and production time-line charts with minimal data-entry requirements. Significant features include: speed and ease of use with menu-driven selections from start to finish; storage and catalogs of all sets of data for rapid access and manipulation; compact program to permit storage of dozens of sets of data on program disk; and creation of ASCII text files of graphs for rapid printing. Written in ASCII code.

  19. Real-time systems scheduling 2 focuses

    CERN Document Server

    Chetto, Maryline

    2014-01-01

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

  20. Biopharmaceutical Process Optimization with Simulation and Scheduling Tools

    Directory of Open Access Journals (Sweden)

    Demetri Petrides

    2014-09-01

    Full Text Available Design and assessment activities associated with a biopharmaceutical process are performed at different levels of detail, based on the stage of development that the product is in. Preliminary “back-of-the envelope” assessments are performed early in the development lifecycle, whereas detailed design and evaluation are performed prior to the construction of a new facility. Both the preliminary and detailed design of integrated biopharmaceutical processes can be greatly assisted by the use of process simulators, discrete event simulators or finite capacity scheduling tools. This report describes the use of such tools for bioprocess development, design, and manufacturing. The report is divided into three sections. Section One provides introductory information and explains the purpose of bioprocess simulation. Section Two focuses on the detailed modeling of a single batch bioprocess that represents the manufacturing of a therapeutic monoclonal antibody (MAb. This type of analysis is typically performed by engineers engaged in the development and optimization of such processes. Section Three focuses on production planning and scheduling models for multiproduct plants.

  1. Online Scheduling in Manufacturing A Cumulative Delay Approach

    CERN Document Server

    Suwa, Haruhiko

    2013-01-01

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

  2. Analysis and Optimisation of Hierarchically Scheduled Multiprocessor Embedded Systems

    DEFF Research Database (Denmark)

    Pop, Traian; Pop, Paul; Eles, Petru;

    2008-01-01

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

  3. Automated scheduling and planning from theory to practice

    CERN Document Server

    Ozcan, Ender; Urquhart, Neil

    2013-01-01

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

  4. Advance Resource Provisioning in Bulk Data Scheduling

    Energy Technology Data Exchange (ETDEWEB)

    Balman, Mehmet

    2012-10-01

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

  5. Intelligence amplification framework for enhancing scheduling processes

    NARCIS (Netherlands)

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

    2016-01-01

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

  6. Nonblocking Scheduling for Web Service Transactions

    DEFF Research Database (Denmark)

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

    2007-01-01

    For improved flexibility and concurrent usage existing transaction management models for Web services relax the isolation property of Web service-based transactions. Correctness of the concurrent execution then has to be ensured by commit order-preserving transaction schedulers. However, local...

  7. Scheduling in Engineering, Project, and Production Management

    Directory of Open Access Journals (Sweden)

    Chien-Ho Ko

    2015-01-01

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

  8. Schedule and status of irradiation experiments

    Energy Technology Data Exchange (ETDEWEB)

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

    1997-04-01

    To provide an updated summary of the status of irradiation experiments for the neutron-interactive materials program. The current status of reactor irradiation experiments is presented in tables summarizing the experimental objectives, conditions, and schedule. Currently, the program has two irradiation experiments in reactor; and 8 experiments in the planning or design stages. Postirradiation examination and testing is in progress on 18 experiments.

  9. 76 FR 46856 - Mail Classification Schedule Change

    Science.gov (United States)

    2011-08-03

    ... Mail Classification Schedule Change AGENCY: Postal Regulatory Commission. ACTION: Notice. SUMMARY: The Commission is noticing a recently-filed Postal Service request regarding classification changes to Priority... classification changes pursuant to 39 CFR 3020.90 and 3020.91 concerning Priority Mail packaging.\\1\\ \\1\\...

  10. Intelligence amplification framework for enhancing scheduling processes

    NARCIS (Netherlands)

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

    2016-01-01

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

  11. 17 CFR 257.2 - Schedule.

    Science.gov (United States)

    2010-04-01

    ... property damage Destroy at option after settlement and audit. 12. Tax Records: (a) Copies of schedules... local property or income taxes Destroy at option after settlement and audit. (b) Tax bills from taxing... essential papers related thereto Destroy at option after settlement and audit. (c) Stubs or similar...

  12. 40 CFR 52.1335 - Compliance schedules.

    Science.gov (United States)

    2010-07-01

    ... 40 Protection of Environment 4 2010-07-01 2010-07-01 false Compliance schedules. 52.1335 Section 52.1335 Protection of Environment ENVIRONMENTAL PROTECTION AGENCY (CONTINUED) AIR PROGRAMS (CONTINUED... Effective date Final compliance date Pilot Knob Pelleting Co Pilot Knob, MO V(10 CSR 10-3.050) Oct. 19,...

  13. Crane Scheduling for a Plate Storage

    DEFF Research Database (Denmark)

    Hansen, Jesper; Clausen, Jens

    2002-01-01

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

  14. From schedule push to reality pull

    NARCIS (Netherlands)

    drs. Frans van den Reep

    2009-01-01

    The Internet is changing the way we organise work. It is shifting the requirement for what we call the ‘schedule push’ and the hierarchical organisation that it implies, and therefore it is removing the type of control that is conventionally used to match resources to tasks, and customer demand to

  15. 76 FR 10233 - Schedule of Water Charges

    Science.gov (United States)

    2011-02-24

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

  16. Scheduling sport tournaments using constraint logic programming

    NARCIS (Netherlands)

    Schaerf, A.

    1997-01-01

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

  17. Cross layer scheduling algorithm for LTE Downlink

    DEFF Research Database (Denmark)

    Popovska Avramova, Andrijana; Yan, Ying; Dittmann, Lars

    2012-01-01

    . This paper evaluates a cross layer scheduling algorithm that aims at minimizing the resource utilization. The algorithm makes decisions regarding the channel conditions and the size of transmission buffers and different QoS demands. The simulation results show that the new algorithm improves the resource...

  18. 78 FR 37246 - January 2013 Pay Schedules

    Science.gov (United States)

    2013-06-20

    ...: Tameka Gillis, Pay and Leave, Employee Services, U.S. Office of Personnel Management; (202) 606-2858; FAX... or ST employees covered by a certified SL/ST performance appraisal system and $165,300 (level III of the Executive Schedule) for SL or ST employees covered by an SL/ST performance appraisal system...

  19. Creating Genuine Readers with Flexible Scheduling

    Science.gov (United States)

    Lambert, Nancy Jo

    2017-01-01

    This article describes how Nancy Jo Lambert, a school librarian, implemented a flexible library schedule at elementary schools in which she worked collaboratively with classroom teachers. After observing students removing bookmarks from the middle of their books in order to turn the books in by the due date or because their fixed library schedule…

  20. ALGORITHM FOR SOLVING EXTREME SCHEDULING PROBLEMS

    OpenAIRE

    Gennady A. Berketov

    2015-01-01

    The article considers the original algorithmfor solving the generalized problem ofscheduling theory, based on the branch and bound method. Task schedulingperform works (operations) and restrictions on resources used often occur with scheduling discrete manufacturing operations, optimizing network implementationschedules of scientific, economic or technical projects. Tools to solve suchproblems are included in the decisionsupport system ACS in many businesses.The effectiveness of the proposed ...

  1. Step-by-step cyclic processes scheduling

    DEFF Research Database (Denmark)

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

    2013-01-01

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

  2. Execution Time Estimation for Workflow Scheduling

    NARCIS (Netherlands)

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

    2014-01-01

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

  3. Simplified scheduling for underwater acoustic networks

    NARCIS (Netherlands)

    Kleunen, van Wouter; Meratnia, Nirvana; Havinga, Paul J.M.

    2013-01-01

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

  4. 44 CFR 72.3 - Fee schedule.

    Science.gov (United States)

    2010-10-01

    ... 44 Emergency Management and Assistance 1 2010-10-01 2010-10-01 false Fee schedule. 72.3 Section 72.3 Emergency Management and Assistance FEDERAL EMERGENCY MANAGEMENT AGENCY, DEPARTMENT OF HOMELAND... initial fee, if necessary, will be published as a notice in the Federal Register. (b) For requests...

  5. 5 CFR 293.404 - Retention schedule.

    Science.gov (United States)

    2010-01-01

    ... RECORDS Employee Performance File System Records § 293.404 Retention schedule. (a)(1) Except as provided... in this system, including transfer with the employee who changes positions, shall be as agencies... performance-related documents five years old or less shall be forwarded in the Employee Performance File...

  6. Simplified scheduling for underwater acoustic networks

    NARCIS (Netherlands)

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

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

  7. Evaluation of Scheduling Methods for Multiple Runways

    Science.gov (United States)

    Bolender, Michael A.; Slater, G. L.

    1996-01-01

    Several scheduling strategies are analyzed in order to determine the most efficient means of scheduling aircraft when multiple runways are operational and the airport is operating at different utilization rates. The study compares simulation data for two and three runway scenarios to results from queuing theory for an M/D/n queue. The direction taken, however, is not to do a steady-state, or equilibrium, analysis since this is not the case during a rush period at a typical airport. Instead, a transient analysis of the delay per aircraft is performed. It is shown that the scheduling strategy that reduces the delay depends upon the density of the arrival traffic. For light traffic, scheduling aircraft to their preferred runways is sufficient; however, as the arrival rate increases, it becomes more important to separate traffic by weight class. Significant delay reduction is realized when aircraft that belong to the heavy and small weight classes are sent to separate runways with large aircraft put into the 'best' landing slot.

  8. Schedule and status of irradiation experiments

    Energy Technology Data Exchange (ETDEWEB)

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

    1998-03-01

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

  9. LTE uplink scheduling - Flow level analysis

    NARCIS (Netherlands)

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

    2011-01-01

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

  10. From schedule push to reality pull

    NARCIS (Netherlands)

    Reep, Frans van der

    2009-01-01

    The Internet is changing the way we organise work. It is shifting the requirement for what we call the ‘schedule push’ and the hierarchical organisation that it implies, and therefore it is removing the type of control that is conventionally used to match resources to tasks, and customer demand to s

  11. Split scheduling with uniform setup times.

    NARCIS (Netherlands)

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

    2015-01-01

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

  12. Online Scheduling in Distributed Message Converter Systems

    NARCIS (Netherlands)

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

    2001-01-01

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

  13. Effects of industrialization on working schedules.

    Science.gov (United States)

    Kogi, K

    1976-12-01

    Recent increase in industrialization has resulted in attention being drawn to diversity of working schedules and their interrelation with content of work. The results of joint research revealed that adaptation to industrial jobs is made difficult because of urban conditions and modern work-control systems, such as workers in flexible-working-time systems who apparently favored regular daily working cycles. Long overtime work in smaller undertakings and the spread of shift systems are two important features of industrial work schedules, each being dominant among skilled and non-skilled jobs. Another important facet is the problem of intra-shift work-rest schedules significant for machine operations and vigilance tasks. It is suggested that phases of work that become intolerable are correlated with unnatural work rhythms. More emphasis should thus be laid on both phase-shifted work and non-self-governing work, the key factor being the relevance of attained data to real work in the whole course of schedules of work and rest.

  14. 42 CFR 447.76 - Public schedule.

    Science.gov (United States)

    2010-10-01

    ...) Current premiums, enrollment fees, or similar fees. (2) Current cost sharing charges. (3) The aggregate limit on premiums and cost sharing or just cost sharing. (4) Mechanisms for making payments for required... Cost Sharing Under Section 1916a § 447.76 Public schedule. (a) The State must make available to...

  15. Online Scheduling in Distributed Message Converter Systems

    NARCIS (Netherlands)

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

    2001-01-01

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

  16. Online Scheduling in Distributed Message Converter Systems

    NARCIS (Netherlands)

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

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

  17. 29 CFR 4901.32 - Fee schedule.

    Science.gov (United States)

    2010-07-01

    ... this section. (b) Charges for duplication of records. Charges applicable under this subpart for... of duplication. (c) Other charges. The scheduled fees, set forth in paragraphs (a) and (b) of this section, for furnishing records made available for inspection and duplication represent the direct...

  18. 29 CFR 1952.371 - Developmental schedule.

    Science.gov (United States)

    2010-07-01

    ... inspectors and voluntary compliance personnel will be developed within 6 months of plan approval. (j) The... both safety and health personnel will be reviewed and revised to accurately reflect job functions..., 1977. (m) An inspection scheduling system will be developed for the health program within 6 months...

  19. Reinventing Crew Scheduling at Netherlands Railways

    NARCIS (Netherlands)

    M. Fischetti (Matteo); L.G. Kroon (Leo); G. Timmer (Gerrit); M.J.C.M. Vromans (Michiel); E.J.W. Abbink (Erwin)

    2004-01-01

    textabstractIn this paper we describe the successful application of a sophisticated Operations Research model and the corresponding solution techniques for scheduling the 6,500+ drivers and conductors of the Dutch railway operator NS Reizigers (Netherlands Railways). In 2001 the drivers and conducto

  20. Scheduling parallel jobs with linear speedup

    NARCIS (Netherlands)

    Grigoriev, A.; Uetz, M.J.; Erlebach, T.; Persiano, P.

    2006-01-01

    We consider a scheduling problem where a set of jobs is a-priori distributed over parallel machines. The processing time of any job is dependent on the usage of a scarce renewable resource, e.g. personnel. An amount of $k$ units of that resource can be allocated to the jobs at any time, and the more

  1. Decision support system for vehicle scheduling

    Directory of Open Access Journals (Sweden)

    C. Gaindric

    1999-08-01

    Full Text Available A decision support system (DSS is described to form schedules of traffic from a central warehouse to a set of consumers by cyclic routes. The system may be used by dispatchers at transportation enterprises. The system structure, short description of modules, and algorithms solving the originating problems are presented.

  2. Multimodal Plan Representation for Adaptable BML Scheduling

    NARCIS (Netherlands)

    Reidsma, Dennis; van Welbergen, H.; Zwiers, Jakob; Vilhjálmsson, Hannes Högni; Kopp, Stefan; Marsella, Stacy; Thórisson, Kristinn R.

    In this paper we show how behavior scheduling for Virtual Humans can be viewed as a constraint optimization problem, and how Elckerlyc uses this view to maintain a extensible behavior plan representation that allows one to make micro-adjustments to behaviors while keeping constraints between them

  3. Physician Fee Schedule National Payment Amount File

    Data.gov (United States)

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

  4. Parental Work Schedules and Adolescent Risky Behaviors

    Science.gov (United States)

    Han, Wen-Jui; Miller, Daniel P.; Waldfogel, Jane

    2010-01-01

    Using a large contemporary data set (the National Longitudinal Survey of Youth-Child Supplement), the authors examined the effects of parental work schedules on adolescent risky behaviors at age 13 or 14 and the mechanisms that might explain them. Structural equation modeling suggests mothers who worked more often at night spent significantly less…

  5. Scheduling with communication for multiprocessor computation

    NARCIS (Netherlands)

    Verriet, J.H.

    1998-01-01

    Multiprocessor scheduling houdt zich bezig met de planning van de uitvoering van computer-programma s op een parallelle computer. Een computerprogramma kan worden gezien als een collectie instructies die gegroepeerd zijn in taken. Een parallelle computer is een computer met meerdere processoren

  6. The LSST Scheduler from design to construction

    Science.gov (United States)

    Delgado, Francisco; Reuter, Michael A.

    2016-07-01

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

  7. Scheduling constrained tools using heuristic techniques

    Science.gov (United States)

    Maram, Venkataramana; Rahman, Syariza Abdul; Maram, Sandhya Rani

    2015-12-01

    One of the main challenge to the current manufacturing production planning is to provide schedules of operations to maximize resource utilization to yield highest overall productivity. This is achieved by scheduling available resources to activities. There can be many different real time scenarios with different combination of input resources to produce parts. In this paper, the problem is simplified to single machine with individual process times and due dates to represent the real world scheduling problem. The main objective function is to minimize the total tardiness or late jobs. Nearest greedy method of assignment problem algorithm is used to find the initial solution followed by Simulated Annealing (SA) algorithm for the improvement part. Simulated Annealing is one of the meta-heuristic techniques in solving combinatorial optimization problem. The general purpose Microsoft Visual C++ is used to developed algorithm for finding the best solution. The proposed hybrid approach able to generate best schedule in 7th and optimal in 170th iteration with tardiness 8 and 7 hours respectively.

  8. Schedule and status of irradiation experiments

    Energy Technology Data Exchange (ETDEWEB)

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

    1998-09-01

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

  9. Hybrid Meta-Heuristics for Robust Scheduling

    NARCIS (Netherlands)

    M. Surico (Michele); U. Kaymak (Uzay); D. Naso (David); R. Dekker (Rommert)

    2006-01-01

    textabstractThe production and delivery of rapidly perishable goods in distributed supply networks involves a number of tightly coupled decision and optimization problems regarding the just-in-time production scheduling and the routing of the delivery vehicles in order to satisfy strict customer

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

    Energy Technology Data Exchange (ETDEWEB)

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

    2016-05-01

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

  11. Assessment

    Institute of Scientific and Technical Information of China (English)

    Geoff Brindley

    2005-01-01

    @@ Introduction TERMINOLOGY AND KEY CONCEPTS The term assessment refers to a variety of ways of collecting information on a learner's language ability or achievement. Although testing and assessment are often used interchangeably, the latter is an umbrella term encompassing measurement instruments administered on a ‘one-off’ basis such as tests, as well as qualitative methods of monitoring and recording student learning such as observation, simulations of project work. Assessment is also distinguished from evaluation which is concerned with the overall language programme and not just with what individual students have learnt. Proficiency assessment refers to the assessment of general language abilities acquired by the learner independent of a course of study.This kind of assessment is often done through the administration of standardised commercial language-proficency tests. On the other hand, assessment of achievement aims to establish what a student had learned in relation to a particular course or curriculum (thus frequently carried out by the teacher) .Achievement assesssment may be based either on the specific content of the course or on the course objectives (Hughes 1989).

  12. Alternative vaccination schedule preferences among parents of young children.

    Science.gov (United States)

    Dempsey, Amanda F; Schaffer, Sarah; Singer, Dianne; Butchart, Amy; Davis, Matthew; Freed, Gary L

    2011-11-01

    Increasing numbers of parents use alternative vaccination schedules that differ from the recommended childhood vaccination schedule for their children. We sought to describe national patterns of alternative vaccination schedule use and the potential "malleability" of parents' current vaccination schedule choices. We performed a cross-sectional, Internet-based survey of a nationally representative sample of parents of children 6 months to 6 years of age. Bivariate and multivariate analyses determined associations between demographic and attitudinal factors and alternative vaccination schedule use. The response rate was 61% (N = 748). Of the 13% of parents who reported following an alternative vaccination schedule, most refused only certain vaccines (53%) and/or delayed some vaccines until the child was older (55%). Only 17% reported refusing all vaccines. In multivariate models, nonblack race and not having a regular health care provider for the child were the only factors significantly associated with higher odds of using an alternative schedule. A large proportion of alternative vaccinators (30%) reported having initially followed the recommended vaccination schedule. Among parents following the recommended vaccination schedule, 28% thought that delaying vaccine doses was safer than the schedule they used, and 22% disagreed that the best vaccination schedule to follow was the one recommended by vaccination experts. More than 1 of 10 parents of young children currently use an alternative vaccination schedule. In addition, a large proportion of parents currently following the recommended schedule seem to be "at risk" for switching to an alternative schedule.

  13. Group Elevator Peak Scheduling Based on Robust Optimization Model

    Directory of Open Access Journals (Sweden)

    ZHANG, J.

    2013-08-01

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

  14. Artificial intelligence for the CTA Observatory scheduler

    Science.gov (United States)

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

    2014-08-01

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

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

  16. Scheduling Broadcasts in a Network of Timelines

    KAUST Repository

    Manzoor, Emaad A.

    2015-05-12

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

  17. An Analysis of Shuttle Crew Scheduling Violations

    Science.gov (United States)

    Bristol, Douglas

    2012-01-01

    From the early years of the Space Shuttle program, National Aeronautics and Space Administration (NASA) Shuttle crews have had a timeline of activities to guide them through their time on-orbit. Planners used scheduling constraints to build timelines that ensured the health and safety of the crews. If a constraint could not be met it resulted in a violation. Other agencies of the federal government also have scheduling constraints to ensure the safety of personnel and the public. This project examined the history of Space Shuttle scheduling constraints, constraints from Federal agencies and branches of the military and how these constraints may be used as a guide for future NASA and private spacecraft. This was conducted by reviewing rules and violations with regard to human aerospace scheduling constraints, environmental, political, social and technological factors, operating environment and relevant human factors. This study includes a statistical analysis of Shuttle Extra Vehicular Activity (EVA) related violations to determine if these were a significant producer of constraint violations. It was hypothesized that the number of SCSC violations caused by EVA activities were a significant contributor to the total number of violations for Shuttle/ISS missions. Data was taken from NASA data archives at the Johnson Space Center from Space Shuttle/ISS missions prior to the STS-107 accident. The results of the analysis rejected the null hypothesis and found that EVA violations were a significant contributor to the total number of violations. This analysis could help NASA and commercial space companies understand the main source of constraint violations and allow them to create constraint rules that ensure the safe operation of future human private and exploration missions. Additional studies could be performed to evaluate other variables that could have influenced the scheduling violations that were analyzed.

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

  19. Schedule of factors influencing access to psychiatric treatment in persons with schizophrenia: Validity and pilot testing

    Directory of Open Access Journals (Sweden)

    K Shanivaram Reddy

    2013-01-01

    Full Text Available Background : A substantial proportion of patients with severe mental disorders remain untreated in India. Qualitative research has highlighted the complex interplay of multiple factors that preclude schizophrenia patients in rural Indian settings from accessing treatment. Aims: (a To establish the face and content validities of an interview schedule titled "Schedule of Factors Influencing Access (SOFIAc to Psychiatric Treatment in Persons with Schizophrenia," which comprehensively assesses the factors that prevent schizophrenia patients from accessing psychiatric treatment. (b To assess the feasibility of its administration. Materials and Methods: SOFIAc contains 15 items. This schedule involves three phases of interviewing patients and family members. This was given to 12 experts. They used Likert scales (1=not at all satisfactory to 5=very much satisfactory to rate each item of the schedule. In addition, the experts rated (the same way as above the following five dimensions of the schedule (as a whole separately: A (comprehensiveness of the factors, B (scoring system, C (interviewing method, D (general instructions given to the raters, E (overall schedule. Later on, 10 persons with schizophrenia were interviewed with SOFIAc to test the feasibility of administration. Results: Thirteen items were rated as either satisfactory (score=4 or very much satisfactory (score=5 by all 12 experts; remaining two were rated as 4 or 5 by 11 experts. Regarding comprehensiveness of the factors, scoring methods and general instructions given to the interviewers, all provided scores >4; regarding the method of interviewing, 11 provided the score of >4; with regard to overall interview schedule, all experts provided scores >4. Pilot testing revealed that it took 60 min to administer SOFIAc. Conclusion: SOFIAc has satisfactory face and content validities. It is also feasible to administer SOFIAc.

  20. Study/Services Installation/Implementation Schedule Analysis

    Science.gov (United States)

    1989-11-16

    Scheduled Morbach AB, GE 078 8 08-19-91 08-28-91 Scheduled RheinMain (MAC) 170 8 09-03-91 09-12-91 Scheduled Templehof (MAC) 171 8 09-17-91 09-26-91...94 Scheduled Sembach AB, GE 378 3 01-20-94 01-24-94 Scheduled RheinMain (MAC) 388 3 01-27-94 01-31-94 Scheduled Templehof (MAC) 389 3 02-03-94 02-07