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

Science.gov (United States)

Xu, Zhenzhen; Zou, Yongxing; Kong, Xiangjie

2015-01-01

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

Schedule control in Ling Ao nuclear power project

International Nuclear Information System (INIS)

Xie Ahai

2007-01-01

month; the necessary rate of a month; the quantities to be completed before half period of the project; the quantities to be achieved before the cold function test. Due to a lot of documents and equipment in LANP, it is impossible to present their supply dates one by one in the level 2 project schedule. The rules, in reference to the corresponding construction starting dates, were given to define the supply dates. The good practices of construction schedule control are presented, including draft of a construction program, performance evaluation, specific coordination meeting and Work Load Point application. The schedule control culture is described, that is one core, two criteria, three control mechanisms, four resources to be secured. (author)

Decentralization and mechanism design for online machine scheduling

NARCIS (Netherlands)

Arge, Lars; Heydenreich, Birgit; Müller, Rudolf; Freivalds, Rusins; Uetz, Marc Jochen

We study the online version of the classical parallel machine scheduling problem to minimize the total weighted completion time from a new perspective: We assume that the data of each job, namely its release date $r_j$, its processing time $p_j$ and its weight $w_j$ is only known to the job itself,

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

Energy Technology Data Exchange (ETDEWEB)

Moss, A E

1966-09-01

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

Amendment to historical definitions of NPL deletion start and completion dates

International Nuclear Information System (INIS)

1992-01-01

The memorandum amends two historical CERCLIS (Comprehensive Environmental Response Compensation and Liability Information System) definitions of the NPL (National Priorities List) deletion process start and completion dates in the Superfund Comprehensive Accomplishments Plan (SCAP) Manual of FY 1987 and the Superfund Program Management Manual of FY 1988

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

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

Directory of Open Access Journals (Sweden)

Xueling Zhong

2016-01-01

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

Instant Childhood Immunization Schedule

Science.gov (United States)

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

Single Machine Scheduling and Due Date Assignment with Past-Sequence-Dependent Setup Time and Position-Dependent Processing Time

Directory of Open Access Journals (Sweden)

Chuan-Li Zhao

2014-01-01

Full Text Available This paper considers single machine scheduling and due date assignment with setup time. The setup time is proportional to the length of the already processed jobs; that is, the setup time is past-sequence-dependent (p-s-d. It is assumed that a job's processing time depends on its position in a sequence. The objective functions include total earliness, the weighted number of tardy jobs, and the cost of due date assignment. We analyze these problems with two different due date assignment methods. We first consider the model with job-dependent position effects. For each case, by converting the problem to a series of assignment problems, we proved that the problems can be solved in On4 time. For the model with job-independent position effects, we proved that the problems can be solved in On3 time by providing a dynamic programming algorithm.

Single machine total completion time minimization scheduling with a time-dependent learning effect and deteriorating jobs

Science.gov (United States)

Wang, Ji-Bo; Wang, Ming-Zheng; Ji, Ping

2012-05-01

In this article, we consider a single machine scheduling problem with a time-dependent learning effect and deteriorating jobs. By the effects of time-dependent learning and deterioration, we mean that the job processing time is defined by a function of its starting time and total normal processing time of jobs in front of it in the sequence. The objective is to determine an optimal schedule so as to minimize the total completion time. This problem remains open for the case of -1 < a < 0, where a denotes the learning index; we show that an optimal schedule of the problem is V-shaped with respect to job normal processing times. Three heuristic algorithms utilising the V-shaped property are proposed, and computational experiments show that the last heuristic algorithm performs effectively and efficiently in obtaining near-optimal solutions.

Scheduling of resource-constrained projects

CERN Document Server

Klein, Robert

2000-01-01

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

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

OpenAIRE

木内, 正光

2010-01-01

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

40 CFR 141.702 - Sampling schedules.

Science.gov (United States)

2010-07-01

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

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

Directory of Open Access Journals (Sweden)

Jung Hee Kim

2017-03-01

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

The spirit of St. Lucie: nuclear plant built on schedule

International Nuclear Information System (INIS)

Derrickson, W.B.

1984-01-01

Florida Power and Light Company currently has four nuclear units in operation with St. Lucie Unit 2 being the last to receive an operating license in June, 1983. It's sister Unit 1 received its license in 1976 and has, through 1982, compiled one of the best operating records in the United States. The full power license for St. Lucie Unit 2 was received from the Nuclear Regulatory Commission (NRC) on June 10, 1983, just six years after construction began. The industry average for construction of nuclear plants in this time period is about 10 years. The success of the St. Lucie Unit 2 project can be at least in part attributed to planning the work, accurate and timely reporting of results via valid indicators, well trained and skilled personnel, and most of all, teamwork. During the course of the project the plant was constantly on or near schedule and always ahead of industry averages. This was done despite issuance of numerous regulations by the NRC (TMI), a 1979 hurricane which did considerable damage to the Reactor Auxiliary Building, labor problems, and an NRC schedule review team that determined the best that could be done was to complete the plant a year later. The final price tag is about $1.42 billion, including ''allowance for funds used during construction''. In operation to date the post core loading test program has been completed in less than two months, enabling the plant to be put into commercial operation only two months after its original scheduled date of May 28, 1983exclamation

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.

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.

NRC comprehensive records disposition schedule. Revision 3

International Nuclear Information System (INIS)

1998-02-01

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

NRC comprehensive records disposition schedule. Revision 3

Energy Technology Data Exchange (ETDEWEB)

NONE

1998-02-01

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

Variable Neighborhood Search for Parallel Machines Scheduling Problem with Step Deteriorating Jobs

Directory of Open Access Journals (Sweden)

Wenming Cheng

2012-01-01

Full Text Available In many real scheduling environments, a job processed later needs longer time than the same job when it starts earlier. This phenomenon is known as scheduling with deteriorating jobs to many industrial applications. In this paper, we study a scheduling problem of minimizing the total completion time on identical parallel machines where the processing time of a job is a step function of its starting time and a deteriorating date that is individual to all jobs. Firstly, a mixed integer programming model is presented for the problem. And then, a modified weight-combination search algorithm and a variable neighborhood search are employed to yield optimal or near-optimal schedule. To evaluate the performance of the proposed algorithms, computational experiments are performed on randomly generated test instances. Finally, computational results show that the proposed approaches obtain near-optimal solutions in a reasonable computational time even for large-sized problems.

The contract for the completion and commissioning of Cernavoda NPP - Unit

International Nuclear Information System (INIS)

2001-01-01

On May 18, 2001 the commercial contract for the completion and commissioning of the Cernavoda NPP Unit 2 has been signed by Nuclearelectrica National Company (SNN SA) and its partners, AECL-Canada and ANSALDO-Italy. This contract represents a continuation of the cooperation with AECL-Canada (the owner of the licence and the designer of the nuclear part of Cernavoda NPP Unit1) and ANSALDO-Italy (the designer of the conventional part of Cernavoda NPP Unit1). The completion is scheduled to last for 54 months (4.5 years) since the date the contract takes effect and the nuclear reactor start-up (the first criticality) is scheduled for the 49 th month. The total negotiated cost for the completion was estimated to amount to 689 million dollars, against the 750 million dollars initially estimated. The works at the site will be managed by an integrated staff team of specialized personnel form AECL-Canada (111 positions), ANSALDO-Italy (72 positions) and Romania (1200 positions)

A comparison of due-date selection rules

NARCIS (Netherlands)

Baker, K.R.; Bertrand, J.W.M.

1981-01-01

In sequencing and scheduling models it is usually assumed that due dates represent exogeneous information. In many practical settings, however, due dates can be discretionary, or at least negotiable. Relatively few studies have incorporated discretionary due dates, and even then the rules proposed

A Model of Batch Scheduling for a Single Batch Processor with Additional Setups to Minimize Total Inventory Holding Cost of Parts of a Single Item Requested at Multi-due-date

Science.gov (United States)

Hakim Halim, Abdul; Ernawati; Hidayat, Nita P. A.

2018-03-01

This paper deals with a model of batch scheduling for a single batch processor on which a number of parts of a single items are to be processed. The process needs two kinds of setups, i. e., main setups required before processing any batches, and additional setups required repeatedly after the batch processor completes a certain number of batches. The parts to be processed arrive at the shop floor at the times coinciding with their respective starting times of processing, and the completed parts are to be delivered at multiple due dates. The objective adopted for the model is that of minimizing total inventory holding cost consisting of holding cost per unit time for a part in completed batches, and that in in-process batches. The formulation of total inventory holding cost is derived from the so-called actual flow time defined as the interval between arrival times of parts at the production line and delivery times of the completed parts. The actual flow time satisfies not only minimum inventory but also arrival and delivery just in times. An algorithm to solve the model is proposed and a numerical example is shown.

Optimal Results and Numerical Simulations for Flow Shop Scheduling Problems

Directory of Open Access Journals (Sweden)

Tao Ren

2012-01-01

Full Text Available This paper considers the m-machine flow shop problem with two objectives: makespan with release dates and total quadratic completion time, respectively. For Fm|rj|Cmax, we prove the asymptotic optimality for any dense scheduling when the problem scale is large enough. For Fm‖ΣCj2, improvement strategy with local search is presented to promote the performance of the classical SPT heuristic. At the end of the paper, simulations show the effectiveness of the improvement strategy.

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

Science.gov (United States)

Read, J A

1985-03-01

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

5 CFR 950.801 - Campaign schedule.

Science.gov (United States)

2010-01-01

... 5 Administrative Personnel 2 2010-01-01 2010-01-01 false Campaign schedule. 950.801 Section 950... VOLUNTARY ORGANIZATIONS CFC Timetable § 950.801 Campaign schedule. (a) The Combined Federal Campaign will be.../International and International parts of the Charity List to all local campaigns by a date to be determined by...

Analyzing NPS Scheduling Using OSIRIS

Science.gov (United States)

1993-03-01

School TEACHER SCHEDULE BLOCKS REPORT Date: 2/19/93 Period Name ID Term Days 1234 Adragna , Joe 170401 1 F xx Agrawal, Brij 120101 1 F xx Almquist...LOAD REPORT Date: 3/18/93 Total Max Consec Total Teacher ID Term Classes Classes Stud Adragna , Joe 170401 1 1 1 3 Agrawal, Brij 120101 1 2 2 98 Aiello

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

Maximum Lateness Scheduling on Two-Person Cooperative Games with Variable Processing Times and Common Due Date

Directory of Open Access Journals (Sweden)

Peng Liu

2017-01-01

Full Text Available A new maximum lateness scheduling model in which both cooperative games and variable processing times exist simultaneously is considered in this paper. The job variable processing time is described by an increasing or a decreasing function dependent on the position of a job in the sequence. Two persons have to cooperate in order to process a set of jobs. Each of them has a single machine and their processing cost is defined as the minimum value of maximum lateness. All jobs have a common due date. The objective is to maximize the multiplication of their rational positive cooperative profits. A division of those jobs should be negotiated to yield a reasonable cooperative profit allocation scheme acceptable to them. We propose the sufficient and necessary conditions for the problems to have positive integer solution.

Outage scheduling and implementation

International Nuclear Information System (INIS)

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

1986-01-01

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

Planning and scheduling - A schedule's performance

International Nuclear Information System (INIS)

Whitman, N.M.

1993-01-01

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

Schedule and staffing of a nuclear power project

International Nuclear Information System (INIS)

Polliart, A.J.; Csik, B.

1977-01-01

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

Proposal for the completion of outstanding work on the installation scheduling and alignment of the SDC central calorimeter

International Nuclear Information System (INIS)

Guarino, V.; Hill, N.; Nasiatka, J.; Petereit, E.; Price, L.

1993-01-01

The High Energy Physic Division at Argonne National Laboratory was given the task of developing the procedures, fixtures, and schedules for the final assembly of the barrel and endcap calorimeters for the SDC. The work completed led to some major decision about how and where this assembly work would be done. The primary assembly decision was the feasibility of assembling the major detector components (barrel and endcap sub-assemblies) above ground and lowering them into position in the experimental hall, as opposed to assembling the calorimeter directly in the experimental hall. Due to cost of above ground assembly and schedule changes, the in-hall option was adopted. Although no actual hardware was constructed, many conceptual ideas were formalized and brought to workable solutions as a result of the effort put forth at ANL

Socio-demographic determinants of timely adherence to BCG, Penta3, measles, and complete vaccination schedule in Burkina Faso.

Science.gov (United States)

Schoeps, A; Ouédraogo, N; Kagoné, M; Sié, A; Müller, O; Becher, H

2013-12-17

To identify the determinants of timely vaccination among young children in the North-West of Burkina Faso. This study included 1665 children between 12 and 23 months of age from the Nouna Health and Demographic Surveillance System, born between September 2006 and December 2008. The effect of socio-demographic variables on timely adherence to the complete vaccination schedule was studied in multivariable ordinal logistic regression with 3 distinct endpoints: (i) complete timely adherence, (ii) failure, and (iii) missing vaccination. Three secondary endpoints were timely vaccination with BCG, Penta3, and measles, which were studied with standard multivariable logistic regression. Mothers' education, socio-economic status, season of birth, and area of residence were significantly associated with failure of timely adherence to the complete vaccination schedule. Year of birth, ethnicity, and the number of siblings was significantly related to timely vaccination with Penta3 but not with BCG or measles vaccination. Children living in rural areas were more likely to fail timely vaccination with BCG than urban children (OR=1.79, 95%CI=1.24-2.58 (proximity to health facility), OR=3.02, 95%CI=2.18-4.19 (long distance to health facility)). In contrast, when looking at Penta3 and measles vaccination, children living in rural areas were far less likely to have failed timely vaccinations than urban children. Mother's education positively influenced timely adherence to the vaccination schedule (OR=1.42, 95%CI 1.06-1.89). There was no effect of household size or the age of the mother. Additional health facilities and encouragement of women to give birth in these facilities could improve timely vaccination with BCG. Rural children had an advantage over the urban children in timely vaccination, which is probably attributable to outreach vaccination teams amongst other factors. As urban children rely on their mothers' own initiative to get vaccinated, urban mothers should be

Project Scheduling Based on Risk of Gas Transmission Pipe

Science.gov (United States)

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

2018-03-01

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

Multiple-Machine Scheduling with Learning Effects and Cooperative Games

Directory of Open Access Journals (Sweden)

Yiyuan Zhou

2015-01-01

Full Text Available Multiple-machine scheduling problems with position-based learning effects are studied in this paper. There is an initial schedule in this scheduling problem. The optimal schedule minimizes the sum of the weighted completion times; the difference between the initial total weighted completion time and the minimal total weighted completion time is the cost savings. A multiple-machine sequencing game is introduced to allocate the cost savings. The game is balanced if the normal processing times of jobs that are on the same machine are equal and an equal number of jobs are scheduled on each machine initially.

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

Multi-objective group scheduling optimization integrated with preventive maintenance

Science.gov (United States)

Liao, Wenzhu; Zhang, Xiufang; Jiang, Min

2017-11-01

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

Efficient bounding schemes for the two-center hybrid flow shop scheduling problem with removal times.

Science.gov (United States)

Hidri, Lotfi; Gharbi, Anis; Louly, Mohamed Aly

2014-01-01

We focus on the two-center hybrid flow shop scheduling problem with identical parallel machines and removal times. The job removal time is the required duration to remove it from a machine after its processing. The objective is to minimize the maximum completion time (makespan). A heuristic and a lower bound are proposed for this NP-Hard problem. These procedures are based on the optimal solution of the parallel machine scheduling problem with release dates and delivery times. The heuristic is composed of two phases. The first one is a constructive phase in which an initial feasible solution is provided, while the second phase is an improvement one. Intensive computational experiments have been conducted to confirm the good performance of the proposed procedures.

Robust Optimization for Household Load Scheduling with Uncertain Parameters

Directory of Open Access Journals (Sweden)

Jidong Wang

2018-04-01

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

Resource Constrained Project Scheduling Subject to Due Dates: Preemption Permitted with Penalty

Directory of Open Access Journals (Sweden)

Behrouz Afshar-Nadjafi

2014-01-01

Full Text Available Extensive research works have been carried out in resource constrained project scheduling problem. However, scarce researches have studied the problems in which a setup cost must be incurred if activities are preempted. In this research, we investigate the resource constrained project scheduling problem to minimize the total project cost, considering earliness-tardiness and preemption penalties. A mixed integer programming formulation is proposed for the problem. The resulting problem is NP-hard. So, we try to obtain a satisfying solution using simulated annealing (SA algorithm. The efficiency of the proposed algorithm is tested based on 150 randomly produced examples. Statistical comparison in terms of the computational times and objective function indicates that the proposed algorithm is efficient and effective.

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.

Variable Neighbourhood Search and Mathematical Programming for Just-in-Time Job-Shop Scheduling Problem

Directory of Open Access Journals (Sweden)

Sunxin Wang

2014-01-01

Full Text Available This paper presents a combination of variable neighbourhood search and mathematical programming to minimize the sum of earliness and tardiness penalty costs of all operations for just-in-time job-shop scheduling problem (JITJSSP. Unlike classical E/T scheduling problem with each job having its earliness or tardiness penalty cost, each operation in this paper has its earliness and tardiness penalties, which are paid if the operation is completed before or after its due date. Our hybrid algorithm combines (i a variable neighbourhood search procedure to explore the huge feasible solution spaces efficiently by alternating the swap and insertion neighbourhood structures and (ii a mathematical programming model to optimize the completion times of the operations for a given solution in each iteration procedure. Additionally, a threshold accepting mechanism is proposed to diversify the local search of variable neighbourhood search. Computational results on the 72 benchmark instances show that our algorithm can obtain the best known solution for 40 problems, and the best known solutions for 33 problems are updated.

The complexity behind the date

CERN Multimedia

2009-01-01

For the waiting world, and indeed for most of us here at CERN, ‘the LHC schedule’ simply means the date that the LHC will restart - and we only take notice when that end-date changes. But in fact the schedule is a constantly evolving intricate document coordinating all the repairs, consolidation and commissioning in every part of the machine. So, what actually goes on behind the scenes in timing and planning all the work on one of the most complex scientific instruments ever built?

Vaccinating my way--use of alternative vaccination schedules in New York State.

Science.gov (United States)

Nadeau, Jessica A; Bednarczyk, Robert A; Masawi, Munyaradzi R; Meldrum, Megan D; Santilli, Loretta; Zansky, Shelley M; Blog, Debra S; Birkhead, Guthrie S; McNutt, Louise-Anne

2015-01-01

To identify children vaccinated following an alternative vaccine schedule using immunization information system data and determine the impact of alternative schedule use on vaccine coverage. Children born in New York State, outside New York City, between January 1, 2009 and August 14, 2011 were assessed for vaccination patterns consistent with use of an alternative schedule. Children who by 9 months of age had at least 3 vaccination visits recorded in the statewide mandatory immunization information system after 41 days of age were classified as either attempting to conform to the Centers for Disease Control and Prevention published recommended vaccination schedule or an alternative schedule. The number of vaccination visits and up-to-date status at age 9 months were compared between groups. Of the 222 628 children studied, the proportion of children following an alternative schedule was 25%. These children were significantly less likely to be up-to-date at age 9 months (15%) compared with those conforming to the routine schedule (90%, P Children following an alternative schedule on average had about 2 extra vaccine visits compared with children following a routine schedule (P children in this study appear to be intentionally deviating from the routine schedule. Intentional deviation leads to poor vaccination coverage leaving children vulnerable to infection and increasing the potential for vaccine-preventable disease outbreaks. Copyright © 2015 Elsevier Inc. All rights reserved.

Brief-stimulus presentations on multiform tandem schedules

OpenAIRE

Reed, Phil

1994-01-01

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

Scheduling Agreeable Jobs On A Single Machine To Minimize ...

African Journals Online (AJOL)

Journal of Applied Science and Technology ... (NP) scheduling of number of jobs on a single machine to minimize weighted number of early and tardy jobs where the earliest start times and latest due date are agreeable (i.e. earliest start time must increase in the same sequence as latest due dates) has been considered.

Wasted research when systematic reviews fail to provide a complete and up-to-date evidence synthesis: the example of lung cancer

OpenAIRE

Cr?quit, Perrine; Trinquart, Ludovic; Yavchitz, Am?lie; Ravaud, Philippe

2016-01-01

Background Multiple treatments are frequently available for a given condition, and clinicians and patients need a comprehensive, up-to-date synthesis of evidence for all competing treatments. We aimed to quantify the waste of research related to the failure of systematic reviews to provide a complete and up-to-date evidence synthesis over time. Methods We performed a series of systematic overviews and networks of randomized trials assessing the gap between evidence covered by systematic revie...

Preliminary ITER cost and schedule estimates

International Nuclear Information System (INIS)

1990-01-01

The cost, manpower requirements, and schedule estimates for the realization of the ITER tokamak have been studied during the Conceptual Design Activities, as a result of work by the ITER Management Committee. This work was completed during the January-March, 1990 joint work session, and is presented in this report. A possible schedule shows completion of the engineering design phase in 1995, with 180 professionals, at a cost of about $250M. The construction would be completed in 2004 with a rise in professional staff to 300, and a total cost of $4900M. The machine would be operable over an 18-year period, at an annual operating cost averaging $290M. 2 figs

76 FR 10233 - Schedule of Water Charges

Science.gov (United States)

2011-02-24

... DELAWARE RIVER BASIN COMMISSION 18 CFR Part 420 Schedule of Water Charges AGENCY: Delaware River..., Part III, Basin Regulations--Water Supply Charges. Accordingly, the Commission's water charging rates..., 2011. Effective Date: February 24, 2011. FOR FURTHER INFORMATION CONTACT: For questions about the water...

Topology-based hierarchical scheduling using deficit round robin

DEFF Research Database (Denmark)

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

2009-01-01

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

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

29 CFR 510.10 - Table of wage rates and effective dates.

Science.gov (United States)

2010-07-01

... REGULATIONS IMPLEMENTATION OF THE MINIMUM WAGE PROVISIONS OF THE 1989 AMENDMENTS TO THE FAIR LABOR STANDARDS ACT IN PUERTO RICO Schedule of Minimum Wage Rates Applicable in Puerto Rico § 510.10 Table of wage rates and effective dates. (a) The following table provides effective dates of minimum wage increases...

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.

50 CFR 34.6 - Schedule of appraisals.

Science.gov (United States)

2010-10-01

... Secretary shall make fair market value appraisals of areas administered by the Service within five years... reappraised on a schedule of at least once every five years. Until areas are appraised, the fair market value... fee lands added to such areas after that date shall be on the basis of fair market value. ...

Sort-Mid tasks scheduling algorithm in grid computing.

Science.gov (United States)

Reda, Naglaa M; Tawfik, A; Marzok, Mohamed A; Khamis, Soheir M

2015-11-01

Scheduling tasks on heterogeneous resources distributed over a grid computing system is an NP-complete problem. The main aim for several researchers is to develop variant scheduling algorithms for achieving optimality, and they have shown a good performance for tasks scheduling regarding resources selection. However, using of the full power of resources is still a challenge. In this paper, a new heuristic algorithm called Sort-Mid is proposed. It aims to maximizing the utilization and minimizing the makespan. The new strategy of Sort-Mid algorithm is to find appropriate resources. The base step is to get the average value via sorting list of completion time of each task. Then, the maximum average is obtained. Finally, the task has the maximum average is allocated to the machine that has the minimum completion time. The allocated task is deleted and then, these steps are repeated until all tasks are allocated. Experimental tests show that the proposed algorithm outperforms almost other algorithms in terms of resources utilization and makespan.

Increasing Completion of Classroom Routines through the Use of Picture Activity Schedules

Science.gov (United States)

Watson, Kamille J.; DiCarlo, Cynthia F.

2016-01-01

Teachers spend the first few days of school teaching routines to children that will help transitions in the classroom between different activities. When children have difficulty, they move more slowly and/or require teacher prompting. A picture activity schedule intervention (Breitfelder in Teach Except Child Plus 4(5):2-15, 2008; Bryan and Gast…

77 FR 42332 - Large Power Transformers From Korea; Revised Schedule for the Subject Investigation

Science.gov (United States)

2012-07-18

... INTERNATIONAL TRADE COMMISSION [Investigation No. 731-TA-1189 (Final)] Large Power Transformers From Korea; Revised Schedule for the Subject Investigation AGENCY: United States International Trade Commission. ACTION: Notice. DATES: Effective Date: July 12, 2012. FOR FURTHER INFORMATION CONTACT: Edward...

Declarative Modeling for Production Order Portfolio Scheduling

Directory of Open Access Journals (Sweden)

Banaszak Zbigniew

2014-12-01

Full Text Available A declarative framework enabling to determine conditions as well as to develop decision-making software supporting small- and medium-sized enterprises aimed at unique, multi-project-like and mass customized oriented production is discussed. A set of unique production orders grouped into portfolio orders is considered. Operations executed along different production orders share available resources following a mutual exclusion protocol. A unique product or production batch is completed while following a given activity’s network order. The problem concerns scheduling a newly inserted project portfolio subject to constraints imposed by a multi-project environment The answers sought are: Can a given project portfolio specified by its cost and completion time be completed within the assumed time period in a manufacturing system in hand? Which manufacturing system capability guarantees the completion of a given project portfolio ordered under assumed cost and time constraints? The considered problems regard finding a computationally effective approach aimed at simultaneous routing and allocation as well as batching and scheduling of a newly ordered project portfolio subject to constraints imposed by a multi-project environment. The main objective is to provide a declarative model enabling to state a constraint satisfaction problem aimed at multi-project-like and mass customized oriented production scheduling. Multiple illustrative examples are discussed.

The local–global conjecture for scheduling with non-linear cost

NARCIS (Netherlands)

Bansal, N.; Dürr, C.; Thang, N.K.K.; Vásquez, Ó.C.

2017-01-01

We consider the classical scheduling problem on a single machine, on which we need to schedule sequentially n given jobs. Every job j has a processing time pj and a priority weight wj, and for a given schedule a completion time Cj. In this paper, we consider the problem of minimizing the objective

A transportation-scheduling system for managing silvicultural projects

Science.gov (United States)

Jorge F. Valenzuela; H. Hakan Balci; Timothy McDonald

2005-01-01

A silvicultural project encompasses tasks such as sitelevel planning, regeneration, harvestin, and stand-tending treatments. an essential problem in managing silvicultural projects is to efficiently schedule the operations while considering project task due dates and costs of moving scarce resources to specific job locations. Transportation costs represent a...

Scheduling the scheduling task : a time management perspective on scheduling

NARCIS (Netherlands)

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

2013-01-01

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

Deadline based scheduling for data-intensive applications in clouds

Institute of Scientific and Technical Information of China (English)

Fu Xiong; Cang Yeliang; Zhu Lipeng; Hu Bin; Deng Song; Wang Dong

2016-01-01

Cloud computing emerges as a new computing pattern that can provide elastic services for any users around the world.It provides good chances to solve large scale scientific problems with fewer efforts.Application deployment remains an important issue in clouds.Appropriate scheduling mechanisms can shorten the total completion time of an application and therefore improve the quality of service (QoS) for cloud users.Unlike current scheduling algorithms which mostly focus on single task allocation,we propose a deadline based scheduling approach for data-intensive applications in clouds.It does not simply consider the total completion time of an application as the sum of all its subtasks' completion time.Not only the computation capacity of virtual machine (VM) is considered,but also the communication delay and data access latencies are taken into account.Simulations show that our proposed approach has a decided advantage over the two other algorithms.

Updating Linear Schedules with Lowest Cost: a Linear Programming Model

Science.gov (United States)

Biruk, Sławomir; Jaśkowski, Piotr; Czarnigowska, Agata

2017-10-01

Many civil engineering projects involve sets of tasks repeated in a predefined sequence in a number of work areas along a particular route. A useful graphical representation of schedules of such projects is time-distance diagrams that clearly show what process is conducted at a particular point of time and in particular location. With repetitive tasks, the quality of project performance is conditioned by the ability of the planner to optimize workflow by synchronizing the works and resources, which usually means that resources are planned to be continuously utilized. However, construction processes are prone to risks, and a fully synchronized schedule may expire if a disturbance (bad weather, machine failure etc.) affects even one task. In such cases, works need to be rescheduled, and another optimal schedule should be built for the changed circumstances. This typically means that, to meet the fixed completion date, durations of operations have to be reduced. A number of measures are possible to achieve such reduction: working overtime, employing more resources or relocating resources from less to more critical tasks, but they all come at a considerable cost and affect the whole project. The paper investigates the problem of selecting the measures that reduce durations of tasks of a linear project so that the cost of these measures is kept to the minimum and proposes an algorithm that could be applied to find optimal solutions as the need to reschedule arises. Considering that civil engineering projects, such as road building, usually involve less process types than construction projects, the complexity of scheduling problems is lower, and precise optimization algorithms can be applied. Therefore, the authors put forward a linear programming model of the problem and illustrate its principle of operation with an example.

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

Directory of Open Access Journals (Sweden)

Chandramouli Anandaraman

2011-10-01

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

Sort-Mid tasks scheduling algorithm in grid computing

Directory of Open Access Journals (Sweden)

Naglaa M. Reda

2015-11-01

Full Text Available Scheduling tasks on heterogeneous resources distributed over a grid computing system is an NP-complete problem. The main aim for several researchers is to develop variant scheduling algorithms for achieving optimality, and they have shown a good performance for tasks scheduling regarding resources selection. However, using of the full power of resources is still a challenge. In this paper, a new heuristic algorithm called Sort-Mid is proposed. It aims to maximizing the utilization and minimizing the makespan. The new strategy of Sort-Mid algorithm is to find appropriate resources. The base step is to get the average value via sorting list of completion time of each task. Then, the maximum average is obtained. Finally, the task has the maximum average is allocated to the machine that has the minimum completion time. The allocated task is deleted and then, these steps are repeated until all tasks are allocated. Experimental tests show that the proposed algorithm outperforms almost other algorithms in terms of resources utilization and makespan.

Scheduling by positional completion times: analysis of a two-stage flow shop problem with a batching machine

NARCIS (Netherlands)

Hoogeveen, J.A.; Velde, van de S.L.

1998-01-01

We consider a scheduling problem introduced by Ahmadi et al., Batching and scheduling jobs on batch and discrete processors, Operation Research 40 (1992) 750–763, in which each job has to be prepared before it can be processed. The preparation is performed by a batching machine; it can prepare at

Application of Tabu Search Algorithm in Job Shop Scheduling

Directory of Open Access Journals (Sweden)

Betrianis Betrianis

2010-10-01

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

Influence of intravenous self-administered psychomotor stimulants on performance of rhesus monkeys in a multiple schedule paradigm.

Science.gov (United States)

Hoffmeister, F

1980-01-01

Rhesus monkeys were trained to complete three multiple schedules. The schedules consisted of three components: a fixed interval (component 1), a variable interval (component 2), and a fixed ratio (component 3). During components 1 and 2, pressing lever 1 was always reinforced by food delivery. During component 3, pressing lever 2 resulted in either food delivery or intravenous infusions of saline solution, solutions of cocaine, of d-amphetamine, of phenmetrazine, or fenetylline. In schedule I, animals were presented with all three components independent of key-pressing behavior during components 1 and 2. In schedule II the availability of component 2 was dependent on completion of component 1. Component 3 was made available only on completion of component 2. Noncompletion of components 1 or 2 resulted in time-out of 15 and 10 min, respectively. Schedule III was identical with schedule II, except that in schedule III the completion of components was indicated only by a change in the lever lights. The influence of self-administered drugs on behavior in all three components was evaluated. Self-administration of psychomotor stimulants impaired the performance of animals and delayed completion of components 1 and 2 of schedules I, II, and III. The effects on behavior were similar with low drug intake in schedule III, moderate intake in schedule II, and high drug intake in schedule I. These effects were strong with self-administration of phenmetrazine, moderate with self-administration of cocaine and d-amphetamine, and weak with self-administration of fenetylline.

Parallel-Machine Scheduling with Time-Dependent and Machine Availability Constraints

Directory of Open Access Journals (Sweden)

Cuixia Miao

2015-01-01

Full Text Available We consider the parallel-machine scheduling problem in which the machines have availability constraints and the processing time of each job is simple linear increasing function of its starting times. For the makespan minimization problem, which is NP-hard in the strong sense, we discuss the Longest Deteriorating Rate algorithm and List Scheduling algorithm; we also provide a lower bound of any optimal schedule. For the total completion time minimization problem, we analyze the strong NP-hardness, and we present a dynamic programming algorithm and a fully polynomial time approximation scheme for the two-machine problem. Furthermore, we extended the dynamic programming algorithm to the total weighted completion time minimization problem.

Aeon: Synthesizing Scheduling Algorithms from High-Level Models

Science.gov (United States)

Monette, Jean-Noël; Deville, Yves; van Hentenryck, Pascal

This paper describes the aeon system whose aim is to synthesize scheduling algorithms from high-level models. A eon, which is entirely written in comet, receives as input a high-level model for a scheduling application which is then analyzed to generate a dedicated scheduling algorithm exploiting the structure of the model. A eon provides a variety of synthesizers for generating complete or heuristic algorithms. Moreover, synthesizers are compositional, making it possible to generate complex hybrid algorithms naturally. Preliminary experimental results indicate that this approach may be competitive with state-of-the-art search algorithms.

76 FR 39159 - Schedule for Rating Disabilities; The Digestive System

Science.gov (United States)

2011-07-05

... of this change is to incorporate medical advances that have occurred since the last review, insert current medical terminology, and provide clear criteria. DATES: Comments must be received by VA on or... the rating schedule, and implement current medical criteria and terminology that reflect recent...

7 CFR 201.22 - Date of test.

Science.gov (United States)

2010-01-01

... REGULATIONS Labeling Agricultural Seeds § 201.22 Date of test. (a) The label shall show the month and year in which the germination test was completed. No more than 5 calendar months shall have elapsed between the last day of the month in which the germination test was completed and the date of transportation or...

Scheduling with target start times

NARCIS (Netherlands)

Hoogeveen, J.A.; Velde, van de S.L.; Klein Haneveld, W.K.; Vrieze, O.J.; Kallenberg, L.C.M.

1997-01-01

We address the single-machine problem of scheduling n independent jobs subject to target start times. Target start times are essentially release times that may be violated at a certain cost. The goal is to minimize an objective function that is composed of total completion time and maximum

Modeling Change in Project Duration and Completion

DEFF Research Database (Denmark)

Wiltshire, Travis; Butner, Jonathan E.; Pirtle, Zachary

2017-01-01

In complex work domains and organizations, understanding scheduleing dynamics can ensure objectives are reached and delays are mitigated. In the current paper, we examine the scheduling dynamics for NASA’s Exploration Flight Test 1 (EFT-1) activities. For this examination, we specifically modeled...... simultaneous change in percent complete and estimated duration for a given project as they were included in monthly reports over time. In short, we utilized latent change score mixture modeling to extract the attractor dynamics within the scheduling data. We found three primarily patterns: an attractor at low...

A Mathematical Model for Scheduling a Batch Processing Machine with Multiple Incompatible Job Families, Non-identical Job dimensions, Non-identical Job sizes, Non-agreeable release times and due dates

International Nuclear Information System (INIS)

Ramasubramaniam, M; Mathirajan, M

2013-01-01

The paper addresses the problem scheduling a batch processing machine with multiple incompatible job families, non-identical job dimensions, non-identical job sizes and non-agreeable release dates to minimize makespan. The research problem is solved by proposing a mixed integer programming model that appropriately takes into account the parameters considered in the problem. The proposed is validated using a numerical example. The experiment conducted show that the model can pose significant difficulties in solving the large scale instances. The paper concludes by giving the scope for future work and some alternative approaches one can use for solving these class of problems.

Construction completion report

International Nuclear Information System (INIS)

1990-01-01

This Construction Completion Report documents the major construction projects at the Waste Isolation Pilot Plant (WIPP) site and related information on contracts, schedules, and other areas which affected construction. This report is not intended to be an exhaustive detailed analysis of construction, but is a general overview and summary of the WIPP construction. 10 refs., 29 figs

FLOWSHOP SCHEDULING USING A NETWORK APPROACH ...

African Journals Online (AJOL)

eobe

time when the last job completes on the last machine. The objective ... more jobs in a permutation flow shop scheduling problem ... processing time of a job on a machine is zero, it ..... hybrid flow shops with sequence dependent setup times ...

Bullying Predicts Reported Dating Violence and Observed Qualities in Adolescent Dating Relationships.

Science.gov (United States)

Ellis, Wendy E; Wolfe, David A

2015-10-01

The relationship between reported bullying, reported dating violence, and dating relationship quality measured through couple observations was examined. Given past research demonstrating similarity between peer and dating contexts, we expected that bullying would predict negative dating experiences. Participants with dating experience (n = 585; 238 males, M(age) = 15.06) completed self-report assessments of bullying and dating violence perpetration and victimization. One month later, 44 opposite-sex dyads (M(age) = 15.19) participated in behavioral observations. In 10-min sessions, couples were asked to rank and discuss areas of relationship conflict while being video-recorded. Qualities of the relationship were later coded by trained observers. Regression analysis revealed that bullying positively predicted dating violence perpetration and victimization. Self-reported bullying also predicted observations of lower relationship support and higher withdrawal. Age and gender interactions further qualified these findings. The bullying of boys, but not girls, was significantly related to dating violence perpetration. Age interactions showed that bullying was positively predictive of dating violence perpetration and victimization for older, but not younger adolescents. Positive affect was also negatively predicted by bullying, but only for girls. These findings add to the growing body of evidence that adolescents carry forward strategies learned in the peer context to their dating relationships. © The Author(s) 2014.

Interface between the production plan and the master production schedule in assembly environments

OpenAIRE

Moya Navarro, Marcos; Sánchez Brenes, Magaly

2012-01-01

In a production environment there is a direct relationship between the market and the manufacturing process of goods.When production is immersed in an assembly environment, the process of production planning and scheduling becomes complex, and the enterprises have the risk of losing competitive advantages in terms of not meeting delivery dates and production high costs. Linear programming has become an appropriate tool for production planning and scheduling in complex manufacturing environmen...

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

Science.gov (United States)

2012-11-09

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

Cbs (Contrastrain Based Schedulling Adalah Faktor Penentu Keberhasilan Perusahanan Printing

Directory of Open Access Journals (Sweden)

Hendra Achmadi

2010-06-01

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

A Monte Carlo approach to combating delayed completion of ...

African Journals Online (AJOL)

The objective of this paper is to unveil the relevance of Monte Carlo critical path analysis in resolving problem of delays in scheduled completion of development projects. Commencing with deterministic network scheduling, Monte Carlo critical path analysis was advanced by assigning probability distributions to task times.

Project schedule and cost estimate report

International Nuclear Information System (INIS)

1988-03-01

All cost tables represent obligation dollars, at both a constant FY 1987 level and an estimated escalation level, and are based on the FY 1989 DOE Congressional Budget submittal of December 1987. The cost tables display the total UMTRA Project estimated costs, which include both Federal and state funding. The Total Estimated Cost (TEC) for the UMTRA Project is approximately $992.5 million (in 1987 escalated dollars). Project schedules have been developed that provide for Project completion by September 1994, subject to Congressional approval extending DOE's authorization under Public Law 95-604. The report contains site-specific demographic data, conceptual design assumptions, preliminary cost estimates, and site schedules. A general project overview is also presented, which includes a discussion of the basis for the schedule and cost estimates, contingency assumptions, work breakdown structure, and potential project risks. The schedules and cost estimates will be revised as necessary to reflect appropriate decisions relating to relocation of certain tailings piles, or other special design considerations or circumstances (such as revised EPA groundwater standards), and changes in the Project mission. 27 figs', 97 tabs

Project Scheduling Heuristics-Based Standard PSO for Task-Resource Assignment in Heterogeneous Grid

OpenAIRE

Chen, Ruey-Maw; Wang, Chuin-Mu

2011-01-01

The task scheduling problem has been widely studied for assigning resources to tasks in heterogeneous grid environment. Effective task scheduling is an important issue for the performance of grid computing. Meanwhile, the task scheduling problem is an NP-complete problem. Hence, this investigation introduces a named “standard“ particle swarm optimization (PSO) metaheuristic approach to efficiently solve the task scheduling problems in grid. Meanwhile, two promising heuristics based on multimo...

7 CFR 201.30a - Date of test.

Science.gov (United States)

2010-01-01

... REGULATIONS Labeling Vegetable Seeds § 201.30a Date of test. When the percentage of germination is required to be shown, the label shall show the month and year in which the germination test was completed. No... germination test was completed and the date of transportation or delivery for transportation in interstate...

Organization of the construction and schedule of realization

International Nuclear Information System (INIS)

Szerovay, Antal; Vogel, Oszkar

1988-01-01

The four units of the Paks nuclear power plant with all the auxiliary and service facilities were constructed between 1974 and 1987. Major features of building activities, types of buildings classified according to the connection between the facility and the technology are listed. Processes and structures applied to the construction of the main reactor building are mentioned emphasizing the importance of up-to-date building methods. To move the large equipment into the reactor building Potain cranes of 400 Mp were used. As a result of adequate schedule the auxiliary buildings could be used as preparatory buildings during the construction of the plant. The energy and material supply, the schedule of the construction works are discussed. (V.N.) 6 refs.; 5 figs

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

Science.gov (United States)

Wu, Zuobao; Weng, Michael X

2005-04-01

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

The Effects of Work-Reinforcer Schedules on Performance and Preference in Students with Autism

Science.gov (United States)

Bukala, Magdalena; Hu, Meng Yao; Lee, Ronald; Ward-Horner, John C.; Fienup, Daniel M.

2015-01-01

This study investigated performance under and preference for continuous and discontinuous work-reinforcer schedules in 3 students who had been diagnosed with autism. Under continuous schedules, participants completed all work and consumed all reinforcers in contiguous units. Under discontinuous schedules, work and reinforcer access were broken up…

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.

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

Directory of Open Access Journals (Sweden)

Bożek Andrzej

2016-03-01

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

Constraint-based job shop scheduling with ILOG SCHEDULER

NARCIS (Netherlands)

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

1998-01-01

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

Auspicious birth dates among Chinese in California.

Science.gov (United States)

Almond, Douglas; Chee, Christine Pal; Sviatschi, Maria Micaela; Zhong, Nan

2015-07-01

The number eight is considered lucky in Chinese culture, e.g. the Beijing Olympics began at 8:08 pm on 8/8/2008. Given the potential for discretion in selecting particular dates of labor induction or scheduled Cesarean section (C-section), we consider whether Chinese-American births in California occur disproportionately on the 8th, 18th, or 28th day of the month. We find 2.3% "too many" Chinese births on these auspicious birth dates, whereas Whites show no corresponding increase. The increase in Chinese births is driven by higher parity C-sections: the number of repeat C-sections is 6% "too high" on auspicious birth dates. Sons born to Chinese parents account for the entire increase; daughter deliveries do not seem to be timed to achieve "lucky" birth dates. We also find avoidance of repeat C-section deliveries on the 4th, 14th, and 24th of the month, considered unlucky in Chinese culture. Finally, we replicate earlier work finding that Friday the 13th delivery dates are avoided and document a particularly large decrease among Chinese. For Whites and Chinese in California, mothers with higher levels of education are particularly likely to avoid delivering on the 13th. Copyright © 2015 Elsevier B.V. All rights reserved.

Simulation of less master production schedule nervousness model

OpenAIRE

Herrera , Carlos; Thomas , André

2009-01-01

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

A Market-Based Approach to Multi-factory Scheduling

Science.gov (United States)

Vytelingum, Perukrishnen; Rogers, Alex; MacBeth, Douglas K.; Dutta, Partha; Stranjak, Armin; Jennings, Nicholas R.

In this paper, we report on the design of a novel market-based approach for decentralised scheduling across multiple factories. Specifically, because of the limitations of scheduling in a centralised manner - which requires a center to have complete and perfect information for optimality and the truthful revelation of potentially commercially private preferences to that center - we advocate an informationally decentralised approach that is both agile and dynamic. In particular, this work adopts a market-based approach for decentralised scheduling by considering the different stakeholders representing different factories as self-interested, profit-motivated economic agents that trade resources for the scheduling of jobs. The overall schedule of these jobs is then an emergent behaviour of the strategic interaction of these trading agents bidding for resources in a market based on limited information and their own preferences. Using a simple (zero-intelligence) bidding strategy, we empirically demonstrate that our market-based approach achieves a lower bound efficiency of 84%. This represents a trade-off between a reasonable level of efficiency (compared to a centralised approach) and the desirable benefits of a decentralised solution.

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

75 FR 5620 - New Date for April 2010 Customs Brokers License Examination

Science.gov (United States)

2010-02-03

... types of infractions. In the case of an applicant for an individual broker's license, section 641... regularly scheduled examination date conflicts with a national holiday, religious observance, or other... (April 5) coincides with the observance of Passover. In consideration of this conflict with Passover, CBP...

ESR dating of fault rocks

International Nuclear Information System (INIS)

Lee, Hee Kwon

2002-03-01

Past movement on faults can be dated by measurement of the intensity of ESR signals in quartz. These signals are reset by local lattice deformation and local frictional heating on grain contacts at the time of fault movement. The ESR signals then trow back as a result of bombardment by ionizing radiation from surrounding rocks. The age is obtained from the ratio of the equivalent dose, needed to produce the observed signal, to the dose rate. Fine grains are more completely reset during faulting, and a plot of age vs grain size shows a plateau for grains below critical size : these grains are presumed to have been completely zeroed by the last fault activity. We carried out ESR dating of fault rocks collected from the Yangsan fault system. ESR dates from the this fault system range from 870 to 240 ka. Results of this research suggest that long-term cyclic fault activity continued into the pleistocene

ESR dating of fault rocks

Energy Technology Data Exchange (ETDEWEB)

Lee, Hee Kwon [Kangwon National Univ., Chuncheon (Korea, Republic of)

2002-03-15

Past movement on faults can be dated by measurement of the intensity of ESR signals in quartz. These signals are reset by local lattice deformation and local frictional heating on grain contacts at the time of fault movement. The ESR signals then trow back as a result of bombardment by ionizing radiation from surrounding rocks. The age is obtained from the ratio of the equivalent dose, needed to produce the observed signal, to the dose rate. Fine grains are more completely reset during faulting, and a plot of age vs grain size shows a plateau for grains below critical size : these grains are presumed to have been completely zeroed by the last fault activity. We carried out ESR dating of fault rocks collected from the Yangsan fault system. ESR dates from the this fault system range from 870 to 240 ka. Results of this research suggest that long-term cyclic fault activity continued into the pleistocene.

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)

Program Costs and Student Completion

Science.gov (United States)

Manning, Terri M.; Crosta, Peter M.

2014-01-01

Community colleges are under pressure to increase completion rates, prepare students for the workplace, and contain costs. Colleges need to know the financial implications of what are often perceived as routine decisions: course scheduling, program offerings, and the provision of support services. This chapter presents a methodology for estimating…

Model Integrasi Penjadwalan Produksi Batch dan Penjadwalan Perawatan dengan Kendala Due Date

Directory of Open Access Journals (Sweden)

Zahedi .

2014-01-01

Full Text Available This paper discusses the integration model of batch production and preventive maintenance scheduling on a single machine producing an item to be delivered at a common due date. The machine is a deteriorating machine that requires preventive maintenance to ensure the availability of the machine at a desired service level. Decision variables of the model are the number of preventive maintenances, the schedule, length of production runs, as well as the number of batches, batch sizes and the production schedule of the resulting batches for each production run. The objective function of the model is to minimize the total cost consisting of inventory costs during parts processing, setup cost and cost of preventive maintenance. The results show three important points: First, the sequence of optimal batches always follows the SPT (short processing time. Second, variation of preventive maintenance unit cost does not influence the sequence of batches. Third, the first production run length from production starting time is smaller than the next production run length and this pattern continues until the due date. When in process inventory unit cost is increased, the pattern will continue until a specified cost limit, and beyond the limit the pattern will change to be the opposite pattern.

An Improved Multiobjective PSO for the Scheduling Problem of Panel Block Construction

Directory of Open Access Journals (Sweden)

Zhi Yang

2016-01-01

Full Text Available Uncertainty is common in ship construction. However, few studies have focused on scheduling problems under uncertainty in shipbuilding. This paper formulates the scheduling problem of panel block construction as a multiobjective fuzzy flow shop scheduling problem (FSSP with a fuzzy processing time, a fuzzy due date, and the just-in-time (JIT concept. An improved multiobjective particle swarm optimization called MOPSO-M is developed to solve the scheduling problem. MOPSO-M utilizes a ranked-order-value rule to convert the continuous position of particles into the discrete permutations of jobs, and an available mapping is employed to obtain the precedence-based permutation of the jobs. In addition, to improve the performance of MOPSO-M, archive maintenance is combined with global best position selection, and mutation and a velocity constriction mechanism are introduced into the algorithm. The feasibility and effectiveness of MOPSO-M are assessed in comparison with general MOPSO and nondominated sorting genetic algorithm-II (NSGA-II.

Generating unit maintenance scheduling under competitive market environments

International Nuclear Information System (INIS)

Jin Ho Kim; Jong Bae Park; Jong Keun Park; Yeung Han Chun

2005-01-01

A novel approach to a generating unit maintenance scheduling problem in competitive electricity markets is presented in this paper. The objective is to develop a game-theoretic framework for analyzing strategic behaviors of generating companies (Gencos) from the standpoint of the generating unit maintenance scheduling (GMS) game and for obtaining the equilibrium solution for the GMS game. The GMS problem is formulated as a dynamic non-cooperative game with complete information. The players correspond to profit maximizing individual Gencos, and the payoff of each player is defined as the profits from the energy market. The optimal schedule is defined by Nash equilibrium (equilibriums) of the game. Numerical results for two-Genco system are used to demonstrate that the proposed framework can be successfully applied to analyzing the strategic behaviors of each Genco and to obtaining the corresponding Nash equilibrium. The result indicates that generating unit maintenance schedule is one of the major strategic behaviors whereby Genco maximize their profits in a competitive market environment. (author)

Distributed continuous energy scheduling for dynamic virtual power plants

International Nuclear Information System (INIS)

Niesse, Astrid

2015-01-01

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

A simple rule based model for scheduling farm management operations in SWAT

Science.gov (United States)

Schürz, Christoph; Mehdi, Bano; Schulz, Karsten

2016-04-01

For many interdisciplinary questions at the watershed scale, the Soil and Water Assessment Tool (SWAT; Arnold et al., 1998) has become an accepted and widely used tool. Despite its flexibility, the model is highly demanding when it comes to input data. At SWAT's core the water balance and the modeled nutrient cycles are plant growth driven (implemented with the EPIC crop growth model). Therefore, land use and crop data with high spatial and thematic resolution, as well as detailed information on cultivation and farm management practices are required. For many applications of the model however, these data are unavailable. In order to meet these requirements, SWAT offers the option to trigger scheduled farm management operations by applying the Potential Heat Unit (PHU) concept. The PHU concept solely takes into account the accumulation of daily mean temperature for management scheduling. Hence, it contradicts several farming strategies that take place in reality; such as: i) Planting and harvesting dates are set much too early or too late, as the PHU concept is strongly sensitivity to inter-annual temperature fluctuations; ii) The timing of fertilizer application, in SWAT this often occurs simultaneously on the same date in in each field; iii) and can also coincide with precipitation events. Particularly, the latter two can lead to strong peaks in modeled nutrient loads. To cope with these shortcomings we propose a simple rule based model (RBM) to schedule management operations according to realistic farmer management practices in SWAT. The RBM involves simple strategies requiring only data that are input into the SWAT model initially, such as temperature and precipitation data. The user provides boundaries of time periods for operation schedules to take place for all crops in the model. These data are readily available from the literature or from crop variety trials. The RBM applies the dates by complying with the following rules: i) Operations scheduled in the

Thermoluminescence dating of Indian archaeological sites

International Nuclear Information System (INIS)

Singhvi, A.K.; Sharma, Y.P.; Agrawal, D.P.

1983-01-01

In an attempt to provide a chronology for Indian archaeological sites, an extensive pottery dating programme was initiated during 1978-1979. So far we have provided a chronology for seven important Indian archaeological sites. The dated cultures include: 1) the Ochre Colour Ware culture, 2) the Pre-Harappan culture, 3) the megalithic culture and 4) the Painted Grey Ware culture. A complete survey of recently measured TL dates are presented in a model format similar to that used in Radiocarbon. (author)

Bat Surveys of Retired Facilitiies Scheduled for Demolition by Washington Closure Hanford

Energy Technology Data Exchange (ETDEWEB)

Gano, K. A.; Lucas, J. G.; Lindsey, C. T.

2011-06-30

This project was conducted to evaluate buildings and facilities remaining in the Washington Closure Hanford (WCH) deactivation, decontamination, decommissioning, and demolition schedule for bat roost sites. The project began in spring of 2009 and was concluded in spring of 2011. A total of 196 buildings and facilities were evaluated for the presence of bat roosting sites. The schedule for the project was prioritized to accommodate the demolition schedule. As the surveys were completed, the results were provided to the project managers to facilitate planning and project completion. The surveys took place in the 300 Area, 400 Area, 100-H, 100-D, 100-N, and 100-B/C Area. This report is the culmination of all the bat surveys and summarizes the findings by area and includes recommended mitigation actions where bat roosts were found.

Residency Applicants Prefer Online System for Scheduling Interviews

Directory of Open Access Journals (Sweden)

Wills, Charlotte

2015-03-01

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

Personality profiles and psychopathology among students exposed to dating violence at theObafemi AwolowoUniversity, Ile-Ife.

Science.gov (United States)

Boladale, Mapayi; Yetunde, Oladimeji; Adesanmi, Akinsulore; Olutayo, Aloba; Olanrewaju, Ibigbami

2015-01-01

Dating violence is a complex phenomenon, and researchers continue to examine a wide range of precursors and contributing factors. Evidence indicates that violent intimate partners may be more likely to have personality disorders and dependency and attachment problems compared with non-violent ones. The aim of the present study is to evaluate the interaction between the personality profiles, pattern of psychopathology, and dating violence among university students in Obafemi Awolowo University, Ile-Ife. The study utilized a cross-sectional survey design with a total of 400 students selected using a multistage sampling technique. They completed the Sociodemographic Data Schedule, the Conflict Tactic Scale (CTS), Eysenck Personality Questionnaire (EPQ), and the General Health Questionnaire (GHQ). Univariate analysis was used to determine the prevalence of dating violence, psychopathology, and personality traits, and these were expressed in percentages. Association at bivariate level was assessed using chi-square and at multivariate level using logistic regression and correlations as was appropriate depending on the type of variable. The age of the respondents ranged between 18 and 35 years (M = 21.44, SD = 2.99). The prevalence of dating violence in the previous 12 months was 34%, and the prevalence of psychopathology was 15%. In the logistic regression model constructed, it was found that the significant predictors of dating violence were the psychoticism and neuroticism personality traits, which were also found to be positive correlates of psychopathology. The magnitude of dating violence found in this study is comparable with those found in other countries of the world. This study found an association between dating violence and personality in the study population and also between certain personality traits and psychopathology. The personality profiles of students could affect their interpersonal relationships greatly, and this fact must feature in dating violence

Schedule of the nuclear program

International Nuclear Information System (INIS)

Heigl, F.

1977-01-01

The lecure tries to explain the main phases which must be passed to establish nuclear power plants, the feasibility phase, preconstruction and construction phase. Each phase consists of a lot of activities which are commented. Further the lecture tries to give some ideas of durances and dependence between the phases or activities to get a complete time schedule of the realization of a nuclear power project. (HP) [de

An Improved Genetic Algorithm for Single-Machine Inverse Scheduling Problem

Directory of Open Access Journals (Sweden)

Jianhui Mou

2014-01-01

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

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.

Jealousy during Dating among Female College Students

Science.gov (United States)

Khanchandani, Laveena; Durham, Thomas W.

2009-01-01

This study examined the relationship between several situational and personality variables and jealousy in dating relationships among 100 college women volunteers who completed a series of questionnaires about themselves and their dating situations. Six research questions were examined. Results showed that jealousy was lower for women in a steady…

AMS Radiocarbon Dating at Notre Dame

Science.gov (United States)

Howard, Sean

2014-09-01

Current development of a local radiocarbon dating method using Accelerator Mass Spectrometry (AMS) at the University of Notre Dame seeks to provide sensitive, reproducible, and accurate measurements for future interdisciplinary projects. While AMS has been the premier radiocarbon dating method for a few decades, repurposing Notre Dame's FN Tandem accelerator for radiocarbon dating has provided many unique challenges. Experiments have shown radiocarbon dating possible and reproducible using the FN Tandem accelerator, found optimal settings for said accelerator, and established sensitivity limits comparable to dedicated radiocarbon dating facilities. In addition, there is ongoing work to create a local chemistry lab to convert organic artifacts into graphite samples to be dated locally. Once the chemistry side has been completed, several artifacts from the IAEA's radiocarbon intercomparison have been procured. Dating these previously studied artifacts will provide an additional measure on the accuracy and repeatability of both the accelerator and chemical treatment. Provided that these IAEA artifacts are dated successfully, exciting projects will ensue, such as the authentication of artwork and dating of anthropological samples.

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

DEFF Research Database (Denmark)

Lindhard, Søren; Wandahl, Søren

2013-01-01

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

Space network scheduling benchmark: A proof-of-concept process for technology transfer

Science.gov (United States)

Moe, Karen; Happell, Nadine; Hayden, B. J.; Barclay, Cathy

1993-01-01

This paper describes a detailed proof-of-concept activity to evaluate flexible scheduling technology as implemented in the Request Oriented Scheduling Engine (ROSE) and applied to Space Network (SN) scheduling. The criteria developed for an operational evaluation of a reusable scheduling system is addressed including a methodology to prove that the proposed system performs at least as well as the current system in function and performance. The improvement of the new technology must be demonstrated and evaluated against the cost of making changes. Finally, there is a need to show significant improvement in SN operational procedures. Successful completion of a proof-of-concept would eventually lead to an operational concept and implementation transition plan, which is outside the scope of this paper. However, a high-fidelity benchmark using actual SN scheduling requests has been designed to test the ROSE scheduling tool. The benchmark evaluation methodology, scheduling data, and preliminary results are described.

From Preemptive to Non-preemptive Scheduling Using Rejections

OpenAIRE

Lucarelli , Giorgio; Srivastav , Abhinav; Trystram , Denis

2016-01-01

International audience; We study the classical problem of scheduling a set of independent jobs with release dates on a single machine. There exists a huge literature on the preemptive version of the problem, where the jobs can be interrupted at any moment. However, we focus here on the non-preemptive case, which is harder, but more relevant in practice. For instance, the jobs submitted to actual high performance platforms cannot be interrupted or migrated once they start their execution (due ...

77 FR 39502 - New Date for the October 2012 Customs Broker License Examination

Science.gov (United States)

2012-07-03

... specified types of infractions. This section also provides that an examination may be conducted to assess an... unless the regularly scheduled examination date conflicts with a national holiday, religious observance... observance of the religious holiday, Sukkot. In consideration of this conflict, CBP has decided to change the...

Project Scheduling Heuristics-Based Standard PSO for Task-Resource Assignment in Heterogeneous Grid

Directory of Open Access Journals (Sweden)

Ruey-Maw Chen

2011-01-01

Full Text Available The task scheduling problem has been widely studied for assigning resources to tasks in heterogeneous grid environment. Effective task scheduling is an important issue for the performance of grid computing. Meanwhile, the task scheduling problem is an NP-complete problem. Hence, this investigation introduces a named “standard“ particle swarm optimization (PSO metaheuristic approach to efficiently solve the task scheduling problems in grid. Meanwhile, two promising heuristics based on multimode project scheduling are proposed to help in solving interesting scheduling problems. They are the best performance resource heuristic and the latest finish time heuristic. These two heuristics applied to the PSO scheme are for speeding up the search of the particle and improving the capability of finding a sound schedule. Moreover, both global communication topology and local ring communication topology are also investigated for efficient study of proposed scheme. Simulation results demonstrate that the proposed approach in this investigation can successfully solve the task-resource assignment problems in grid computing and similar scheduling problems.

Algorithm for complete enumeration based on a stroke graph to solve the supply network configuration and operations scheduling problem

Directory of Open Access Journals (Sweden)

Julien Maheut

2013-07-01

Full Text Available Purpose: The purpose of this paper is to present an algorithm that solves the supply network configuration and operations scheduling problem in a mass customization company that faces alternative operations for one specific tool machine order in a multiplant context. Design/methodology/approach: To achieve this objective, the supply chain network configuration and operations scheduling problem is presented. A model based on stroke graphs allows the design of an algorithm that enumerates all the feasible solutions. The algorithm considers the arrival of a new customized order proposal which has to be inserted into a scheduled program. A selection function is then used to choose the solutions to be simulated in a specific simulation tool implemented in a Decision Support System. Findings and Originality/value: The algorithm itself proves efficient to find all feasible solutions when alternative operations must be considered. The stroke structure is successfully used to schedule operations when considering more than one manufacturing and supply option in each step. Research limitations/implications: This paper includes only the algorithm structure for a one-by-one, sequenced introduction of new products into the list of units to be manufactured. Therefore, the lotsizing process is done on a lot-per-lot basis. Moreover, the validation analysis is done through a case study and no generalization can be done without risk. Practical implications: The result of this research would help stakeholders to determine all the feasible and practical solutions for their problem. It would also allow to assessing the total costs and delivery times of each solution. Moreover, the Decision Support System proves useful to assess alternative solutions. Originality/value: This research offers a simple algorithm that helps solve the supply network configuration problem and, simultaneously, the scheduling problem by considering alternative operations. The proposed system

Drinking and Dating: Examining the Link among Relationship Satisfaction, Hazardous Drinking, and Readiness-to-Change in College Dating Relationships

Science.gov (United States)

Khaddouma, Alexander; Shorey, Ryan C.; Brasfield, Hope; Febres, Jeniimarie; Zapor, Heather; Elmquist, Joanna; Stuart, Gregory L.

2016-01-01

For this study we examined the association between relationship satisfaction and readiness-to-change alcohol use, as well as the associations between hazardous drinking and readiness-to-change relationship issues in college dating relationships. A sample of 219 college students in a current dating relationship (aged 18-25) completed self-report…

Impact of Scheduling Policies on Control System Performance

DEFF Research Database (Denmark)

Schiøler, Henrik; Ravn, Anders Peter; Nielsen, Jens Frederik Dalsgaard

in the deterministic case and under white noise disturbances. The conclusion is that under very reasonable assumptions about robustness of control algorithms,they are insensitive to relase jitter, albeit strongly sensitive to completion jitter, thus priority based scheduling without preemption is may be preferable...

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

Science.gov (United States)

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

1986-09-01

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

Adapting immunisation schedules for children undergoing chemotherapy.

Science.gov (United States)

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

2018-02-01

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

System Certification Procedures and Criteria Manual for Deep Submergence Systems

Science.gov (United States)

1973-07-01

safety of the DSS personnel. Milestone Event Schedule A lit of sequential events in the certification process with estimated completion dates. Non...milestone event schedule should include a list of sequential events in the Certification process with estimated dates of completion. The time...valve lineup during flush and the direction of flow. In addition, if flushing blocks are used, the removed valve inter- nals should be cleaned in

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

International Nuclear Information System (INIS)

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

2016-01-01

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

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

Science.gov (United States)

2017-05-03

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

Double-shell tank waste system assessment status and schedule

International Nuclear Information System (INIS)

Walter, E.J.

1995-01-01

The integrated program for completing the integrity assessments of the dangerous waste tank systems managed by the Tank Waste Remediation System (TWRS) Division of Westinghouse Hanford Company is presented in the Tank Waste Remediation System Tank System Integrity Assessments Program Plan, WHC-SD-AP017, Rev. 1. The program plan identified the assessment requirements and the general scope to which these requirements applied. Some of these assessment requirements have been met and others are either in process of completion or scheduled to be worked. To define the boundary of the double-shell tank (DST) system and the boundaries of the DST system components (or system parts) for the purpose of performing integrity assessment activities; To identify the planned activities to meet the assessment requirements for each component; Provide the status of the assessment activities; and Project a five year assessment activity schedule

Homework schedule: an important factor associated with shorter sleep duration among Chinese school-aged children.

Science.gov (United States)

Li, Shenghui; Yang, Qian; Chen, Zhe; Jin, Xingming; Jiang, Fan; Shen, Xiaoming

2014-09-03

This study was designed to examine the hypothesis that homework schedule has adverse impacts on Chinese children's sleep-wake habits and sleep duration. A random sample of 19,299 children aged 5.08 to 11.99 years old participated in a large, cross-sectional survey. A parent-administered questionnaire was completed to quantify children's homework schedule and sleep behaviors. Generally, it was demonstrated that more homework schedule was significantly associated with later bedtime, later wake time, and shorter sleep duration. Among all sleep variables, bedtime and sleep duration during weekdays appeared to be most affected by homework schedule, especially homework schedule during weekdays.

Scheduling Parallel Jobs Using Migration and Consolidation in the Cloud

Directory of Open Access Journals (Sweden)

Xiaocheng Liu

2012-01-01

Full Text Available An increasing number of high performance computing parallel applications leverages the power of the cloud for parallel processing. How to schedule the parallel applications to improve the quality of service is the key to the successful host of parallel applications in the cloud. The large scale of the cloud makes the parallel job scheduling more complicated as even simple parallel job scheduling problem is NP-complete. In this paper, we propose a parallel job scheduling algorithm named MEASY. MEASY adopts migration and consolidation to enhance the most popular EASY scheduling algorithm. Our extensive experiments on well-known workloads show that our algorithm takes very good care of the quality of service. For two common parallel job scheduling objectives, our algorithm produces an up to 41.1% and an average of 23.1% improvement on the average response time; an up to 82.9% and an average of 69.3% improvement on the average slowdown. Our algorithm is robust even in terms that it allows inaccurate CPU usage estimation and high migration cost. Our approach involves trivial modification on EASY and requires no additional technique; it is practical and effective in the cloud environment.

SPORT: An Algorithm for Divisible Load Scheduling with Result Collection on Heterogeneous Systems

Science.gov (United States)

Ghatpande, Abhay; Nakazato, Hidenori; Beaumont, Olivier; Watanabe, Hiroshi

Divisible Load Theory (DLT) is an established mathematical framework to study Divisible Load Scheduling (DLS). However, traditional DLT does not address the scheduling of results back to source (i. e., result collection), nor does it comprehensively deal with system heterogeneity. In this paper, the DLSRCHETS (DLS with Result Collection on HET-erogeneous Systems) problem is addressed. The few papers to date that have dealt with DLSRCHETS, proposed simplistic LIFO (Last In, First Out) and FIFO (First In, First Out) type of schedules as solutions to DLSRCHETS. In this paper, a new polynomial time heuristic algorithm, SPORT (System Parameters based Optimized Result Transfer), is proposed as a solution to the DLSRCHETS problem. With the help of simulations, it is proved that the performance of SPORT is significantly better than existing algorithms. The other major contributions of this paper include, for the first time ever, (a) the derivation of the condition to identify the presence of idle time in a FIFO schedule for two processors, (b) the identification of the limiting condition for the optimality of FIFO and LIFO schedules for two processors, and (c) the introduction of the concept of equivalent processor in DLS for heterogeneous systems with result collection.

Scheduling techniques in the Request Oriented Scheduling Engine (ROSE)

Science.gov (United States)

Zoch, David R.

1991-01-01

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

ESR dating of fault rocks

International Nuclear Information System (INIS)

Lee, Hee Kwon

2003-02-01

Past movement on faults can be dated by measurement of the intensity of ESR signals in quartz. These signals are reset by local lattice deformation and local frictional heating on grain contacts at the time of fault movement. The ESR signals then grow back as a result of bombardment by ionizing radiation from surrounding rocks. The age is obtained from the ratio of the equivalent dose, needed to produce the observed signal, to the dose rate. Fine grains are more completely reset during faulting, and a plot of age vs. grain size shows a plateau for grains below critical size; these grains are presumed to have been completely zeroed by the last fault activity. We carried out ESR dating of fault rocks collected near the Gori nuclear reactor. Most of the ESR signals of fault rocks collected from the basement are saturated. This indicates that the last movement of the faults had occurred before the Quaternary period. However, ESR dates from the Oyong fault zone range from 370 to 310 ka. Results of this research suggest that long-term cyclic fault activity of the Oyong fault zone continued into the Pleistocene

ESR dating of fault rocks

Energy Technology Data Exchange (ETDEWEB)

Lee, Hee Kwon [Kangwon National Univ., Chuncheon (Korea, Republic of)

2003-02-15

Past movement on faults can be dated by measurement of the intensity of ESR signals in quartz. These signals are reset by local lattice deformation and local frictional heating on grain contacts at the time of fault movement. The ESR signals then grow back as a result of bombardment by ionizing radiation from surrounding rocks. The age is obtained from the ratio of the equivalent dose, needed to produce the observed signal, to the dose rate. Fine grains are more completely reset during faulting, and a plot of age vs. grain size shows a plateau for grains below critical size; these grains are presumed to have been completely zeroed by the last fault activity. We carried out ESR dating of fault rocks collected near the Gori nuclear reactor. Most of the ESR signals of fault rocks collected from the basement are saturated. This indicates that the last movement of the faults had occurred before the Quaternary period. However, ESR dates from the Oyong fault zone range from 370 to 310 ka. Results of this research suggest that long-term cyclic fault activity of the Oyong fault zone continued into the Pleistocene.

WCET Analysis for Preemptive Scheduling

OpenAIRE

Altmeyer, Sebastian; Gebhard, Gernot

2008-01-01

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

Predicting Scheduling and Attending for an Oral Cancer Examination

Science.gov (United States)

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

2015-01-01

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

The Influence of Dating Anxiety on Normative Experiences of Dating, Sexual Interactions, and Alcohol Consumption among Canadian Middle Adolescents

Science.gov (United States)

Boyle, Andrea M.; O'Sullivan, Lucia F.

2013-01-01

Adolescents tend to consume alcohol and find romantic and sexual partners in mixed-group settings that are unmonitored by adults. Relatively little is known about the influence that dating anxiety may have with these social interactions. A sample of 163 high school students (aged 14-17 years) completed online surveys assessing dating, sex, and…

77 FR 38775 - Schedules for Atlantic Shark Identification Workshops and Protected Species Safe Handling...

Science.gov (United States)

2012-06-29

..., 2012, in Rosenberg, TX, has been changed to August 16, 2012. This workshop notice originally published... & Suites, 28332 SW Freeway 59, Rosenberg, TX 77471. The July and September workshop dates remain unchanged... Atlantic Shark Identification Workshop scheduled for August 9, 2012, in Rosenberg, TX, has been rescheduled...

Genetic programming for evolving due-date assignment models in job shop environments.

Science.gov (United States)

Nguyen, Su; Zhang, Mengjie; Johnston, Mark; Tan, Kay Chen

2014-01-01

Due-date assignment plays an important role in scheduling systems and strongly influences the delivery performance of job shops. Because of the stochastic and dynamic nature of job shops, the development of general due-date assignment models (DDAMs) is complicated. In this study, two genetic programming (GP) methods are proposed to evolve DDAMs for job shop environments. The experimental results show that the evolved DDAMs can make more accurate estimates than other existing dynamic DDAMs with promising reusability. In addition, the evolved operation-based DDAMs show better performance than the evolved DDAMs employing aggregate information of jobs and machines.

GLOA: A New Job Scheduling Algorithm for Grid Computing

Directory of Open Access Journals (Sweden)

Zahra Pooranian

2013-03-01

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

Diversity Controlling Genetic Algorithm for Order Acceptance and Scheduling Problem

Directory of Open Access Journals (Sweden)

Cheng Chen

2014-01-01

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

The complexity of scheduling trees with communication delays

NARCIS (Netherlands)

Lenstra, J.K.; Veldhorst, M.; Veltman, B.

1996-01-01

We consider the problem of finding a minimum-length schedule onmmachines for a set ofnunit-length tasks with a forest of intrees as precedence relation, and with unit interprocessor communication delays. First, we prove that this problem is NP-complete; second, we derive a linear time algorithm for

Impact of Scheduling Policies on Control System Performance

DEFF Research Database (Denmark)

Schiøler, Henrik; Ravn, Anders Peter; Nielsen, Jens Frederik Dalsgaard

2003-01-01

It is well known that jitter has an impact on control system performance, and this is often used as an argument for static scheduling policies, e.g. a time triggered architecture. However, it is only completion jitter that seriously disturbs standard linear control algorithms in a way similar to ...

ESR dating of the fault rocks

Energy Technology Data Exchange (ETDEWEB)

Lee, Hee Kwon [Kangwon National Univ., Chuncheon (Korea, Republic of)

2004-01-15

Past movement on faults can be dated by measurement of the intensity of ESR signals in quartz. These signals are reset by local lattice deformation and local frictional heating on grain contacts at the time of fault movement. The ESR signals then grow back as a result of bombardment by ionizing radiation from surrounding rocks. The age is obtained from the ratio of the equivalent dose, needed to produce the observed signal, to the dose rate. Fine grains are more completely reset during faulting, and a plot of age vs, grain size shows a plateau for grains below critical size : these grains are presumed to have been completely zeroed by the last fault activity. We carried out ESR dating of fault rocks collected near the Ulzin nuclear reactor. ESR signals of quartz grains separated from fault rocks collected from the E-W trend fault are saturated. This indicates that the last movement of these faults had occurred before the quaternary period. ESR dates from the NW trend faults range from 300ka to 700ka. On the other hand, ESR date of the NS trend fault is about 50ka. Results of this research suggest that long-term cyclic fault activity near the Ulzin nuclear reactor continued into the pleistocene.

75 FR 41891 - Certain Footwear: Recommendations for Modifying the Harmonized Tariff Schedule of the United States

Science.gov (United States)

2010-07-19

... INTERNATIONAL TRADE COMMISSION [Investigation No. 1205-8] Certain Footwear: Recommendations for Modifying the Harmonized Tariff Schedule of the United States AGENCY: United States International Trade Commission. ACTION: Change in date for transmitting final recommendations to the President. SUMMARY: The...

Integrated Cost and Schedule using Monte Carlo Simulation of a CPM Model - 12419

Energy Technology Data Exchange (ETDEWEB)

Hulett, David T. [Hulett and Associates, LLC (United States); Nosbisch, Michael R. [Project Time and Cost, Inc. (United States)

2012-07-01

This discussion of the recommended practice (RP) 57R-09 of AACE International defines the integrated analysis of schedule and cost risk to estimate the appropriate level of cost and schedule contingency reserve on projects. The main contribution of this RP is to include the impact of schedule risk on cost risk and hence on the need for cost contingency reserves. Additional benefits include the prioritizing of the risks to cost, some of which are risks to schedule, so that risk mitigation may be conducted in a cost-effective way, scatter diagrams of time-cost pairs for developing joint targets of time and cost, and probabilistic cash flow which shows cash flow at different levels of certainty. Integrating cost and schedule risk into one analysis based on the project schedule loaded with costed resources from the cost estimate provides both: (1) more accurate cost estimates than if the schedule risk were ignored or incorporated only partially, and (2) illustrates the importance of schedule risk to cost risk when the durations of activities using labor-type (time-dependent) resources are risky. Many activities such as detailed engineering, construction or software development are mainly conducted by people who need to be paid even if their work takes longer than scheduled. Level-of-effort resources, such as the project management team, are extreme examples of time-dependent resources, since if the project duration exceeds its planned duration the cost of these resources will increase over their budgeted amount. The integrated cost-schedule risk analysis is based on: - A high quality CPM schedule with logic tight enough so that it will provide the correct dates and critical paths during simulation automatically without manual intervention. - A contingency-free estimate of project costs that is loaded on the activities of the schedule. - Resolves inconsistencies between cost estimate and schedule that often creep into those documents as project execution proceeds

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.

75 FR 75695 - Certain Footwear: Recommendations for Modifying the Harmonized Tariff Schedule of the United States

Science.gov (United States)

2010-12-06

... INTERNATIONAL TRADE COMMISSION [Investigation No. 1205-8 (Addendum)] Certain Footwear.... 1205-8, Certain Footwear: Recommendations for Modifying the Harmonized Tariff Schedule of the United... addition of new tariff lines applicable to the subject footwear. DATES: December 22, 2010: Deadline for...

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.

A Study on the Enhanced Best Performance Algorithm for the Just-in-Time Scheduling Problem

Directory of Open Access Journals (Sweden)

Sivashan Chetty

2015-01-01

Full Text Available The Just-In-Time (JIT scheduling problem is an important subject of study. It essentially constitutes the problem of scheduling critical business resources in an attempt to optimize given business objectives. This problem is NP-Hard in nature, hence requiring efficient solution techniques. To solve the JIT scheduling problem presented in this study, a new local search metaheuristic algorithm, namely, the enhanced Best Performance Algorithm (eBPA, is introduced. This is part of the initial study of the algorithm for scheduling problems. The current problem setting is the allocation of a large number of jobs required to be scheduled on multiple and identical machines which run in parallel. The due date of a job is characterized by a window frame of time, rather than a specific point in time. The performance of the eBPA is compared against Tabu Search (TS and Simulated Annealing (SA. SA and TS are well-known local search metaheuristic algorithms. The results show the potential of the eBPA as a metaheuristic algorithm.

A new distributed systems scheduling algorithm: a swarm intelligence approach

Science.gov (United States)

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

2011-12-01

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

Second unit scheduling concerns on a dual-unit nuclear project

International Nuclear Information System (INIS)

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

1978-01-01

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

NASA scheduling technologies

Science.gov (United States)

Adair, Jerry R.

1994-01-01

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

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

Science.gov (United States)

2010-07-22

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

Intercell scheduling: A negotiation approach using multi-agent coalitions

Science.gov (United States)

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

2016-10-01

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

Social Information Processing in Dating Conflicts: Reciprocal Relationships With Dating Aggression in a One-Year Prospective Study.

Science.gov (United States)

Calvete, Esther; Orue, Izaskun; Gamez-Guadix, Manuel; López de Arroyabe, Elena

2016-04-01

The aim of this study was to assess the reciprocal associations among social information processing (SIP) in dating conflicts and the perpetration of dating aggression. A first step involved the development of a measure (The Social Information Processing Questionnaire in Dating Conflicts, SIPQ-DC) to assess social information in scenarios of conflict with dating partners. A sample of 1,272 adolescents (653 girls, 619 boys; Mage = 14.74 years, SD = 1.21) completed measures of SIP and dating aggression perpetration in two different times, which were spaced 1 year apart. Confirmatory factor analyses provided support for a model with five correlated factors for the SIPQ-DC, namely, hostile attribution, anger, aggressive response access, anticipation of positive consequences for oneself, and anticipation of negative consequences for partners. Although the perpetration of dating aggression at T1 was cross-sectionally associated with all the SIP components, anger was the only component that predicted the residual increase in dating aggression behavior over time. The perpetration of dating aggression predicted a worsening of cognitive-emotional processes involved in dating conflicts. Some longitudinal paths were significant only in male adolescents. In conclusion, relationships among SIP and aggression are reciprocal. Gender differences in longitudinal paths can contribute to explaining men's higher perpetration of violence in adulthood. © The Author(s) 2014.

Scheduling Non-Preemptible Jobs to Minimize Peak Demand

Directory of Open Access Journals (Sweden)

Sean Yaw

2017-10-01

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

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

Directory of Open Access Journals (Sweden)

Stanimirović Ivan

2009-01-01

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

The impact of exposure to shift-based schedules on medical students

Directory of Open Access Journals (Sweden)

David A. Williams

2015-06-01

Full Text Available Background: With new resident duty-hour regulations, resident work schedules have progressively transitioned towards shift-based systems, sometimes resulting in increased team fragmentation. We hypothesized that exposure to shift-based schedules and subsequent team fragmentation would negatively affect medical student experiences during their third-year internal medicine clerkship. Design: As part of a larger national study on duty-hour reform, 67 of 150 eligible third-year medical students completed surveys about career choice, teaching and supervision, assessment, patient care, well-being, and attractiveness of a career in internal medicine after completing their internal medicine clerkship. Students who rotated to hospitals with shift-based systems were compared to those who did not. Non-demographic variables used a five-point Likert scale. Chi-squared and Fisher's exact tests were used to assess the relationships between exposure to shift-based schedules and student responses. Questions with univariate p≤0.1 were included in multivariable logistic regression models. Results: Thirty-six students (54% were exposed to shift-based schedules. Students exposed to shift-based schedules were less likely to perceive that their attendings were committed to teaching (odds ratio [OR] 0.35, 95% confidence interval [CI]: 0.13–0.90, p=0.01 or perceive that residents had sufficient exposure to assess their performance (OR 0.29, 95% CI: 0.09–0.91, p=0.03. However, those students were more likely to feel their interns were able to observe them at the bedside (OR 1.89, 95% CI: 1.08–3.13, p=0.02 and had sufficient exposure to assess their performance (OR 3.00, 95% CI: 1.01–8.86, p=0.05. Conclusions: These findings suggest that shift-based schedules designed in response to duty-hour reform may have important broader implications for the teaching environment.

The impact of exposure to shift-based schedules on medical students.

Science.gov (United States)

Williams, David A; Kogan, Jennifer R; Hauer, Karen E; Yamashita, Traci; Aagaard, Eva M

2015-01-01

With new resident duty-hour regulations, resident work schedules have progressively transitioned towards shift-based systems, sometimes resulting in increased team fragmentation. We hypothesized that exposure to shift-based schedules and subsequent team fragmentation would negatively affect medical student experiences during their third-year internal medicine clerkship. As part of a larger national study on duty-hour reform, 67 of 150 eligible third-year medical students completed surveys about career choice, teaching and supervision, assessment, patient care, well-being, and attractiveness of a career in internal medicine after completing their internal medicine clerkship. Students who rotated to hospitals with shift-based systems were compared to those who did not. Non-demographic variables used a five-point Likert scale. Chi-squared and Fisher's exact tests were used to assess the relationships between exposure to shift-based schedules and student responses. Questions with univariate p ≤ 0.1 were included in multivariable logistic regression models. Thirty-six students (54%) were exposed to shift-based schedules. Students exposed to shift-based schedules were less likely to perceive that their attendings were committed to teaching (odds ratio [OR] 0.35, 95% confidence interval [CI]: 0.13-0.90, p = 0.01) or perceive that residents had sufficient exposure to assess their performance (OR 0.29, 95% CI: 0.09-0.91, p = 0.03). However, those students were more likely to feel their interns were able to observe them at the bedside (OR 1.89, 95% CI: 1.08-3.13, p = 0.02) and had sufficient exposure to assess their performance (OR 3.00, 95% CI: 1.01-8.86, p = 0.05). These findings suggest that shift-based schedules designed in response to duty-hour reform may have important broader implications for the teaching environment.

Tools and techniques for schedule's controlling: tracking system and control of Urucu-Manaus gas-pipeline construction, stretch B1

Energy Technology Data Exchange (ETDEWEB)

Zuany, Valdenise Marques; Dias, Jose Luiz Gomes [CONCREMAT Engenharia e Tecnologia S/A, Rio de Janeiro, RJ (Brazil)

2009-07-01

The goal is to show the monitoring systems and deadline control, using the PMBOK{sup R} project management tools, in the Construction and Assembly of the Coari-Manaus Gas-pipeline, stretch B1, which includes the cities of Coari, Codajas, Anori and Anama, in the state of Amazon, in the Northern Undertaking Implementation (IENOR), an Engineering division of the PETROBRAS System. This report presents the practical effects of the usage of three schedule control tools of the project: Performance Measurement, using the technique of the Earned Value Management (EVM), which integrates cost, schedule and physical progress of the enterprise to determine the variations of schedule and performance; Project Management Software, MSProject, which allows schedule's elaboration and makes the tracking of the planned dates possible (baseline) in relation to real dates and forecasts the trend level, the effects of changes in the project's schedule, demonstrating its utility as a schedule control tool; and Schedule Variance Analysis, which adopts practical data to reach the pessimistic, most likely and optimistic expectations. The implantation of these tools was based in the Work Breakdown Structure of the enterprise. The application of these three tools in the tracking and control of the enterprise demonstrates that, the use of information and techniques deriving from the planning and control can be an important support for project management and decision taking, comparing the results gotten in the implantation of the plan with its actual realization, defining, thus, the necessary corrective actions, generating learned lessons to use in future projects. (author)

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

Science.gov (United States)

Richards, Stephen F.

1991-01-01

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

Optimizing Music Learning: Exploring How Blocked and Interleaved Practice Schedules Affect Advanced Performance.

Science.gov (United States)

Carter, Christine E; Grahn, Jessica A

2016-01-01

Repetition is the most commonly used practice strategy by musicians. Although blocks of repetition continue to be suggested in the pedagogical literature, work in the field of cognitive psychology suggests that repeated events receive less processing, thereby reducing the potential for long-term learning. Motor skill learning and sport psychology research offer an alternative. Instead of using a blocked practice schedule, with practice completed on one task before moving on to the next task, an interleaved schedule can be used, in which practice is frequently alternated between tasks. This frequent alternation involves more effortful processing, resulting in increased long-term learning. The finding that practicing in an interleaved schedule leads to better retention than practicing in a blocked schedule has been labeled the "contextual interference effect." While the effect has been observed across a wide variety of fields, few studies have researched this phenomenon in a music-learning context, despite the broad potential for application to music practice. This study compared the effects of blocked and interleaved practice schedules on advanced clarinet performance in an ecologically valid context. Ten clarinetists were given one concerto exposition and one technical excerpt to practice in a blocked schedule (12 min per piece) and a second concerto exposition and technical excerpt to practice in an interleaved schedule (3 min per piece, alternating until a total of 12 min of practice were completed on each piece). Participants sight-read the four pieces prior to practice and performed them at the end of practice and again one day later. The sight-reading and two performance run-throughs of each piece were recorded and given to three professional clarinetists to rate using a percentage scale. Overall, whenever there was a ratings difference between the conditions, pieces practiced in the interleaved schedule were rated better than those in the blocked schedule

Optimizing Music Learning: Exploring How Blocked and Interleaved Practice Schedules Affect Advanced Performance

Science.gov (United States)

Carter, Christine E.; Grahn, Jessica A.

2016-01-01

Repetition is the most commonly used practice strategy by musicians. Although blocks of repetition continue to be suggested in the pedagogical literature, work in the field of cognitive psychology suggests that repeated events receive less processing, thereby reducing the potential for long-term learning. Motor skill learning and sport psychology research offer an alternative. Instead of using a blocked practice schedule, with practice completed on one task before moving on to the next task, an interleaved schedule can be used, in which practice is frequently alternated between tasks. This frequent alternation involves more effortful processing, resulting in increased long-term learning. The finding that practicing in an interleaved schedule leads to better retention than practicing in a blocked schedule has been labeled the “contextual interference effect.” While the effect has been observed across a wide variety of fields, few studies have researched this phenomenon in a music-learning context, despite the broad potential for application to music practice. This study compared the effects of blocked and interleaved practice schedules on advanced clarinet performance in an ecologically valid context. Ten clarinetists were given one concerto exposition and one technical excerpt to practice in a blocked schedule (12 min per piece) and a second concerto exposition and technical excerpt to practice in an interleaved schedule (3 min per piece, alternating until a total of 12 min of practice were completed on each piece). Participants sight-read the four pieces prior to practice and performed them at the end of practice and again one day later. The sight-reading and two performance run-throughs of each piece were recorded and given to three professional clarinetists to rate using a percentage scale. Overall, whenever there was a ratings difference between the conditions, pieces practiced in the interleaved schedule were rated better than those in the blocked schedule

Optimizing music learning: Exploring how blocked and interleaved practice schedules affect advanced performance

Directory of Open Access Journals (Sweden)

Christine E Carter

2016-08-01

Full Text Available Repetition is the most commonly used practice strategy by musicians. Although blocks of repetition continue to be suggested in the pedagogical literature, work in the field of cognitive psychology suggests that repeated events receive less processing, thereby reducing the potential for long-term learning. Motor skill learning and sport psychology research offer an alternative. Instead of using a blocked practice schedule, with practice completed on one task before moving on to the next task, an interleaved schedule can be used, in which practice is frequently alternated between tasks. This frequent alternation involves more effortful processing, resulting in increased long-term learning. The finding that practicing in an interleaved schedule leads to better retention than practicing in a blocked schedule has been labeled the contextual interference effect. While the effect has been observed across a wide variety of fields, few studies have researched this phenomenon in a music-learning context, despite the broad potential for application to music practice. This study compared the effects of blocked and interleaved practice schedules on advanced clarinet performance in an ecologically valid context. Ten clarinetists were given one concerto exposition and one technical excerpt to practice in a blocked schedule (twelve minutes per piece and a second concerto exposition and technical excerpt to practice in an interleaved schedule (three minutes per piece, alternating until a total of twelve minutes of practice were completed on each piece. Participants sight-read the four pieces prior to practice and performed them at the end of practice and again one day later. The sight-reading and two performance run-throughs of each piece were recorded and given to three professional clarinetists to rate using a percentage scale. Overall, whenever there was a ratings difference between the conditions, pieces practiced in the interleaved schedule were rated

A hybrid approach for minimizing makespan in permutation flowshop scheduling

DEFF Research Database (Denmark)

Govindan, Kannan; Balasundaram, R.; Baskar, N.

2017-01-01

This work proposes a hybrid approach for solving traditional flowshop scheduling problems to reduce the makespan (total completion time). To solve scheduling problems, a combination of Decision Tree (DT) and Scatter Search (SS) algorithms are used. Initially, the DT is used to generate a seed...... solution which is then given input to the SS to obtain optimal / near optimal solutions of makespan. The DT used the entropy function to convert the given problem into a tree structured format / set of rules. The SS provides an extensive investigation of the search space through diversification...

7 CFR 283.29 - Scheduling conference.

Science.gov (United States)

2010-01-01

... amendments to pleadings; (3) Stipulations of facts and of the authenticity, accuracy, and admissibility of... exhibits; (6) The nature of and the date by which discovery, as provided in § 283.28, must be completed; (7...

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

NARCIS (Netherlands)

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

2010-01-01

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

Scheduling a maintenance activity under skills constraints to minimize total weighted tardiness and late tasks

Directory of Open Access Journals (Sweden)

Djalal Hedjazi

2015-04-01

Full Text Available Skill management is a key factor in improving effectiveness of industrial companies, notably their maintenance services. The problem considered in this paper concerns scheduling of maintenance tasks under resource (maintenance teams constraints. This problem is generally known as unrelated parallel machine scheduling. We consider the problem with a both objectives of minimizing total weighted tardiness (TWT and number of tardiness tasks. Our interest is focused particularly on solving this problem under skill constraints, which each resource has a skill level. So, we propose a new efficient heuristic to obtain an approximate solution for this NP-hard problem and demonstrate his effectiveness through computational experiments. This heuristic is designed for implementation in a static maintenance scheduling problem (with unequal release dates, processing times and resource skills, while minimizing objective functions aforementioned.

Real-time scheduling of software tasks

International Nuclear Information System (INIS)

Hoff, L.T.

1995-01-01

When designing real-time systems, it is often desirable to schedule execution of software tasks based on the occurrence of events. The events may be clock ticks, interrupts from a hardware device, or software signals from other software tasks. If the nature of the events, is well understood, this scheduling is normally a static part of the system design. If the nature of the events is not completely understood, or is expected to change over time, it may be necessary to provide a mechanism for adjusting the scheduling of the software tasks. RHIC front-end computers (FECs) provide such a mechanism. The goals in designing this mechanism were to be as independent as possible of the underlying operating system, to allow for future expansion of the mechanism to handle new types of events, and to allow easy configuration. Some considerations which steered the design were programming paradigm (object oriented vs. procedural), programming language, and whether events are merely interesting moments in time, or whether they intrinsically have data associated with them. The design also needed to address performance and robustness tradeoffs involving shared task contexts, task priorities, and use of interrupt service routine (ISR) contexts vs. task contexts. This paper will explore these considerations and tradeoffs

76 FR 29750 - Filing Dates for the Nevada Special Election in the 2nd Congressional District

Science.gov (United States)

2011-05-23

... 2nd Congressional District AGENCY: Federal Election Commission. ACTION: Notice of filing dates for special election. SUMMARY: Nevada has scheduled a Special General Election on September 13, 2011, to fill... Heller. Committees required to file reports in connection with the Special General Election on September...

75 FR 10483 - Filing Dates for the Pennsylvania Special Election in the 12th Congressional District

Science.gov (United States)

2010-03-08

... in the 12th Congressional District AGENCY: Federal Election Commission. ACTION: Notice of filing dates for special election. SUMMARY: Pennsylvania has scheduled a Special General Election on May 18... John P. Murtha. Committees required to file reports in connection with the Special General Election on...

76 FR 17124 - Filing Dates for the California Special Election in the 36th Congressional District

Science.gov (United States)

2011-03-28

... the 36th Congressional District AGENCY: Federal Election Commission. ACTION: Notice of filing dates for special election. SUMMARY: California has scheduled a special general election on May 17, 2011, to... committees of candidates who participate in the California Special General and Special Runoff Elections shall...

Schedules of controlled substances: extension of temporary placement of UR-144, XLR11, and AKB48 in schedule I of the Controlled Substances Act. Final order.

Science.gov (United States)

2015-05-15

The Administrator of the Drug Enforcement Administration (DEA) is issuing this final order to extend the temporary placement of (1-pentyl-1H-indol-3-yl)(2,2,3,3-tetramethylcyclopropyl)methanone (UR-144), [1-(5-fluoro-pentyl)-1H-indol-3-yl](2,2,3,3-tetramethylcyclopropyl)methanone (5-fluoro-UR-144, XLR11) and N-(1-adamantyl)-1-pentyl-1H-indazole-3-carboxamide (APINACA, AKB48), including their salts, isomers, and salts of isomers whenever the existence of such salts, isomers, and salts of isomers is possible, in schedule I of the Controlled Substances Act. The current final order temporarily placing UR-144, XLR11, and AKB48 in schedule I is due to expire on May 15, 2015. This final order will extend the temporary scheduling of UR-144, XLR11, and AKB48 to May 15, 2016, or until the permanent scheduling action for these three substances is completed, whichever occurs first.

Maximum Lateness Scheduling on Two-Person Cooperative Games with Variable Processing Times and Common Due Date

OpenAIRE

Liu, Peng; Wang, Xiaoli

2017-01-01

A new maximum lateness scheduling model in which both cooperative games and variable processing times exist simultaneously is considered in this paper. The job variable processing time is described by an increasing or a decreasing function dependent on the position of a job in the sequence. Two persons have to cooperate in order to process a set of jobs. Each of them has a single machine and their processing cost is defined as the minimum value of maximum lateness. All jobs have a common due ...

Web Publishing Schedule

Science.gov (United States)

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

Scheduling with Bus Access Optimization for Distributed Embedded Systems

DEFF Research Database (Denmark)

Eles, Petru; Doboli, Alex; Pop, Paul

2000-01-01

of control. Our goal is to derive a worst case delay by which the system completes execution, such that this delay is as small as possible; to generate a logically and temporally deterministic schedule; and to optimize parameters of the communication protocol such that this delay is guaranteed. We have......In this paper, we concentrate on aspects related to the synthesis of distributed embedded systems consisting of programmable processors and application-specific hardware components. The approach is based on an abstract graph representation that captures, at process level, both dataflow and the flow......, generates an efficient bus access scheme as well as the schedule tables for activation of processes and communications....

Do scheduled caste and scheduled tribe women legislators mean lower gender-caste gaps in primary schooling in India?

Science.gov (United States)

Halim, Nafisa; Yount, Kathryn M; Cunningham, Solveig

2016-07-01

Despite India's substantial investments in primary schooling, gaps in schooling persist across gender and caste-with scheduled caste and scheduled tribe (SC/ST) girls being particularly disadvantaged. The representation of SC/ST women in state legislatures may help to mitigate this disadvantage. Specifically, because of her intersecting gender and caste/tribe identities, a SC/ST woman legislator might maintain a strong sense of solidarity especially with SC/ST girls and women, and support legislative policies benefitting SC/ST girls. Consequently, for this reason, we expect that living in a district where SC/ST women represent in state legislatures in a higher proportion may increase SC/ST girls' primary school completion, progression and performance. We tested this hypothesis using district-level data between 2000 and 2004 from the Indian Election Commission, the 2004/5 India Human Development Survey, and the Indian Census of 2001. As expected, the representation of SC/ST women in state legislatures was positively associated with SC/ST girls' grade completion and age-appropriate grade progression but was apparent not SC/ST girls' primary-school performance. SC/ST women's representation in state legislatures may reduce gender-caste gaps in primary-school attainment in India. Copyright © 2016. Published by Elsevier Inc.

Performance comparison of heuristic algorithms for task scheduling in IaaS cloud computing environment

Science.gov (United States)

Madni, Syed Hamid Hussain; Abd Latiff, Muhammad Shafie; Abdullahi, Mohammed; Usman, Mohammed Joda

2017-01-01

Cloud computing infrastructure is suitable for meeting computational needs of large task sizes. Optimal scheduling of tasks in cloud computing environment has been proved to be an NP-complete problem, hence the need for the application of heuristic methods. Several heuristic algorithms have been developed and used in addressing this problem, but choosing the appropriate algorithm for solving task assignment problem of a particular nature is difficult since the methods are developed under different assumptions. Therefore, six rule based heuristic algorithms are implemented and used to schedule autonomous tasks in homogeneous and heterogeneous environments with the aim of comparing their performance in terms of cost, degree of imbalance, makespan and throughput. First Come First Serve (FCFS), Minimum Completion Time (MCT), Minimum Execution Time (MET), Max-min, Min-min and Sufferage are the heuristic algorithms considered for the performance comparison and analysis of task scheduling in cloud computing. PMID:28467505

Performance comparison of heuristic algorithms for task scheduling in IaaS cloud computing environment.

Science.gov (United States)

Madni, Syed Hamid Hussain; Abd Latiff, Muhammad Shafie; Abdullahi, Mohammed; Abdulhamid, Shafi'i Muhammad; Usman, Mohammed Joda

2017-01-01

Cloud computing infrastructure is suitable for meeting computational needs of large task sizes. Optimal scheduling of tasks in cloud computing environment has been proved to be an NP-complete problem, hence the need for the application of heuristic methods. Several heuristic algorithms have been developed and used in addressing this problem, but choosing the appropriate algorithm for solving task assignment problem of a particular nature is difficult since the methods are developed under different assumptions. Therefore, six rule based heuristic algorithms are implemented and used to schedule autonomous tasks in homogeneous and heterogeneous environments with the aim of comparing their performance in terms of cost, degree of imbalance, makespan and throughput. First Come First Serve (FCFS), Minimum Completion Time (MCT), Minimum Execution Time (MET), Max-min, Min-min and Sufferage are the heuristic algorithms considered for the performance comparison and analysis of task scheduling in cloud computing.

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.

Scheduling Aircraft Landings under Constrained Position Shifting

Science.gov (United States)

Balakrishnan, Hamsa; Chandran, Bala

2006-01-01

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

75 FR 34450 - Filing Dates for the Indiana Special Election in the 3rd Congressional District

Science.gov (United States)

2010-06-17

... 3rd Congressional District AGENCY: Federal Election Commission. ACTION: Notice of filing dates for special election. SUMMARY: Indiana has scheduled a Special General Election on November 2, 2010, to fill.... Committees required to file reports in connection with the Special General Election on November 2, 2010...

Obsidian dating prospects

International Nuclear Information System (INIS)

Ambrose, W.

1997-01-01

Full text: Developments in the nuclear industry have shown that some of the problems related to the glassification of waste for long term storage are centred on the rate of glass weathering in various repositories. Long term weathering of artificial glasses is paralleled by the archaeological problem of determining hydration rates in obsidian artefacts as a means of dating their manufacture. Figures available for sites in Papua New Guinea indicate that the weathering rate is sufficiently fast to render conventional hydration measurement completely unreliable. This follows from the range of calculated surface reduction rates which range between .0002μ to .004μ per year depending on the site's location and the obsidian source. Hydration rates for key Papua New Guinea obsidians have been determined from long term experimental laboratory exposure and these are used to evaluate the age of obsidians from selected archaeological sites. By adopting a strategy of measuring hydration in concealed fissures both the weathering rate and the dating of the Papua New Guinea obsidians have been successfully achieved. The dissolution rates of natural obsidians could be useful in considering weathering rates for artificial glasses. An improved system for calculating the annual effective hydration temperature is presented which gives a better control of micro-environmental temperature in its crucial rate determining role. The combined result of these developments gives obsidian hydration dating an enhanced capacity to be a useful and independent dating system

Wasted research when systematic reviews fail to provide a complete and up-to-date evidence synthesis: the example of lung cancer.

Science.gov (United States)

Créquit, Perrine; Trinquart, Ludovic; Yavchitz, Amélie; Ravaud, Philippe

2016-01-20

Multiple treatments are frequently available for a given condition, and clinicians and patients need a comprehensive, up-to-date synthesis of evidence for all competing treatments. We aimed to quantify the waste of research related to the failure of systematic reviews to provide a complete and up-to-date evidence synthesis over time. We performed a series of systematic overviews and networks of randomized trials assessing the gap between evidence covered by systematic reviews and available trials of second-line treatments for advanced non-small cell lung cancer. We searched the Cochrane Database of Systematic Reviews, Database of Abstracts of Reviews of Effects, MEDLINE, EMBASE, and other resources sequentially by year from 2009 to March 2, 2015. We sequentially compared the amount of evidence missing from systematic reviews to the randomized evidence available for inclusion each year. We constructed cumulative networks of randomized evidence over time and evaluated the proportion of trials, patients, treatments, and treatment comparisons not covered by systematic reviews on December 31 each year from 2009 to 2015. We identified 77 trials (28,636 patients) assessing 47 treatments with 54 comparisons and 29 systematic reviews (13 published after 2013). From 2009 to 2015, the evidence covered by existing systematic reviews was consistently incomplete: 45 % to 70 % of trials; 30 % to 58 % of patients; 40 % to 66 % of treatments; and 38 % to 71 % of comparisons were missing. In the cumulative networks of randomized evidence, 10 % to 17 % of treatment comparisons were partially covered by systematic reviews and 55 % to 85 % were partially or not covered. We illustrate how systematic reviews of a given condition provide a fragmented, out-of-date panorama of the evidence for all treatments. This waste of research might be reduced by the development of live cumulative network meta-analyses.

Baseline development, economic risk, and schedule risk: An integrated approach

International Nuclear Information System (INIS)

Tonkinson, J.A.

1994-01-01

The economic and schedule risks of Environmental Restoration (ER) projects are commonly analyzed toward the end of the baseline development process. Risk analysis is usually performed as the final element of the scheduling or estimating processes for the purpose of establishing cost and schedule contingency. However, there is an opportunity for earlier assessment of risks, during development of the technical scope and Work Breakdown Structure (WBS). Integrating the processes of risk management and baselining provides for early incorporation of feedback regarding schedule and cost risk into the proposed scope of work. Much of the information necessary to perform risk analysis becomes available during development of the technical baseline, as the scope of work and WBS are being defined. The analysis of risk can actually be initiated early on during development of the technical baseline and continue throughout development of the complete project baseline. Indeed, best business practices suggest that information crucial to the success of a project be analyzed and incorporated into project planning as soon as it is available and usable

A feasibility study to assess the effectiveness of safe dates for teen mothers.

Science.gov (United States)

Herrman, Judith W; Waterhouse, Julie K

2014-01-01

To determine the effectiveness of the adapted Safe Dates curriculum as an intervention for pregnant and/or parenting teens to prevent teen dating violence (TDV). This pre-/posttest, single-sample study provided a means to assess the effectiveness of an adapted Safe Dates curriculum for teen mothers. The adapted Safe Dates curriculum was implemented in three schools designed for the unique needs of teens who are pregnant and/or parenting. The final sample of 41 teen participants, with a mean age of 16.27, completed 80% of the curriculum and two of the three assessments. Most of the teens were pregnant during participation in the curriculum, and six had infants between age 1 and 3 months. The teen mothers completed the pretest, participated in the 10-session adapted Safe Dates curriculum, and completed the posttest at the end of the program and 1 month after program completion. The pre/posttest was adapted from the Safe Dates curriculum-specific evaluation instrument. Senior, undergraduate nursing students were trained in and implemented the curriculum. Participation in the adapted Safe Dates program yielded significant differences in the areas of responses to anger, gender stereotyping, awareness of resources for perpetrators and victims, and psychological violence perpetration. This adapted program may be effective in changing selected outcomes. The implementation of a larger scale, experimental/control group study may demonstrate the program's efficacy at reducing the incidence of TDV among teen mothers. © 2014 AWHONN, the Association of Women's Health, Obstetric and Neonatal Nurses.

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

Directory of Open Access Journals (Sweden)

Behnam Barzegar

2012-01-01

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

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

Science.gov (United States)

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

2018-01-01

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

Generation of Look-Up Tables for Dynamic Job Shop Scheduling Decision Support Tool

Science.gov (United States)

Oktaviandri, Muchamad; Hassan, Adnan; Mohd Shaharoun, Awaluddin

2016-02-01

Majority of existing scheduling techniques are based on static demand and deterministic processing time, while most job shop scheduling problem are concerned with dynamic demand and stochastic processing time. As a consequence, the solutions obtained from the traditional scheduling technique are ineffective wherever changes occur to the system. Therefore, this research intends to develop a decision support tool (DST) based on promising artificial intelligent that is able to accommodate the dynamics that regularly occur in job shop scheduling problem. The DST was designed through three phases, i.e. (i) the look-up table generation, (ii) inverse model development and (iii) integration of DST components. This paper reports the generation of look-up tables for various scenarios as a part in development of the DST. A discrete event simulation model was used to compare the performance among SPT, EDD, FCFS, S/OPN and Slack rules; the best performances measures (mean flow time, mean tardiness and mean lateness) and the job order requirement (inter-arrival time, due dates tightness and setup time ratio) which were compiled into look-up tables. The well-known 6/6/J/Cmax Problem from Muth and Thompson (1963) was used as a case study. In the future, the performance measure of various scheduling scenarios and the job order requirement will be mapped using ANN inverse model.

The effects of moms and teens for safe dates: a dating abuse prevention program for adolescents exposed to domestic violence.

Science.gov (United States)

Foshee, Vangie A; Benefield, Thad; Dixon, Kimberly S; Chang, Ling-Yin; Senkomago, Virginia; Ennett, Susan T; Moracco, Kathryn E; Michael Bowling, J

2015-05-01

Adolescents exposed to domestic violence are at high risk for dating abuse. This randomized controlled trial evaluated a dating abuse prevention program designed specifically for this risk group. Moms and Teens for Safe Dates consisted of six mailed booklets of dating abuse prevention information and interactive activities. Mothers who had been victims of domestic violence but no longer lived with the abuser delivered the program to their adolescents who had been exposed to the abuse. Mother and adolescent pairs (N = 409) were recruited through community advertising; the adolescents ranged from 12 to 16 years old and 64 % were female. Mothers and adolescents completed baseline and 6-month follow-up telephone interviews. Booklet completion in the treatment group ranged from 80 % for the first to 62 % for the last booklet. The analyses first tested whether program effects on dating abuse varied by four a priori identified moderators (mother's psychological health, the amount of adolescent exposure to domestic violence, and adolescent sex and race/ethnicity). Main effects of the program were examined when there were no differential program effects. Program effects on psychological and physical victimization and psychological and cyber perpetration were moderated by the amount of adolescent exposure to domestic violence; there were significant favorable program effects for adolescents with higher, but not lower levels of exposure to domestic violence. There were no moderated or main effects on sexual violence victimization and perpetration or cyber victimization. The findings suggest that a dating abuse prevention program designed for adolescents exposed to domestic violence can have important positive effects.

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

Science.gov (United States)

2010-07-01

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

75 FR 12544 - Filing Dates for the Hawaii Special Election In the 1st Congressional District

Science.gov (United States)

2010-03-16

... 1st Congressional District AGENCY: Federal Election Commission. ACTION: Notice of filing dates for special election. SUMMARY: Hawaii has scheduled a Special General Election on May 22, 2010, to fill the U.... Committees required to file reports in connection with the Special General Election on May 22, 2010, shall...

78 FR 9916 - Filing Dates for the Missouri Special Election in the 8th Congressional District

Science.gov (United States)

2013-02-12

... 8th Congressional District AGENCY: Federal Election Commission. ACTION: Notice of filing dates for special election. SUMMARY: Missouri has scheduled a Special General Election on June 4, 2013, to fill the.... Committees required to file reports in connection with the Special General Election on June 4, 2013, shall...

An integer batch scheduling model considering learning, forgetting, and deterioration effects for a single machine to minimize total inventory holding cost

Science.gov (United States)

Yusriski, R.; Sukoyo; Samadhi, T. M. A. A.; Halim, A. H.

2018-03-01

This research deals with a single machine batch scheduling model considering the influenced of learning, forgetting, and machine deterioration effects. The objective of the model is to minimize total inventory holding cost, and the decision variables are the number of batches (N), batch sizes (Q[i], i = 1, 2, .., N) and the sequence of processing the resulting batches. The parts to be processed are received at the right time and the right quantities, and all completed parts must be delivered at a common due date. We propose a heuristic procedure based on the Lagrange method to solve the problem. The effectiveness of the procedure is evaluated by comparing the resulting solution to the optimal solution obtained from the enumeration procedure using the integer composition technique and shows that the average effectiveness is 94%.

An Online Scheduling Algorithm with Advance Reservation for Large-Scale Data Transfers

Energy Technology Data Exchange (ETDEWEB)

Balman, Mehmet; Kosar, Tevfik

2010-05-20

Scientific applications and experimental facilities generate massive data sets that need to be transferred to remote collaborating sites for sharing, processing, and long term storage. In order to support increasingly data-intensive science, next generation research networks have been deployed to provide high-speed on-demand data access between collaborating institutions. In this paper, we present a practical model for online data scheduling in which data movement operations are scheduled in advance for end-to-end high performance transfers. In our model, data scheduler interacts with reservation managers and data transfer nodes in order to reserve available bandwidth to guarantee completion of jobs that are accepted and confirmed to satisfy preferred time constraint given by the user. Our methodology improves current systems by allowing researchers and higher level meta-schedulers to use data placement as a service where theycan plan ahead and reserve the scheduler time in advance for their data movement operations. We have implemented our algorithm and examined possible techniques for incorporation into current reservation frameworks. Performance measurements confirm that the proposed algorithm is efficient and scalable.

Cyclic delivery scheduling to customers with different priorities

Directory of Open Access Journals (Sweden)

Katarzyna Zofia Gdowska

2013-12-01

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

Dating Violence and Girls in the Juvenile Justice System

Science.gov (United States)

Kelly, Patricia J.; Cheng, An-Lin; Peralez-Dieckmann, Esther; Martinez, Elisabeth

2009-01-01

The purpose of this study is to explore the prevalence and associated behaviors of dating violence among a population of girls in the juvenile justice system. A sample of 590 girls from an urban juvenile justice system completed a questionnaire assessing attitudes and self-efficacy about and occurrence of dating violence. The analysis developed a…

75 FR 17742 - Filing Dates for the Georgia Special Election in the 9th Congressional District

Science.gov (United States)

2010-04-07

... 9th Congressional District AGENCY: Federal Election Commission. ACTION: Notice of filing dates for special election. SUMMARY: Georgia has scheduled a special general election on May 11, 2010, to fill the U... participate in the Georgia Special General and Special Runoff Elections shall file a 12-day Pre-General Report...

77 FR 56208 - Filing Dates for the Kentucky Special Election in the 4th Congressional District

Science.gov (United States)

2012-09-12

... 4th Congressional District AGENCY: Federal Election Commission. ACTION: Notice of filing dates for special election. SUMMARY: Kentucky has scheduled a general election on November 6, 2012, to fill the U.S... required to file reports in connection with the Special General Election on November 6, 2012, shall file a...

78 FR 53454 - Filing Dates for the Louisiana Special Elections in the 5th Congressional District

Science.gov (United States)

2013-08-29

... the 5th Congressional District AGENCY: Federal Election Commission. ACTION: Notice of filing dates for special election. SUMMARY: Louisiana has scheduled a Special General Election on October 19, 2013, to fill... Special General and Special Runoff Elections shall file a 12-day Pre-General Report on October 7, 2013; a...

75 FR 62131 - Filing Dates for the New York Special Election in the 29th Congressional District

Science.gov (United States)

2010-10-07

... 29th Congressional District AGENCY: Federal Election Commission. ACTION: Notice of filing dates for special election. SUMMARY: New York has scheduled a Special General Election on November 2, 2010, to fill.... Committees required to file reports in connection with the Special General Election on November 2, 2010...

76 FR 45797 - Filing Dates for the New York Special Election in the 9th Congressional District

Science.gov (United States)

2011-08-01

... 9th Congressional District AGENCY: Federal Election Commission. ACTION: Notice of filing dates for special election. SUMMARY: New York has scheduled a Special General Election on September 13, 2011, to.... Committees required to file reports in connection with the Special General Election on September 13, 2011...

A short-term operating room surgery scheduling problem integrating multiple nurses roster constraints.

Science.gov (United States)

Xiang, Wei; Yin, Jiao; Lim, Gino

2015-02-01

Operating room (OR) surgery scheduling determines the individual surgery's operation start time and assigns the required resources to each surgery over a schedule period, considering several constraints related to a complete surgery flow and the multiple resources involved. This task plays a decisive role in providing timely treatments for the patients while balancing hospital resource utilization. The originality of the present study is to integrate the surgery scheduling problem with real-life nurse roster constraints such as their role, specialty, qualification and availability. This article proposes a mathematical model and an ant colony optimization (ACO) approach to efficiently solve such surgery scheduling problems. A modified ACO algorithm with a two-level ant graph model is developed to solve such combinatorial optimization problems because of its computational complexity. The outer ant graph represents surgeries, while the inner graph is a dynamic resource graph. Three types of pheromones, i.e. sequence-related, surgery-related, and resource-related pheromone, fitting for a two-level model are defined. The iteration-best and feasible update strategy and local pheromone update rules are adopted to emphasize the information related to the good solution in makespan, and the balanced utilization of resources as well. The performance of the proposed ACO algorithm is then evaluated using the test cases from (1) the published literature data with complete nurse roster constraints, and 2) the real data collected from a hospital in China. The scheduling results using the proposed ACO approach are compared with the test case from both the literature and the real life hospital scheduling. Comparison results with the literature shows that the proposed ACO approach has (1) an 1.5-h reduction in end time; (2) a reduction in variation of resources' working time, i.e. 25% for ORs, 50% for nurses in shift 1 and 86% for nurses in shift 2; (3) an 0.25h reduction in

Status and schedule of J-PARC 50 GeV synchrotron

International Nuclear Information System (INIS)

Oogoe, Takao; Yoshioka, Masakazu; Kobayashi, Hitoshi; Takeuchi, Yasunori; Shirakata, Masashi; Shirakabe, Yoshihisa; Kuniyasu, Yuu; Oki, Hiroshi; Takiyama, Youichi

2005-01-01

Japan Proton Accelerator Research Complex (J-PARC) is the research complex based on three high intensity proton Accelerators: a linac, a 3 GeV synchrotron (RCS), and a 50 GeV synchrotron (MR). The construction of the MR started in 2002, and its beam commissioning is scheduled in January of 2008. The accelerator tunnel of the J-PARC 50 GeV Synchrotron is still under construction, and will be completed at the end of 2006. Installation of accelerator-components is scheduled to start in July 2005 in parallel with civil and utility construction. This document describes how to install accelerator components in the tunnel and civil engineering of the tunnel. (author)

Constraint-based scheduling applying constraint programming to scheduling problems

CERN Document Server

Baptiste, Philippe; Nuijten, Wim

2001-01-01

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

Scheduling for decommissioning projects

International Nuclear Information System (INIS)

Podmajersky, O.E.

1987-01-01

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

Program reference schedule baseline

International Nuclear Information System (INIS)

1986-07-01

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

Hybrid Differential Evolution Optimisation for Earth Observation Satellite Scheduling with Time-Dependent Earliness-Tardiness Penalties

Directory of Open Access Journals (Sweden)

Guoliang Li

2017-01-01

Full Text Available We study the order acceptance and scheduling (OAS problem with time-dependent earliness-tardiness penalties in a single agile earth observation satellite environment where orders are defined by their release dates, available processing time windows ranging from earliest start date to deadline, processing times, due dates, sequence-dependent setup times, and revenues. The objective is to maximise total revenue, where the revenue from an order is a piecewise linear function of its earliness and tardiness with reference to its due date. We formulate this problem as a mixed integer linear programming model and develop a novel hybrid differential evolution (DE algorithm under self-adaptation framework to solve this problem. Compared with classical DE, hybrid DE employs two mutation operations, scaling factor adaptation and crossover probability adaptation. Computational tests indicate that the proposed algorithm outperforms classical DE in addition to two other variants of DE.

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.

Russia, USA set to complete nuclear safety programme ahead of schedule

CERN Multimedia

2003-01-01

"The amount of work done by the United States and Russia on the implementation of the programme for security, account and control of nuclear materials has increased three-fold in 2003 as compared with the previous year. The two countries are going to complete it by 2008, two years earlier than initially planned" (2 paragraphs).

Constraint-based scheduling

Science.gov (United States)

Zweben, Monte

1993-01-01

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

Capturing the benefits of complete streets.

Science.gov (United States)

2015-12-01

Anecdotal information indicates that private investment and property value increases are associated : with featured Complete Streets projects. However, to date, little research has been done to confirm : these benefits. Much of the relevant literatur...

SCT Barrel Assembly Complete

CERN Multimedia

L. Batchelor

As reported in the April 2005 issue of the ATLAS eNews, the first of the four Semiconductor Tracker (SCT) barrels, complete with modules and services, arrived safely at CERN in January of 2005. In the months since January, the other three completed barrels arrived as well, and integration of the four barrels into the entire barrel assembly commenced at CERN, in the SR1 building on the ATLAS experimental site, in July. Assembly was completed on schedule in September, with the addition of the innermost layer to the 4-barrel assembly. Work is now underway to seal the barrel thermal enclosure. This is necessary in order to enclose the silicon tracker in a nitrogen atmosphere and provide it with faraday-cage protection, and is a delicate and complicated task: 352 silicon module powertapes, 352 readout-fibre bundles, and over 400 Detector Control System sensors must be carefully sealed into the thermal enclosure bulkhead. The team is currently verifying the integrity of the low mass cooling system, which must be d...

Perceptions of randomized security schedules.

Science.gov (United States)

Scurich, Nicholas; John, Richard S

2014-04-01

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

76 FR 16419 - Filing Dates for the New York Special Election in the 26th Congressional District

Science.gov (United States)

2011-03-23

... 26th Congressional District AGENCY: Federal Election Commission. ACTION: Notice of filing dates for special election. SUMMARY: New York has scheduled a Special General Election on May 24, 2011, to fill the.... Committees required to file reports in connection with the Special General Election on May 24, 2011, shall...

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

Directory of Open Access Journals (Sweden)

Basar Ogun

2018-05-01

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

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

OpenAIRE

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

2017-01-01

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

Accuracy and completeness of mortality data in the Department of Veterans Affairs

Directory of Open Access Journals (Sweden)

Maynard Charles

2006-04-01

Full Text Available Abstract Background One of the national mortality databases in the U.S. is the Beneficiary Identification and Record Locator Subsystem (BIRLS Death File that contains death dates of those who have received any benefits from the Department of Veterans Affairs (VA. The completeness of this database was shown to vary widely from cohort to cohort in previous studies. Three other sources of death dates are available in the VA that can complement the BIRLS Death File. The objective of this study is to evaluate the completeness and accuracy of death dates in the four sources available in the VA and to examine whether these four sources can be combined into a database with improved completeness and accuracy. Methods A random sample of 3,000 was drawn from 8.3 million veterans who received benefits from the VA between 1997 and 1999 and were alive on January 1, 1999 according to at least one source. Death dates found in BIRLS Death File, Medical SAS Inpatient Datasets, Medicare Vital Status, and Social Security Administration (SSA Death Master File were compared with dates obtained from the National Death Index. A combined dataset from these sources was also compared with National Death Index dates. Results Compared with the National Death Index, sensitivity (or the percentage of death dates correctly recorded in a source was 77.4% for BIRLS Death File, 12.0% for Medical SAS Inpatient Datasets, 83.2% for Medicare Vital Status, and 92.1% for SSA Death Master File. Over 95% of death dates in these sources agreed exactly with dates from the National Death Index. Death dates in the combined dataset demonstrated 98.3% sensitivity and 97.6% exact agreement with dates from the National Death Index. Conclusion The BIRLS Death File is not an adequate source of mortality data for the VA population due to incompleteness. When the four sources of mortality data are carefully combined, the resulting dataset can provide more timely data for death ascertainment than the

Neural nets for job-shop scheduling, will they do the job?

NARCIS (Netherlands)

Rooda, J.E.; Willems, T.M.; Goodwin, G.C.; Evans, R.J.

1993-01-01

A neural net structure has been developed which is capable of solving deterministic jobshop scheduling problems, part of the large class of np-complete problems. The problem was translated in an integer linear-programming format which facilitated translation in an adequate neural net structure. Use

Resource allocation in IT projects: using schedule optimization

Directory of Open Access Journals (Sweden)

Michael Chilton

2014-01-01

Full Text Available Resource allocation is the process of assigning resources to tasks throughout the life of a project. Despite sophisticated software packages devoted to keeping track of tasks, resources and resource assignments, it is often the case that project managers find some resources over-allocated and therefore unable to complete the assigned work in the allotted amount of time. Most scheduling software has provisions for leveling resources, but the techniques for doing so simply add time to the schedule and may cause delays in tasks that are critical to the project in meeting deadlines. This paper presents a software application that ensures that resources are properly balanced at the beginning of the project and eliminates the situation in which resources become over-allocated. It can be used in a multi-project environment and reused throughout the project as tasks, resource assignments and availability, and the project scope change. The application utilizes the bounded enumeration technique to formulate an optimal schedule for which both the task sequence and resource availability are taken into account. It is run on a database server to reduce the running time and make it a viable application for practitioners.

Vectorization of a penalty function algorithm for well scheduling

Science.gov (United States)

Absar, I.

1984-01-01

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

A Time Scheduling Model of Logistics Service Supply Chain Based on the Customer Order Decoupling Point: A Perspective from the Constant Service Operation Time

Science.gov (United States)

Yang, Yi; Xu, Haitao; Liu, Xiaoyan; Wang, Yijia; Liang, Zhicheng

2014-01-01

In mass customization logistics service, reasonable scheduling of the logistics service supply chain (LSSC), especially time scheduling, is benefit to increase its competitiveness. Therefore, the effect of a customer order decoupling point (CODP) on the time scheduling performance should be considered. To minimize the total order operation cost of the LSSC, minimize the difference between the expected and actual time of completing the service orders, and maximize the satisfaction of functional logistics service providers, this study establishes an LSSC time scheduling model based on the CODP. Matlab 7.8 software is used in the numerical analysis for a specific example. Results show that the order completion time of the LSSC can be delayed or be ahead of schedule but cannot be infinitely advanced or infinitely delayed. Obtaining the optimal comprehensive performance can be effective if the expected order completion time is appropriately delayed. The increase in supply chain comprehensive performance caused by the increase in the relationship coefficient of logistics service integrator (LSI) is limited. The relative concern degree of LSI on cost and service delivery punctuality leads to not only changes in CODP but also to those in the scheduling performance of the LSSC. PMID:24715818

A time scheduling model of logistics service supply chain based on the customer order decoupling point: a perspective from the constant service operation time.

Science.gov (United States)

Liu, Weihua; Yang, Yi; Xu, Haitao; Liu, Xiaoyan; Wang, Yijia; Liang, Zhicheng

2014-01-01

In mass customization logistics service, reasonable scheduling of the logistics service supply chain (LSSC), especially time scheduling, is benefit to increase its competitiveness. Therefore, the effect of a customer order decoupling point (CODP) on the time scheduling performance should be considered. To minimize the total order operation cost of the LSSC, minimize the difference between the expected and actual time of completing the service orders, and maximize the satisfaction of functional logistics service providers, this study establishes an LSSC time scheduling model based on the CODP. Matlab 7.8 software is used in the numerical analysis for a specific example. Results show that the order completion time of the LSSC can be delayed or be ahead of schedule but cannot be infinitely advanced or infinitely delayed. Obtaining the optimal comprehensive performance can be effective if the expected order completion time is appropriately delayed. The increase in supply chain comprehensive performance caused by the increase in the relationship coefficient of logistics service integrator (LSI) is limited. The relative concern degree of LSI on cost and service delivery punctuality leads to not only changes in CODP but also to those in the scheduling performance of the LSSC.

Optimal Due Date Assignment and Resource Allocation to Minimize the Weighted Number of Tardy Jobs on a Single Machine

OpenAIRE

Dvir Shabtay; George Steiner

2007-01-01

With the increased emphasis on the effective management of operational issues in supply chains, the timely delivery of products has become even more important. Companies have to quote attainable delivery dates and then meet these, or face large tardiness penalties. We study systems that can be modeled by single-machine scheduling problems with due date assignment and controllable job-processing times, which are either linear or convex functions of the amount of a continuously divisible and no...

Mass spectrometric detection of radiocarbon for dating applications

OpenAIRE

Synal Hans-Arno

2013-01-01

Radiocarbon is still the most important nuclide measured by accelerator mass spectrometry (AMS). The related capabilities for dating and tracer studies are eminent not only in archaeology but also drive important applications in the earth and environmental sciences as well as in biomedical research. So far standard mass spectrometric systems have not been capable of radiocarbon dating because of interfering molecular isobars which however can be completely eliminated in charge changing proces...

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

Science.gov (United States)

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

2017-09-01

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

Resource-constrained project scheduling problem: review of past and recent developments

Directory of Open Access Journals (Sweden)

Farhad Habibi

2018-01-01

Full Text Available The project scheduling problem is both practically and theoretically of paramount importance. From the practical perspective, improvement of project scheduling as a critical part of project management process can lead to successful project completion and significantly decrease of the relevant costs. From the theoretical perspective, project scheduling is regarded as one of the in-teresting optimization issues, which has attracted the attention of many researchers in the area of operations research. Therefore, the project scheduling issue has been significantly evaluated over time and has been developed from various aspects. In this research, the topics related to Re-source-Constrained Project Scheduling Problem (RCPSP are reviewed, recent developments in this field are evaluated, and the results are presented for future studies. In this regard, first, the standard problem of RCPSP is expressed and related developments are presented from four as-pects of resources, characteristics of activities, type of objective functions, and availability level of information. Following that, details about 216 articles conducted on RCPSP during 1980-2017 are expressed. At the end, in line with the statistics obtained from the evaluation of previ-ous articles, suggestions are made for the future studies in order to help the development of new issues in this area.

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

Science.gov (United States)

Luczynski, Kevin C; Hanley, Gregory P

2014-01-01

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

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

International Nuclear Information System (INIS)

Zhou Xiaojun; Lu Zhiqiang; Xi Lifeng

2012-01-01

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

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

Science.gov (United States)

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

2016-08-01

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

Scheduling 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

Department of Energy Delivery Commitment Schedules for spent nuclear fuel

International Nuclear Information System (INIS)

Klose, M.C.; Cole, B.M.

1993-01-01

The Delivery Commitment Schedule (DCS) provides Purchasers with the opportunity to inform the DOE of their plans for utilizing their allocations of projected spent nuclear fuel (SNF) acceptance capacity. This information will assist DOE in meeting its contractual waste acceptance responsibilities and in developing the Civilian Radioactive Waste Management System (CRWMS). 63 months prior to the delivery date, Purchasers submit a DCS(s) to designate: the range of discharge dates to the SNF the Purchaser desires to deliver, the fuel type, the type of transport cask required, the preferred shipping mode, and the particular site from which the Purchaser desires to deliver in the particular delivery year. The actual number of DCSs submitted by a Purchaser may vary according to the number of allocations they have and the number of DCSs they choose to submit for each allocation. Once a Purchaser submits a DCS, DOE will approve or disapprove the DCS within three months of receipt. The approved DCSs are used by DOE to assist in determining the baseline mix of truck and rail transportation casks. This paper delineates the DCS submittal process as well as the DCSs received to date along with their status and associated DOE commitments

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.

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

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

Science.gov (United States)

Imam, Mahmoud Hamada

2017-12-01

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

Adaptive Cost-Based Task Scheduling in Cloud Environment

Directory of Open Access Journals (Sweden)

Mohammed A. S. Mosleh

2016-01-01

Full Text Available Task execution in cloud computing requires obtaining stored data from remote data centers. Though this storage process reduces the memory constraints of the user’s computer, the time deadline is a serious concern. In this paper, Adaptive Cost-based Task Scheduling (ACTS is proposed to provide data access to the virtual machines (VMs within the deadline without increasing the cost. ACTS considers the data access completion time for selecting the cost effective path to access the data. To allocate data access paths, the data access completion time is computed by considering the mean and variance of the network service time and the arrival rate of network input/output requests. Then the task priority is assigned to the removed tasks based data access time. Finally, the cost of data paths are analyzed and allocated based on the task priority. Minimum cost path is allocated to the low priority tasks and fast access path are allocated to high priority tasks as to meet the time deadline. Thus efficient task scheduling can be achieved by using ACTS. The experimental results conducted in terms of execution time, computation cost, communication cost, bandwidth, and CPU utilization prove that the proposed algorithm provides better performance than the state-of-the-art methods.

A collaborative scheduling model for the supply-hub with multiple suppliers and multiple manufacturers.

Science.gov (United States)

Li, Guo; Lv, Fei; Guan, Xu

2014-01-01

This paper investigates a collaborative scheduling model in the assembly system, wherein multiple suppliers have to deliver their components to the multiple manufacturers under the operation of Supply-Hub. We first develop two different scenarios to examine the impact of Supply-Hub. One is that suppliers and manufacturers make their decisions separately, and the other is that the Supply-Hub makes joint decisions with collaborative scheduling. The results show that our scheduling model with the Supply-Hub is a NP-complete problem, therefore, we propose an auto-adapted differential evolution algorithm to solve this problem. Moreover, we illustrate that the performance of collaborative scheduling by the Supply-Hub is superior to separate decision made by each manufacturer and supplier. Furthermore, we also show that the algorithm proposed has good convergence and reliability, which can be applicable to more complicated supply chain environment.

A Multiagent Evolutionary Algorithm for the Resource-Constrained Project Portfolio Selection and Scheduling Problem

Directory of Open Access Journals (Sweden)

Yongyi Shou

2014-01-01

Full Text Available A multiagent evolutionary algorithm is proposed to solve the resource-constrained project portfolio selection and scheduling problem. The proposed algorithm has a dual level structure. In the upper level a set of agents make decisions to select appropriate project portfolios. Each agent selects its project portfolio independently. The neighborhood competition operator and self-learning operator are designed to improve the agent’s energy, that is, the portfolio profit. In the lower level the selected projects are scheduled simultaneously and completion times are computed to estimate the expected portfolio profit. A priority rule-based heuristic is used by each agent to solve the multiproject scheduling problem. A set of instances were generated systematically from the widely used Patterson set. Computational experiments confirmed that the proposed evolutionary algorithm is effective for the resource-constrained project portfolio selection and scheduling problem.

Preemptive scheduling with rejection

NARCIS (Netherlands)

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

2003-01-01

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

Preemptive scheduling with rejection

NARCIS (Netherlands)

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

2000-01-01

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

Hybrid Metaheuristics for Solving a Fuzzy Single Batch-Processing Machine Scheduling Problem

Directory of Open Access Journals (Sweden)

S. Molla-Alizadeh-Zavardehi

2014-01-01

Full Text Available This paper deals with a problem of minimizing total weighted tardiness of jobs in a real-world single batch-processing machine (SBPM scheduling in the presence of fuzzy due date. In this paper, first a fuzzy mixed integer linear programming model is developed. Then, due to the complexity of the problem, which is NP-hard, we design two hybrid metaheuristics called GA-VNS and VNS-SA applying the advantages of genetic algorithm (GA, variable neighborhood search (VNS, and simulated annealing (SA frameworks. Besides, we propose three fuzzy earliest due date heuristics to solve the given problem. Through computational experiments with several random test problems, a robust calibration is applied on the parameters. Finally, computational results on different-scale test problems are presented to compare the proposed algorithms.

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

NARCIS (Netherlands)

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

2014-01-01

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

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

NARCIS (Netherlands)

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

2011-01-01

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

NRC comprehensive records disposition schedule

International Nuclear Information System (INIS)

1992-03-01

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

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

Science.gov (United States)

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

2018-01-01

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

Timing analysis for embedded systems using non-preemptive EDF scheduling under bounded error arrivals

Directory of Open Access Journals (Sweden)

Michael Short

2017-07-01

Full Text Available Embedded systems consist of one or more processing units which are completely encapsulated by the devices under their control, and they often have stringent timing constraints associated with their functional specification. Previous research has considered the performance of different types of task scheduling algorithm and developed associated timing analysis techniques for such systems. Although preemptive scheduling techniques have traditionally been favored, rapid increases in processor speeds combined with improved insights into the behavior of non-preemptive scheduling techniques have seen an increased interest in their use for real-time applications such as multimedia, automation and control. However when non-preemptive scheduling techniques are employed there is a potential lack of error confinement should any timing errors occur in individual software tasks. In this paper, the focus is upon adding fault tolerance in systems using non-preemptive deadline-driven scheduling. Schedulability conditions are derived for fault-tolerant periodic and sporadic task sets experiencing bounded error arrivals under non-preemptive deadline scheduling. A timing analysis algorithm is presented based upon these conditions and its run-time properties are studied. Computational experiments show it to be highly efficient in terms of run-time complexity and competitive ratio when compared to previous approaches.

An Integrated Approach to Locality-Conscious Processor Allocation and Scheduling of Mixed-Parallel Applications

Energy Technology Data Exchange (ETDEWEB)

Vydyanathan, Naga; Krishnamoorthy, Sriram; Sabin, Gerald M.; Catalyurek, Umit V.; Kurc, Tahsin; Sadayappan, Ponnuswamy; Saltz, Joel H.

2009-08-01

Complex parallel applications can often be modeled as directed acyclic graphs of coarse-grained application-tasks with dependences. These applications exhibit both task- and data-parallelism, and combining these two (also called mixedparallelism), has been shown to be an effective model for their execution. In this paper, we present an algorithm to compute the appropriate mix of task- and data-parallelism required to minimize the parallel completion time (makespan) of these applications. In other words, our algorithm determines the set of tasks that should be run concurrently and the number of processors to be allocated to each task. The processor allocation and scheduling decisions are made in an integrated manner and are based on several factors such as the structure of the taskgraph, the runtime estimates and scalability characteristics of the tasks and the inter-task data communication volumes. A locality conscious scheduling strategy is used to improve inter-task data reuse. Evaluation through simulations and actual executions of task graphs derived from real applications as well as synthetic graphs shows that our algorithm consistently generates schedules with lower makespan as compared to CPR and CPA, two previously proposed scheduling algorithms. Our algorithm also produces schedules that have lower makespan than pure taskand data-parallel schedules. For task graphs with known optimal schedules or lower bounds on the makespan, our algorithm generates schedules that are closer to the optima than other scheduling approaches.

Mass spectrometric detection of radiocarbon for dating applications

Energy Technology Data Exchange (ETDEWEB)

Synal, H.-A., E-mail: synal@phys.ethz.ch [ETH Zurich, Laboratory of Ion Beam Physics, Building HPK, 8093 Zurich (Switzerland); Schulze-Koenig, T.; Seiler, M.; Suter, M.; Wacker, L. [ETH Zurich, Laboratory of Ion Beam Physics, Building HPK, 8093 Zurich (Switzerland)

2013-01-15

Radiocarbon is still the most important nuclide measured by accelerator mass spectrometry (AMS). The related capabilities for dating and tracer studies are eminent not only in archaeology but also drive important applications in the earth and environmental sciences as well as in biomedical research. So far, standard mass spectrometric systems have not been capable of radiocarbon dating because of interfering molecular isobars which, however, can be completely eliminated in charge changing processes at high ion beam energies (MeV) [1,2]. Here, we present a novel type mass spectrometry system for radiocarbon analyses. Radiocarbon dating was performed using 45 keV {sup 14}C ions from the ion source and a molecule dissociation unit kept at ground potential. This proof-of-principle experiment demonstrates for the first time the feasibility of mass spectrometric radiocarbon dating without an accelerator. The results obtained will be the basis of an optimized design for a radiocarbon dating instrument comparable in size, complexity and cost to standard mass spectrometers.

Mass spectrometric detection of radiocarbon for dating applications

International Nuclear Information System (INIS)

Synal, H.-A.; Schulze-König, T.; Seiler, M.; Suter, M.; Wacker, L.

2013-01-01

Radiocarbon is still the most important nuclide measured by accelerator mass spectrometry (AMS). The related capabilities for dating and tracer studies are eminent not only in archaeology but also drive important applications in the earth and environmental sciences as well as in biomedical research. So far, standard mass spectrometric systems have not been capable of radiocarbon dating because of interfering molecular isobars which, however, can be completely eliminated in charge changing processes at high ion beam energies (MeV) [1,2]. Here, we present a novel type mass spectrometry system for radiocarbon analyses. Radiocarbon dating was performed using 45 keV 14 C ions from the ion source and a molecule dissociation unit kept at ground potential. This proof-of-principle experiment demonstrates for the first time the feasibility of mass spectrometric radiocarbon dating without an accelerator. The results obtained will be the basis of an optimized design for a radiocarbon dating instrument comparable in size, complexity and cost to standard mass spectrometers.

Mass spectrometric detection of radiocarbon for dating applications

Science.gov (United States)

Synal, H.-A.; Schulze-König, T.; Seiler, M.; Suter, M.; Wacker, L.

2013-01-01

Radiocarbon is still the most important nuclide measured by accelerator mass spectrometry (AMS). The related capabilities for dating and tracer studies are eminent not only in archaeology but also drive important applications in the earth and environmental sciences as well as in biomedical research. So far, standard mass spectrometric systems have not been capable of radiocarbon dating because of interfering molecular isobars which, however, can be completely eliminated in charge changing processes at high ion beam energies (MeV) [1,2]. Here, we present a novel type mass spectrometry system for radiocarbon analyses. Radiocarbon dating was performed using 45 keV 14C ions from the ion source and a molecule dissociation unit kept at ground potential. This proof-of-principle experiment demonstrates for the first time the feasibility of mass spectrometric radiocarbon dating without an accelerator. The results obtained will be the basis of an optimized design for a radiocarbon dating instrument comparable in size, complexity and cost to standard mass spectrometers.

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

Directory of Open Access Journals (Sweden)

Zahedi Zahedi

2016-06-01

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

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

Science.gov (United States)

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

2005-08-01

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

Optimization of Task Scheduling Algorithm through QoS Parameters for Cloud Computing

Directory of Open Access Journals (Sweden)

Monika

2016-01-01

Full Text Available Cloud computing is an incipient innovation which broadly spreads among analysts. It furnishes clients with foundation, stage and programming as enhancement which is easily available by means of web. A cloud is a sort of parallel and conveyed framework comprising of a gathering of virtualized PCs that are utilized to execute various tasks to accomplish good execution time, accomplish due date and usage of its assets. The scheduling issue can be seen as the finding an ideal task of assignments over the accessible arrangement of assets with the goal that we can accomplish the wanted objectives for tasks. This paper presents an optimal algorithm for scheduling tasks to get their waiting time as a QoS parameter. The algorithm is simulated using Cloudsim simulator and experiments are carried out to help clients to make sense of the bottleneck of utilizing no. of virtual machine parallely.

A new continuous-time formulation for scheduling crude oil operations

International Nuclear Information System (INIS)

Reddy, P. Chandra Prakash; Karimi, I.A.; Srinivasan, R.

2004-01-01

In today's competitive business climate characterized by uncertain oil markets, responding effectively and speedily to market forces, while maintaining reliable operations, is crucial to a refinery's bottom line. Optimal crude oil scheduling enables cost reduction by using cheaper crudes intelligently, minimizing crude changeovers, and avoiding ship demurrage. So far, only discrete-time formulations have stood up to the challenge of this important, nonlinear problem. A continuous-time formulation would portend numerous advantages, however, existing work in this area has just begun to scratch the surface. In this paper, we present the first complete continuous-time mixed integer linear programming (MILP) formulation for the short-term scheduling of operations in a refinery that receives crude from very large crude carriers via a high-volume single buoy mooring pipeline. This novel formulation accounts for real-world operational practices. We use an iterative algorithm to eliminate the crude composition discrepancy that has proven to be the Achilles heel for existing formulations. While it does not guarantee global optimality, the algorithm needs only MILP solutions and obtains excellent maximum-profit schedules for industrial problems with up to 7 days of scheduling horizon. We also report the first comparison of discrete- vs. continuous-time formulations for this complex problem. (Author)

Gender Still Matters: Effects of Workplace Discrimination on Employment Schedules of Young Professionals

Directory of Open Access Journals (Sweden)

Gabriele Plickert

2017-11-01

Full Text Available The influx of women into the legal profession has significantly changed the landscape of legal practice. Women lawyers today no longer face the challenges to entering the legal profession they encountered thirty years ago. However, despite these advancements, research continues to demonstrate that there are still gender-based issues women have to face in the legal workplace. Among these issues to date are the difficulties in combining responsibilities of work with responsibilities of families and children that underpin women’s employment and earning disadvantages. Using survey data from a national representative U.S. panel study of lawyers, we examine how work schedules, comparing full-time to part-time work, vary by personal disposition and workplace characteristics. Drawing from prominent explanations of gender inequality in the legal profession, we focus on inquiries of commitment to work, performance, ideal worker expectations, practice settings, and job satisfaction among dimensions of workplace characteristics and examine their effects on women and men lawyers’ work schedules. Logistic regression results show that work schedules significantly vary by gender, parental role, and experience of workplace discrimination. We find that, although all parents experience types of discrimination, there are still major differences in work schedules between mothers and fathers. Our study adds to the gender debate of employment and organizations by examining quantitatively experiences of workplace discrimination.

An Evaluation of Photographic Activity Schedules to Increase Independent Playground Skills in Young Children with Autism

Science.gov (United States)

Akers, Jessica S.; Higbee, Thomas S.; Pollard, Joy S.; Pellegrino, Azure J.; Gerencser, Kristina R.

2016-01-01

We used photographic activity schedules to increase the number of play activities completed by children with autism during unstructured time on the playground. All 3 participants engaged in more playground activities during and after training, and they continued to complete activities when novel photographs were introduced.

Consequences of Dating for Post-Divorce Maternal Well-Being

Science.gov (United States)

Langlais, Michael R.; Anderson, Edward R.; Greene, Shannon M.

2016-01-01

Repartnering has been linked to health benefits for mothers, yet few studies have examined relationship quality in this context. According to the divorce-stress-adaptation perspective, relationship quality may influence the relationship between maternal well-being and dating after divorce. The current study examines the consequences of dating, relationship quality, and dating transitions (breaking up and dating new partners) on maternal well-being (negative affect and life satisfaction). Using monthly surveys completed by mothers over a two-year period after filing for divorce, we examined changes in intercepts and slopes of dating status and transitions for maternal well-being while also testing the effects of relationship quality. Mothers entering high-quality relationships were likely to report boosts in well-being at relationship initiation compared to single mothers and mothers entering low-quality relationships. Mothers entering lower-quality relationships were likely to report lower levels of well-being than single mothers. Dating transitions were associated with increases in well-being. Implications for maternal adjustment are discussed. PMID:27746511

Preparation phase of Mochovce NPP unit 3 and 4 construction completion

International Nuclear Information System (INIS)

Cillik, I.; Tvaroska, V.; Liska, P.; Ziman, V.

2005-01-01

In this presentation authors deal with preparation phase of Mochovce NPP unit 3 and 4 construction completion. The preparation phase of the Mochovce unit 3 and 4 construction completion gives following main outputs: (a) Detail Safety Concept gives definitive complex safety and technical improvement of MO34, more precise analysis of the total cost of construction completion, a list of potential suppliers and construction completion time schedule; (b) Appendices of Basic Design Documentation and Preliminary SAR serves as basic documentation for UJD SR decision making according to Law No. 541 for start of Realization Phase; (c) The Preparation Phase represents effective tool for start of MO34 construction completion Realization Phase.

A Hybrid Differential Evolution and Tree Search Algorithm for the Job Shop Scheduling Problem

Directory of Open Access Journals (Sweden)

Rui Zhang

2011-01-01

Full Text Available The job shop scheduling problem (JSSP is a notoriously difficult problem in combinatorial optimization. In terms of the objective function, most existing research has been focused on the makespan criterion. However, in contemporary manufacturing systems, due-date-related performances are more important because they are essential for maintaining a high service reputation. Therefore, in this study we aim at minimizing the total weighted tardiness in JSSP. Considering the high complexity, a hybrid differential evolution (DE algorithm is proposed for the problem. To enhance the overall search efficiency, a neighborhood property of the problem is discovered, and then a tree search procedure is designed and embedded into the DE framework. According to the extensive computational experiments, the proposed approach is efficient in solving the job shop scheduling problem with total weighted tardiness objective.

Designing an advanced available-to-promise mechanism compatible with the make-to-forecast production systems through integrating inventory allocation and job shop scheduling with due dates and weighted earliness/tardiness cost

Directory of Open Access Journals (Sweden)

Masoud Rabbani

2016-06-01

Full Text Available In the competitive business world, applying a reliable and powerful mechanism to support decision makers in manufacturing companies and helping them save time by considering varieties of effective factors is an inevitable issue. Advanced Available-to-Promise is a perfect tool to design and perform such a mechanism. In this study, this mechanism which is compatible with the Make-to-Forecast production systems is presented. The ability to distinguish between batch mode and real-time mode advanced available-to-promise is one of the unique superiorities of the proposed model. We also try to strengthen this mechanism by integrating the inventory allocation and job shop scheduling by considering due dates and weighted earliness/tardiness cost that leads to more precise decisions. A mixed integer programming (MIP model and a heuristic algorithm according to its disability to solve large size problems are presented. The designed experiments and the obtained results have proved the efficiency of the proposed heuristic method.

Linguistic dating of biblical texts

DEFF Research Database (Denmark)

Young, Ian; Rezetko, Robert; Ehrensvärd, Martin Gustaf

Since the beginning of critical scholarship biblical texts have been dated using linguistic evidence. In recent years this has become a controversial topic, especially with the publication of Ian Young (ed.), Biblical Hebrew: Studies in Chronology and Typology (2003). However, until now there has...... been no introduction and comprehensive study of the field. Volume 1 introduces the field of linguistic dating of biblical texts, particularly to intermediate and advanced students of biblical Hebrew who have a reasonable background in the language, having completed at least an introductory course...... in this volume are: What is it that makes Archaic Biblical Hebrew archaic , Early Biblical Hebrew early , and Late Biblical Hebrew late ? Does linguistic typology, i.e. different linguistic characteristics, convert easily and neatly into linguistic chronology, i.e. different historical origins? A large amount...

A Collaborative Scheduling Model for the Supply-Hub with Multiple Suppliers and Multiple Manufacturers

Directory of Open Access Journals (Sweden)

Guo Li

2014-01-01

Full Text Available This paper investigates a collaborative scheduling model in the assembly system, wherein multiple suppliers have to deliver their components to the multiple manufacturers under the operation of Supply-Hub. We first develop two different scenarios to examine the impact of Supply-Hub. One is that suppliers and manufacturers make their decisions separately, and the other is that the Supply-Hub makes joint decisions with collaborative scheduling. The results show that our scheduling model with the Supply-Hub is a NP-complete problem, therefore, we propose an auto-adapted differential evolution algorithm to solve this problem. Moreover, we illustrate that the performance of collaborative scheduling by the Supply-Hub is superior to separate decision made by each manufacturer and supplier. Furthermore, we also show that the algorithm proposed has good convergence and reliability, which can be applicable to more complicated supply chain environment.

A Collaborative Scheduling Model for the Supply-Hub with Multiple Suppliers and Multiple Manufacturers

Science.gov (United States)

Lv, Fei; Guan, Xu

2014-01-01

This paper investigates a collaborative scheduling model in the assembly system, wherein multiple suppliers have to deliver their components to the multiple manufacturers under the operation of Supply-Hub. We first develop two different scenarios to examine the impact of Supply-Hub. One is that suppliers and manufacturers make their decisions separately, and the other is that the Supply-Hub makes joint decisions with collaborative scheduling. The results show that our scheduling model with the Supply-Hub is a NP-complete problem, therefore, we propose an auto-adapted differential evolution algorithm to solve this problem. Moreover, we illustrate that the performance of collaborative scheduling by the Supply-Hub is superior to separate decision made by each manufacturer and supplier. Furthermore, we also show that the algorithm proposed has good convergence and reliability, which can be applicable to more complicated supply chain environment. PMID:24892104

Project Schedule Simulation

DEFF Research Database (Denmark)

Mizouni, Rabeb; Lazarova-Molnar, Sanja

2015-01-01

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

KASS v.2.2. scheduling software for construction

Directory of Open Access Journals (Sweden)

Krzemiński Michał

2016-01-01

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

On the number of different dynamics in Boolean networks with deterministic update schedules.

Science.gov (United States)

Aracena, J; Demongeot, J; Fanchon, E; Montalva, M

2013-04-01

Deterministic Boolean networks are a type of discrete dynamical systems widely used in the modeling of genetic networks. The dynamics of such systems is characterized by the local activation functions and the update schedule, i.e., the order in which the nodes are updated. In this paper, we address the problem of knowing the different dynamics of a Boolean network when the update schedule is changed. We begin by proving that the problem of the existence of a pair of update schedules with different dynamics is NP-complete. However, we show that certain structural properties of the interaction diagraph are sufficient for guaranteeing distinct dynamics of a network. In [1] the authors define equivalence classes which have the property that all the update schedules of a given class yield the same dynamics. In order to determine the dynamics associated to a network, we develop an algorithm to efficiently enumerate the above equivalence classes by selecting a representative update schedule for each class with a minimum number of blocks. Finally, we run this algorithm on the well known Arabidopsis thaliana network to determine the full spectrum of its different dynamics. Copyright © 2013 Elsevier Inc. All rights reserved.

Metaheuristic Based Scheduling Meta-Tasks in Distributed Heterogeneous Computing Systems

Directory of Open Access Journals (Sweden)

Hesam Izakian

2009-07-01

Full Text Available Scheduling is a key problem in distributed heterogeneous computing systems in order to benefit from the large computing capacity of such systems and is an NP-complete problem. In this paper, we present a metaheuristic technique, namely the Particle Swarm Optimization (PSO algorithm, for this problem. PSO is a population-based search algorithm based on the simulation of the social behavior of bird flocking and fish schooling. Particles fly in problem search space to find optimal or near-optimal solutions. The scheduler aims at minimizing makespan, which is the time when finishes the latest task. Experimental studies show that the proposed method is more efficient and surpasses those of reported PSO and GA approaches for this problem.

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

Directory of Open Access Journals (Sweden)

Helio Yochihiro Fuchigami

2015-12-01

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

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

NRC comprehensive records disposition schedule

International Nuclear Information System (INIS)

1982-07-01

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

Flexible Scheduling May Have a Positive Impact on School Library Circulation. A Review of: Gavigan, K., Pribesh, S., & Dickinson, G. (2010. Fixed or flexible schedule? Schedule impacts and school library circulation. Library and Information Science Research, 32(2, 131-37.

Directory of Open Access Journals (Sweden)

Ann Medaille

2011-03-01

Full Text Available Objective – To determine whether a significant, positive relationship exists between flexible scheduling in elementary school library media centers and per-pupil circulation statistics.Design – Online survey.Setting – Library media centers in public elementary schools in two states of the United States.Subjects – A total of 88 elementary school library media specialists completed the survey.Methods – A 22-question online survey was created using Inquisite software. A link to the survey was sent via e-mail to a 600-person random sample of public school library media specialists whose names were drawn from the memberships of the North Carolina School Library Media Association and the Virginia Educational Media Association, with combined memberships totalling approximately 2,000. A random sample of 600 was chosen to provide a 95% confidence level with a confidence interval of plus or minus three points. The survey included questions about school schedules (flexible, partially flexible, or fixed, collection size, circulation statistics, total student enrolment, school type (elementary, middle, or high, school location (urban, rural, or suburban, percentage of students eligible for free and reduced price lunch, numbers of full-time professional library media specialists employed at the school, access procedures, and library closure information. The survey response rate was 29.3% (176 respondents. Because fixed versus flexible scheduling is an issue that primarily affects elementary schools, the authors further narrowed their subject pool to 88 elementary school respondents. Data were analyzed using SPSS 16.0 statistical software. Correlation analysis, including the analysis of covariance (ANCOVA, was used to compare differences in the three scheduling types and to control for other variables (such as location, socioeconomic status, collection size, staffing, days closed, and others that may affect circulation.Main Results – Of the 88

Tri-Party Agreement Milestone M-45-07A; complete evaluation of subsurface barrier feasibility: Summary report

Energy Technology Data Exchange (ETDEWEB)

Cox, G.E.; Peters, B.B.; Treat, R.L. [Enserch Environmental Corp., Richland, WA (United States); Bazinet, G.D.; Cruse, J.M.; Hampsten, K.L. [Westinghouse Hanford Co., Richland, WA (United States)

1994-09-01

The US Department of Energy (DOE) has established the Tank Waste Remediation System (TWRS) program to safely manage and dispose the low-level and high-level radioactive and hazardous wastes currently held in 177 tanks and approximately 1,900 sealed capsules located on the Hanford Site. The remediation of the entire Hanford Site is being conducted under the Hanford Federal Facility Agreement and Consent Order, otherwise known as the Tri-Party Agreement. The three parties that concluded the agreement are the DOE, the US Environmental Protection Agency (EPA), and the Washington State Department of Ecology (Ecology). The purpose of the Tri-Party Agreement is to ensure that Hanford Site activities are performed in a manner that protects the public health, welfare, and the environment. The agreement provides a framework and structure for the many different agencies and regulations under which work is performed on the Site, listing responsibilities and attaching scheduled dates of completion for minimum performances (known as milestones). The Tri-Party Agreement Milestone M-45-07A requires that an assessment of the feasibility of subsurface barriers to support retrieval of tank waste be performed. The activities to meet this milestone have been completed, and are documented herein.

Tri-Party Agreement Milestone M-45-07A; complete evaluation of subsurface barrier feasibility: Summary report

International Nuclear Information System (INIS)

Cox, G.E.; Peters, B.B.; Treat, R.L.; Bazinet, G.D.; Cruse, J.M.; Hampsten, K.L.

1994-09-01

The US Department of Energy (DOE) has established the Tank Waste Remediation System (TWRS) program to safely manage and dispose the low-level and high-level radioactive and hazardous wastes currently held in 177 tanks and approximately 1,900 sealed capsules located on the Hanford Site. The remediation of the entire Hanford Site is being conducted under the Hanford Federal Facility Agreement and Consent Order, otherwise known as the Tri-Party Agreement. The three parties that concluded the agreement are the DOE, the US Environmental Protection Agency (EPA), and the Washington State Department of Ecology (Ecology). The purpose of the Tri-Party Agreement is to ensure that Hanford Site activities are performed in a manner that protects the public health, welfare, and the environment. The agreement provides a framework and structure for the many different agencies and regulations under which work is performed on the Site, listing responsibilities and attaching scheduled dates of completion for minimum performances (known as milestones). The Tri-Party Agreement Milestone M-45-07A requires that an assessment of the feasibility of subsurface barriers to support retrieval of tank waste be performed. The activities to meet this milestone have been completed, and are documented herein

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

Science.gov (United States)

Xie, Zhiqiang; Shao, Xia; Xin, Yu

2016-01-01

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

Improved Space Surveillance Network (SSN) Scheduling using Artificial Intelligence Techniques

Science.gov (United States)

Stottler, D.

There are close to 20,000 cataloged manmade objects in space, the large majority of which are not active, functioning satellites. These are tracked by phased array and mechanical radars and ground and space-based optical telescopes, collectively known as the Space Surveillance Network (SSN). A better SSN schedule of observations could, using exactly the same legacy sensor resources, improve space catalog accuracy through more complementary tracking, provide better responsiveness to real-time changes, better track small debris in low earth orbit (LEO) through efficient use of applicable sensors, efficiently track deep space (DS) frequent revisit objects, handle increased numbers of objects and new types of sensors, and take advantage of future improved communication and control to globally optimize the SSN schedule. We have developed a scheduling algorithm that takes as input the space catalog and the associated covariance matrices and produces a globally optimized schedule for each sensor site as to what objects to observe and when. This algorithm is able to schedule more observations with the same sensor resources and have those observations be more complementary, in terms of the precision with which each orbit metric is known, to produce a satellite observation schedule that, when executed, minimizes the covariances across the entire space object catalog. If used operationally, the results would be significantly increased accuracy of the space catalog with fewer lost objects with the same set of sensor resources. This approach inherently can also trade-off fewer high priority tasks against more lower-priority tasks, when there is benefit in doing so. Currently the project has completed a prototyping and feasibility study, using open source data on the SSN's sensors, that showed significant reduction in orbit metric covariances. The algorithm techniques and results will be discussed along with future directions for the research.

Next Generation CANDU: Conceptual Design for a Short Construction Schedule

International Nuclear Information System (INIS)

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

2002-01-01

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

Para-aminobenzoic acid (PABA) used as a marker for completeness of 24 hour urine: effects of age and dosage scheduling

DEFF Research Database (Denmark)

Jakobsen, J.; Pedersen, Agnes Nadelmann; Ovesen, L.

2003-01-01

collections in this age group will be rejected unjustly (false-negatives). Also, with the currently recommended dosage schedule (PABA taken with the main meals) the risk of false-positive 24 h urine collections prevails. With refinement of the PABA test procedure, ie employing a specific analytical method......Objective: To examine the age dependency of the urinary para-aminobenzoic acid (PABA) excretion, and if a delayed PABA excretion can be overcome by advancing intake schedule; and to examine the recovery of PABA in fractionated urinary samples collected during 24 h after single and repeated doses...... specimens for 24 h after a morning dose of 80 mg of PABA, and another subgroup of 10 subjects collected individual urine specimens for 24 h after ingestion of 80 mg of PABA three times at mealtimes. Subjects: Employees and relatives from the Danish Food Administration. Setting: Ninety-nine healthy...

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

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…

Dating Violence and Self-Injury among Undergraduate College Students: Attitudes and Experiences

Science.gov (United States)

Murray, Christine E.; Wester, Kelly L.; Paladino, Derrick A.

2008-01-01

An Internet-based survey about dating violence and self-injury was completed by 1,777 undergraduates. A regression analysis tested if recent dating violence victimization and perpetration experiences predicted whether participants self-injured in the past 90 days, after controlling for demographic variables and attitudes toward self-injury and…

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

Science.gov (United States)

2017-10-26

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

Schedule-Aware Workflow Management Systems

Science.gov (United States)

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

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

Revisiting Symbiotic Job Scheduling

OpenAIRE

Eyerman , Stijn; Michaud , Pierre; Rogiest , Wouter

2015-01-01

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

SPANR planning and scheduling

Science.gov (United States)

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

2001-07-01

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

Self-scheduling with Microsoft Excel.

Science.gov (United States)

Irvin, S A; Brown, H N

1999-01-01

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

The development of stochastic process modeling through risk analysis derived from scheduling of NPP project

International Nuclear Information System (INIS)

Lee, Kwang Ho; Roh, Myung Sub

2013-01-01

There are so many different factors to consider when constructing a nuclear power plant successfully from planning to decommissioning. According to PMBOK, all projects have nine domains from a holistic project management perspective. They are equally important to all projects, however, this study focuses mostly on the processes required to manage timely completion of the project and conduct risk management. The overall objective of this study is to let you know what the risk analysis derived from scheduling of NPP project is, and understand how to implement the stochastic process modeling through risk management. Building the Nuclear Power Plant is required a great deal of time and fundamental knowledge related to all engineering. That means that integrated project scheduling management with so many activities is necessary and very important. Simulation techniques for scheduling of NPP project using Open Plan program, Crystal Ball program, and Minitab program can be useful tools for designing optimal schedule planning. Thus far, Open Plan and Monte Carlo programs have been used to calculate the critical path for scheduling network analysis. And also, Minitab program has been applied to monitor the scheduling risk. This approach to stochastic modeling through risk analysis of project activities is very useful for optimizing the schedules of activities using Critical Path Method and managing the scheduling control of NPP project. This study has shown new approach to optimal scheduling of NPP project, however, this does not consider the characteristic of activities according to the NPP site conditions. Hence, this study needs more research considering those factors

The development of stochastic process modeling through risk analysis derived from scheduling of NPP project

Energy Technology Data Exchange (ETDEWEB)

Lee, Kwang Ho; Roh, Myung Sub [KEPCO International Nuclear Graduate School, Ulsan (Korea, Republic of)

2013-10-15

There are so many different factors to consider when constructing a nuclear power plant successfully from planning to decommissioning. According to PMBOK, all projects have nine domains from a holistic project management perspective. They are equally important to all projects, however, this study focuses mostly on the processes required to manage timely completion of the project and conduct risk management. The overall objective of this study is to let you know what the risk analysis derived from scheduling of NPP project is, and understand how to implement the stochastic process modeling through risk management. Building the Nuclear Power Plant is required a great deal of time and fundamental knowledge related to all engineering. That means that integrated project scheduling management with so many activities is necessary and very important. Simulation techniques for scheduling of NPP project using Open Plan program, Crystal Ball program, and Minitab program can be useful tools for designing optimal schedule planning. Thus far, Open Plan and Monte Carlo programs have been used to calculate the critical path for scheduling network analysis. And also, Minitab program has been applied to monitor the scheduling risk. This approach to stochastic modeling through risk analysis of project activities is very useful for optimizing the schedules of activities using Critical Path Method and managing the scheduling control of NPP project. This study has shown new approach to optimal scheduling of NPP project, however, this does not consider the characteristic of activities according to the NPP site conditions. Hence, this study needs more research considering those factors.

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

NARCIS (Netherlands)

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

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

Immunization Schedules for Adults

Science.gov (United States)

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

Nontraditional work schedules for pharmacists.

Science.gov (United States)

Mahaney, Lynnae; Sanborn, Michael; Alexander, Emily

2008-11-15

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

A Longitudinal Investigation of Heavy Drinking and Physical Dating Violence in Men and Women

OpenAIRE

Stappenbeck, Cynthia A.; Fromme, Kim

2010-01-01

Examinations of heavy drinking and dating violence have typically focused on either female victimization or male perpetration; yet recent findings indicate that mutual aggression is the most common pattern of dating violence. The current study investigated the relation between heavy drinking and dating violence for both men and women. Participants (N = 2,247) completed surveys that assessed their heavy drinking and dating violence frequency across the first three years of college. Findings in...

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

Directory of Open Access Journals (Sweden)

M. Fera

2018-09-01

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

Joint optimization of production scheduling and machine group preventive maintenance

International Nuclear Information System (INIS)

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

2016-01-01

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

BIM-BASED SCHEDULING OF CONSTRUCTION

DEFF Research Database (Denmark)

Andersson, Niclas; Büchmann-Slorup, Rolf

2010-01-01

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

An Entropy-Based Upper Bound Methodology for Robust Predictive Multi-Mode RCPSP Schedules

Directory of Open Access Journals (Sweden)

Angela Hsiang-Ling Chen

2014-09-01

Full Text Available Projects are an important part of our activities and regardless of their magnitude, scheduling is at the very core of every project. In an ideal world makespan minimization, which is the most commonly sought objective, would give us an advantage. However, every time we execute a project we have to deal with uncertainty; part of it coming from known sources and part remaining unknown until it affects us. For this reason, it is much more practical to focus on making our schedules robust, capable of handling uncertainty, and even to determine a range in which the project could be completed. In this paper we focus on an approach to determine such a range for the Multi-mode Resource Constrained Project Scheduling Problem (MRCPSP, a widely researched, NP-complete problem, but without adding any subjective considerations to its estimation. We do this by using a concept well known in the domain of thermodynamics, entropy and a three-stage approach. First we use Artificial Bee Colony (ABC—an effective and powerful meta-heuristic—to determine a schedule with minimized makespan which serves as a lower bound. The second stage defines buffer times and creates an upper bound makespan using an entropy function, with the advantage over other methods that it only considers elements which are inherent to the schedule itself and does not introduce any subjectivity to the buffer time generation. In the last stage, we use the ABC algorithm with an objective function that seeks to maximize robustness while staying within the makespan boundaries defined previously and in some cases even below the lower boundary. We evaluate our approach with two different benchmarks sets: when using the PSPLIB for the MRCPSP benchmark set, the computational results indicate that it is possible to generate robust schedules which generally result in an increase of less than 10% of the best known solutions while increasing the robustness in at least 20% for practically every

Trajectories of dating violence: Differences by sexual minority status and gender.

Science.gov (United States)

Martin-Storey, Alexa; Fromme, Kim

2016-06-01

The purpose of this study was to examine how sexual minority status (as assessed using both identity and behavior) was associated with trajectories of dating violence. University students from a large Southwestern university completed questions on their sexual minority identity, the gender of their sexual partners, and about experiences of dating violence for six consecutive semesters (N = 1942). Latent growth curve modeling indicated that generally, trajectories of dating violence were stable across study participation. Sexual minority identity was associated with higher initial levels of dating violence at baseline, but also with greater decreases in dating violence across time. These differences were mediated by number of sexual partners. Having same and other-sex sexual partners was associated with higher levels of dating violence at baseline, and persisted in being associated with higher levels over time. No significant gender difference was observed regarding trajectories of dating violence. Copyright © 2016 The Foundation for Professionals in Services for Adolescents. Published by Elsevier Ltd. All rights reserved.

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

Directory of Open Access Journals (Sweden)

Rui Zhang

2013-01-01

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

78 FR 66803 - Fee Schedule for the Transfer of U.S. Treasury Book-Entry Securities Held on the National Book...

Science.gov (United States)

2013-11-06

... Transfer of U.S. Treasury Book-Entry Securities Held on the National Book-Entry System AGENCY: Bureau of... (Treasury) is announcing a new fee schedule applicable to transfers of U.S. Treasury book-entry securities maintained on the National Book-Entry System (NBES) that occur on or after January 2, 2014. DATES: Effective...

Decentralized Job Scheduling in the Cloud Based on a Spatially Generalized Prisoner’s Dilemma Game

Directory of Open Access Journals (Sweden)

Gąsior Jakub

2015-12-01

Full Text Available We present in this paper a novel distributed solution to a security-aware job scheduling problem in cloud computing infrastructures. We assume that the assignment of the available resources is governed exclusively by the specialized brokers assigned to individual users submitting their jobs to the system. The goal of this scheme is allocating a limited quantity of resources to a specific number of jobs minimizing their execution failure probability and total completion time. Our approach is based on the Pareto dominance relationship and implemented at an individual user level. To select the best scheduling strategies from the resulting Pareto frontiers and construct a global scheduling solution, we developed a decision-making mechanism based on the game-theoretic model of Spatial Prisoner’s Dilemma, realized by selfish agents operating in the two-dimensional cellular automata space. Their behavior is conditioned by the objectives of the various entities involved in the scheduling process and driven towards a Nash equilibrium solution by the employed social welfare criteria. The performance of the scheduler applied is verified by a number of numerical experiments. The related results show the effectiveness and scalability of the scheme in the presence of a large number of jobs and resources involved in the scheduling process.

Actual status of project Mochovce NPP units 3 and 4 completion

International Nuclear Information System (INIS)

Niznan, S.

2005-01-01

In this presentation author deals with actual status of project Mochovce NPP units 3 and 4 completion. Present state of Mochovce NPP, Units 3 and 4 enables real assumption to completion. It is expected that such supplier companies can be used which are experienced in field of nuclear projects. Based on budget of 2002, it seems that completion costs of 45 billions SKK are real. These figures were confirmed by study performed by TRACTEBEL in 2004. Based on experience from Bohunice NPP completion as well as from Mochovce NPP, Units 1 and 2 completion and if decision milestone and project start up deadlines will be observed according to modified preliminary schedule of Mochovce NPP Units 3 and 4 completion, it seems as real that Unit 3 will be completed till 06/2011 and Unit 4 - till 12/2011.

Network scheduling at Belene NPP construction site

International Nuclear Information System (INIS)

Matveev, A.

2010-01-01

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

SPS completes LS1 activities

CERN Multimedia

Katarina Anthony

2014-01-01

On 27 June, the SPS closed its doors to the LS1 engineers, bringing to an end almost 17 months of activities. The machine now enters the hardware-testing phase in preparation for an October restart.   Photo 1: The SPS transfer tunnel, TT10, reinforced with steal beams. Having completed their LS1 activities right on schedule (to the day!), the SPS team is now preparing the machine for its restart. Over the next eight weeks, hardware tests of the SPS dipole and quadrupole power converters will be underway, led by the TE-EPC (Electrical Power Converters) team. "OP start-up test activities will also be running in parallel, utilising the off hours when EPC is not using the machine," says David McFarlane, the SPS technical coordinator from the Engineering Department. "The primary beam testing phase will start at the beginning of September, once hardware tests and DSO safety tests have been completed." It has been a long journey to this point, with several major...

Psychological Abuse, Mental Health, and Acceptance of Dating Violence Among Adolescents.

Science.gov (United States)

Temple, Jeff R; Choi, Hye Jeong; Elmquist, JoAnna; Hecht, Michael; Miller-Day, Michelle; Stuart, Gregory L; Brem, Meagan; Wolford-Clevenger, Caitlin

2016-08-01

Existing literature indicates that acceptance of dating violence is a significant and robust risk factor for psychological dating abuse perpetration. Past work also indicates a significant relationship between psychological dating abuse perpetration and poor mental health. However, no known research has examined the relationship between acceptance of dating violence, perpetration of dating abuse, and mental health. In addition to exploring this complex relationship, the present study examines whether psychological abuse perpetration mediates the relationship between acceptance of dating violence and mental health (i.e., internalizing symptoms of depression, anxiety, and hostility). Three waves of longitudinal data were obtained from 1,042 ethnically diverse high school students in Texas. Participants completed assessments of psychological dating abuse perpetration, acceptance of dating violence, and internalizing symptoms (hostility and symptoms of anxiety and depression). As predicted, results indicated that perpetration of psychological abuse was significantly associated with acceptance of dating violence and all internalizing symptoms. Furthermore, psychological abuse mediated the relationship between acceptance of dating violence and internalizing symptoms. Findings from the present study suggest that acceptance of dating violence is an important target for the prevention of dating violence and related emotional distress. Copyright © 2016 Society for Adolescent Health and Medicine. Published by Elsevier Inc. All rights reserved.

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

Analyzing scheduling in the food-processing industry

DEFF Research Database (Denmark)

Akkerman, Renzo; van Donk, Dirk Pieter

2009-01-01

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

The operational flight and multi-crew scheduling problem

Directory of Open Access Journals (Sweden)

Stojković Mirela

2005-01-01

Full Text Available This paper introduces a new kind of operational multi-crew scheduling problem which consists in simultaneously modifying, as necessary, the existing flight departure times and planned individual work days (duties for the set of crew members, while respecting predefined aircraft itineraries. The splitting of a planned crew is allowed during a day of operations, where it is more important to cover a flight than to keep planned crew members together. The objective is to cover a maximum number of flights from a day of operations while minimizing changes in both the flight schedule and the next-day planned duties for the considered crew members. A new type of the same flight departure time constraints is introduced. They ensure that a flight which belongs to several personalized duties, where the number of duties is equal to the number of crew members assigned to the flight, will have the same departure time in each of these duties. Two variants of the problem are considered. The first variant allows covering of flights by less than the planned number of crew members, while the second one requires covering of flights by a complete crew. The problem is mathematically formulated as an integer nonlinear multi-commodity network flow model with time windows and supplementary constraints. The optimal solution approach is based on Dantzig-Wolfe decomposition/column generation embedded into a branch-and-bound scheme. The resulting computational times on commercial-size problems are very good. Our new simultaneous approach produces solutions whose quality is far better than that of the traditional sequential approach where the flight schedule has been changed first and then input as a fixed data to the crew scheduling problem.

Dating Violence and Substance Use as Longitudinal Predictors of Adolescents’ Risky Sexual Behavior

Science.gov (United States)

Shorey, Ryan C.; Fite, Paula J.; Choi, HyeJeong; Cohen, Joseph R.; Stuart, Gregory L.; Temple, Jeff R.

2015-01-01

Objective To examine dating violence perpetration and victimization (physical, psychological, and sexual) and lifetime substance use (alcohol, marijuana, and hard drugs) as longitudinal predictors of adolescents’ risky sexual behavior across one year, and to determine whether predictors varied across adolescents’ gender and ethnicity. Methods A sample of Caucasian, African American, and Hispanic male and female adolescents from 7 public high schools in Texas (N = 882) participated. Adolescents completed self-report measures of dating violence, lifetime substance use, and risky sexual behavior at baseline and, 1-year later, completed a second assessment of their risky sexual behavior. Results Path analysis demonstrated that greater physical dating violence victimization, lifetime alcohol use, lifetime marijuana use, and age (being older) were all significant predictors of risky sexual behavior at the 1-year follow-up. These results did not vary across gender or the three ethnic groups (Caucasian, African American, and Hispanic). Conclusions Overall, substance use was a longitudinal predictor of risky sexual behavior across the three ethnic groups, with physical dating violence victimization being the only type of dating violence longitudinally predicting risky sexual behavior. Prevention efforts should consider the roles of physical dating violence and substance use in preventing risky sexual behavior. PMID:25797949

Dating Violence and Substance Use as Longitudinal Predictors of Adolescents' Risky Sexual Behavior.

Science.gov (United States)

Shorey, Ryan C; Fite, Paula J; Choi, HyeJeong; Cohen, Joseph R; Stuart, Gregory L; Temple, Jeff R

2015-08-01

The objectives of this study is to examine dating violence perpetration and victimization (physical, psychological, and sexual) and lifetime substance use (alcohol, marijuana, and hard drugs) as longitudinal predictors of adolescents' risky sexual behavior across 1 year and to determine whether predictors varied across adolescents' gender and ethnicity. A sample of Caucasian, African American, and Hispanic male and female adolescents from seven public high schools in Texas (N = 882) participated. Adolescents completed self-report measures of dating violence, lifetime substance use, and risky sexual behavior at baseline and, 1-year later, completed a second assessment of their risky sexual behavior. Path analysis demonstrated that greater physical dating violence victimization, lifetime alcohol use, lifetime marijuana use, and age (being older) were all significant predictors of risky sexual behavior at the 1-year follow-up. These results did not vary across gender or the three ethnic groups (Caucasian, African American, and Hispanic). Overall, substance use was a longitudinal predictor of risky sexual behavior across the three ethnic groups, with physical dating violence victimization being the only type of dating violence longitudinally predicting risky sexual behavior. Prevention efforts should consider the roles of physical dating violence and substance use in preventing risky sexual behavior.

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

Conception of Self-Construction Production Scheduling System

Science.gov (United States)

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

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

Range Scheduling Aid (RSA)

Science.gov (United States)

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

1991-01-01

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

Scheduling of Irrigation and Leaching Requirements

Directory of Open Access Journals (Sweden)

Amer Hassan Al-haddad

2015-03-01

Full Text Available Iraq depends mainly on Tigris and Euphrates Rivers to provide high percentage of agricultural water use for thousands years. At last years, Iraq is suffering from shortage in water resources due to global climate changes and unfair water politics of the neighboring countries, which affected the future of agriculture plans for irrigation, added to that the lack of developed systems of water management in the irrigation projects and improper allocation of irrigation water, which reduces water use efficiency and lead to losing irrigation water and decreasing in agricultural yield. This study aims at studying the usability of irrigation and leaching scheduling within the irrigating projects and putting a complete annual or seasonal irrigation program as a solution for the scarcity of irrigation water, the increase of irrigation efficiency, lessening the salinity in the projects and preparing an integral irrigation calendar through field measurements of soil physical properties and chemical for project selected and compared to the results of the irrigation scheduling and leaching with what is proposed by the designers. The process is accomplished by using a computer program which was designed by Water Resources Department at the University of Baghdad, with some modification to generalize it and made it applicable to various climatic zone and different soil types. Study area represented by large project located at the Tigris River, and this project was (Al-Amara irrigation project. Sufficient samples of project's soil were collected so as to identify soil physical and chemical properties and the salinity of soil and water as well as identifying the agrarian cycles virtually applied to this project. Finally, a comparison was conducted between the calculated water quantities and the suggested ones by the designers. The research results showed that using this kind of scheduling (previously prepared irrigation and leaching scheduling with its properties

Two-Agent Single-Machine Scheduling of Jobs with Time-Dependent Processing Times and Ready Times

Directory of Open Access Journals (Sweden)

Jan-Yee Kung

2013-01-01

Full Text Available Scheduling involving jobs with time-dependent processing times has recently attracted much research attention. However, multiagent scheduling with simultaneous considerations of jobs with time-dependent processing times and ready times is relatively unexplored. Inspired by this observation, we study a two-agent single-machine scheduling problem in which the jobs have both time-dependent processing times and ready times. We consider the model in which the actual processing time of a job of the first agent is a decreasing function of its scheduled position while the actual processing time of a job of the second agent is an increasing function of its scheduled position. In addition, each job has a different ready time. The objective is to minimize the total completion time of the jobs of the first agent with the restriction that no tardy job is allowed for the second agent. We propose a branch-and-bound and several genetic algorithms to obtain optimal and near-optimal solutions for the problem, respectively. We also conduct extensive computational results to test the proposed algorithms and examine the impacts of different problem parameters on their performance.

Immunization Schedules for Infants and Children

Science.gov (United States)

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

A more complete library on your desktop

CERN Multimedia

2003-01-01

The CERN library announces two new services: a complete database on standards containing the description of 400,000 standards, and a collection of scientific journals with more than three million articles. These include historical papers, some of them dating from the end of the 19th century.

30 CFR 27.9 - Date for conducting tests.

Science.gov (United States)

2010-07-01

... Mineral Resources MINE SAFETY AND HEALTH ADMINISTRATION, DEPARTMENT OF LABOR TESTING, EVALUATION, AND... completing such other test work as may be in progress. [31 FR 10607, Aug. 9, 1966, as amended at 70 FR 46343.... The date of receipt of an application will determine the order of precedence for investigation and...

A Formal Product-Line Engineering Approach for Schedulers

NARCIS (Netherlands)

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

2017-01-01

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

Cost and schedule reduction for next-generation Candu

International Nuclear Information System (INIS)

Hopwood, J.M.; Yu, S.; Pakan, M.; Soulard, M.

2002-01-01

AECL has developed a suite of technologies for Candu R reactors that enable the next step in the evolution of the Candu family of heavy-water-moderated fuel-channel reactors. These technologies have been combined in the design for the Advanced Candu Reactor TM1 (ACRTM), AECL's next generation Candu power plant. The ACR design builds extensively on the existing Candu experience base, but includes innovations, in design and in delivery technology, that provide very substantial reductions in capital cost and in project schedules. In this paper, main features of next generation design and delivery are summarized, to provide the background basis for the cost and schedule reductions that have been achieved. In particular the paper outlines the impact of the innovative design steps for ACR: - Selection of slightly enriched fuel bundle design; - Use of light water coolant in place of traditional Candu heavy water coolant; - Compact core design with unique reactor physics benefits; - Optimized coolant and turbine system conditions. In addition to the direct cost benefits arising from efficiency improvement, and from the reduction in heavy water, the next generation Candu configuration results in numerous additional indirect cost benefits, including: - Reduction in number and complexity of reactivity mechanisms; - Reduction in number of heavy water auxiliary systems; - Simplification in heat transport and its support systems; - Simplified human-machine interface. The paper also describes the ACR approach to design for constructability. The application of module assembly and open-top construction techniques, based on Candu and other worldwide experience, has been proven to generate savings in both schedule durations and overall project cost, by reducing premium on-site activities, and by improving efficiency of system and subsystem assembly. AECL's up-to-date experience in the use of 3-D CADDS and related engineering tools has also been proven to reduce both engineering and

Robust and Flexible Scheduling with Evolutionary Computation

DEFF Research Database (Denmark)

Jensen, Mikkel T.

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

Optimal Rules for Single Machine Scheduling with Stochastic Breakdowns

Directory of Open Access Journals (Sweden)

Jinwei Gu

2014-01-01

Full Text Available This paper studies the problem of scheduling a set of jobs on a single machine subject to stochastic breakdowns, where jobs have to be restarted if preemptions occur because of breakdowns. The breakdown process of the machine is independent of the jobs processed on the machine. The processing times required to complete the jobs are constants if no breakdown occurs. The machine uptimes are independently and identically distributed (i.i.d. and are subject to a uniform distribution. It is proved that the Longest Processing Time first (LPT rule minimizes the expected makespan. For the large-scale problem, it is also showed that the Shortest Processing Time first (SPT rule is optimal to minimize the expected total completion times of all jobs.

A new intuitionistic fuzzy rule-based decision-making system for an operating system process scheduler.

Science.gov (United States)

Butt, Muhammad Arif; Akram, Muhammad

2016-01-01

We present a new intuitionistic fuzzy rule-based decision-making system based on intuitionistic fuzzy sets for a process scheduler of a batch operating system. Our proposed intuitionistic fuzzy scheduling algorithm, inputs the nice value and burst time of all available processes in the ready queue, intuitionistically fuzzify the input values, triggers appropriate rules of our intuitionistic fuzzy inference engine and finally calculates the dynamic priority (dp) of all the processes in the ready queue. Once the dp of every process is calculated the ready queue is sorted in decreasing order of dp of every process. The process with maximum dp value is sent to the central processing unit for execution. Finally, we show complete working of our algorithm on two different data sets and give comparisons with some standard non-preemptive process schedulers.

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

International Nuclear Information System (INIS)

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

1993-07-01

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

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

Energy Technology Data Exchange (ETDEWEB)

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

1993-07-01

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

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

Science.gov (United States)

2013-04-12

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

The comparison of absolute dating (Radiocarbon dating) and relative dating of Pringapus and Gondosuli temples

International Nuclear Information System (INIS)

Faisal, W; Arumbinang, H; Taftazani, A; Widayati, S; Sumiyatno; Suhardi

1996-01-01

The absolute dating (radiocarbon, 14 C dating) and relative dating of Pringapus and Gondosuli temples in Temanggung regency (district) of Central Java Province have been carried out. The field sampling was done especially with the purpose to obtain vertical data, so that excavation method was adopted in the case. The main data were the ecofacts of organic habitation such as bones, woods, charcoals, shells, and paper artefacts. The artefacts data were used as a comparison. The comparative data analysis were conducted at Yogyakarta archaeological Department Laboratory, thus included dating of artefacts which were performed according to archaeological analysis procedures, generally based on the attributes attached to the artefacts, whereas the absolute dating of charcoal samples were performed in the Radiocarbon Dating Laboratory at Yogyakarta Nuclear Research Centre. Based on the relative dating of epigraphy content on the andesit rock from Gondosuli Temple which showed the year of 754 Saka or 832 AD, the Pringapus Temple was estimated to be built in the 850 AD. According to the absolute dating (Radiocarbon Dating with delta 13 C and tree ring corrections) the age for Gondosuli temple based on GDS/LU-2/Spit-7 samples is (384 -602) AD and from GDS/LU-2/Spit-8 = (452 - 652) AD. With these significant differences in the results obtained, it can be concluded that culture environment where the sample were collected already existed before the temple was built. Further investigation is still required

Decentralized Ground Staff Scheduling

DEFF Research Database (Denmark)

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

2002-01-01

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

Multiuser switched diversity scheduling schemes

KAUST Repository

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

2012-01-01

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

Multiuser switched diversity scheduling schemes

KAUST Repository

Shaqfeh, Mohammad

2012-09-01

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

NASA Instrument Cost/Schedule Model

Science.gov (United States)

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

2011-01-01

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

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

DEFF Research Database (Denmark)

Hansen, Anders Dohn; Clausen, Jens

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

Dating Violence

Science.gov (United States)

... for Teens / Dating Violence Bulletins for Teens: Dating Violence What is it? If you are a victim ... often. If You Are a Victim of Dating Violence, You Might… Think it's your fault. Feel angry, ...

The triangle scheduling problem

NARCIS (Netherlands)

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

2017-01-01

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

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

Science.gov (United States)

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

2018-06-01

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

A System for Automatically Generating Scheduling Heuristics

Science.gov (United States)

Morris, Robert

1996-01-01

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

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

Science.gov (United States)

Seol, Ye-In; Kim, Young-Kuk

2014-01-01

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

An order insertion scheduling model of logistics service supply chain considering capacity and time factors.

Science.gov (United States)

Liu, Weihua; Yang, Yi; Wang, Shuqing; Liu, Yang

2014-01-01

Order insertion often occurs in the scheduling process of logistics service supply chain (LSSC), which disturbs normal time scheduling especially in the environment of mass customization logistics service. This study analyses order similarity coefficient and order insertion operation process and then establishes an order insertion scheduling model of LSSC with service capacity and time factors considered. This model aims to minimize the average unit volume operation cost of logistics service integrator and maximize the average satisfaction degree of functional logistics service providers. In order to verify the viability and effectiveness of our model, a specific example is numerically analyzed. Some interesting conclusions are obtained. First, along with the increase of completion time delay coefficient permitted by customers, the possible inserting order volume first increases and then trends to be stable. Second, supply chain performance reaches the best when the volume of inserting order is equal to the surplus volume of the normal operation capacity in mass service process. Third, the larger the normal operation capacity in mass service process is, the bigger the possible inserting order's volume will be. Moreover, compared to increasing the completion time delay coefficient, improving the normal operation capacity of mass service process is more useful.

Artificial intelligence approaches to astronomical observation scheduling

Science.gov (United States)

Johnston, Mark D.; Miller, Glenn

1988-01-01

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

Cloud computing task scheduling strategy based on differential evolution and ant colony optimization

Science.gov (United States)

Ge, Junwei; Cai, Yu; Fang, Yiqiu

2018-05-01

This paper proposes a task scheduling strategy DEACO based on the combination of Differential Evolution (DE) and Ant Colony Optimization (ACO), aiming at the single problem of optimization objective in cloud computing task scheduling, this paper combines the shortest task completion time, cost and load balancing. DEACO uses the solution of the DE to initialize the initial pheromone of ACO, reduces the time of collecting the pheromone in ACO in the early, and improves the pheromone updating rule through the load factor. The proposed algorithm is simulated on cloudsim, and compared with the min-min and ACO. The experimental results show that DEACO is more superior in terms of time, cost, and load.

Setting a date

International Nuclear Information System (INIS)

Moore, Glenis.

1987-01-01

Dating techniques are discussed and explained. The age range and sensitivity of different techniques are given. Potassium/argon dating, amino-acid dating, radiocarbon dating, dendrochronology, thermoluminescence and geomagnetic field dating are all mentioned. Each technique is explained and a brief history given. The techniques and equipment used by the British Museum, and some examples of archaeological articles dated are mentioned. (UK)

Alternative Work Schedules: Definitions

Science.gov (United States)

Journal of the College and University Personnel Association, 1977

1977-01-01

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

Planning and Scheduling of Airline Operations

Directory of Open Access Journals (Sweden)

İlkay ORHAN

2010-02-01

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

Development of Watch Schedule Using Rules Approach

Science.gov (United States)

Jurkevicius, Darius; Vasilecas, Olegas

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

Technology for planning and scheduling under complex constraints

Science.gov (United States)

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

1997-02-01

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

Excellence through outage planning and scheduling

International Nuclear Information System (INIS)

Ferriole, G.

1987-01-01

The Nuclear and Fossil Generation Division of Electricite de France (EdF) has been the largest nuclear plant operating utility in France since 1984. The size of the units, their standardization, and extensive operating experience were favorable parameters leading to the development of a very complete maintenance organization. Electricite de France believes in the importance of well-defined maintenance concepts. These maintenance concepts contribute to outage performance by requiring a careful consideration of work to be done and by defining the techniques and means of accomplishing this work. In addition to maintenance concepts and careful planning and scheduling, good outage management is achieved through the motivation and dedication of the people involved. It is the key to good operational results

Schedule to Nuclear Energy Act no 92, 1982: no. R. 1132, 13 Jun 1986

International Nuclear Information System (INIS)

1986-01-01

This is a schedule to the Nuclear Energy Act, 1982 (Act no. 92 of 1982). In the event of a nuclear accident the corporation must keep clear records of the persons affected by such accidents, as well as information such as the place, date, time and nature of a nuclear accident. Records must be copied, reproduced or transcribed by the corporation and must be kept in such a durable manner that the records will remain suitable to be submitted at any time during a period of 30 years

Reactor plant for Belene NPP completion

International Nuclear Information System (INIS)

Dragunov, Yu. G.; Ryzhov, S. B.; Ermakov, D. N.; Repin, A. I.

2004-01-01

Construction of 'Belene' NPP was started at the end of 80-ties using project U-87 with V-320 reactor plant, general designer of this plant is OKB 'Gidropress'. At the beginning of 90-ties, on completing the considerable number of deliveries and performance of civil engineering work at the site the NPP construction was suspended. Nowadays, considering the state of affairs at the site and the work performed by Bulgarian Party on preservation of the equipment delivered, the most perspective is supposed to be implementation of the following versions in completing 'Belene' NPP: for completion of Unit 1 - reactor plant VVER-1000 on the basis of V-320 reactor with the maximum use of the delivered equipment (V-320M) having the extended service life and safety improvement; for Unit 2 - advanced reactor plant VVER-1000. For the upgraded reactor plant V-230M the basic solutions and characteristics are presented, as well as the calculated justification of strength and safety analyses, design of the reactor core and fuel cycle, instrumentation and control systems, application of the 'leak-before break' in the project and implementation of safety measures. For the modernised reactor plant V-392M the main characteristics and basic changes are presented, concerning reactor pressure vessel, steam generator, reactor coolant pump set. Design of NPP with the modernized reactor plant V-320M meets the up-to-date requirements and can be licensed for completion and operation. In the design of NPP with the advanced reactor plant the basic solutions and the equipment are used that are similar to those used in standard reactor plant V-320 and new one with VVER-1000 under construction and completion in Russia, and abroad. Compliance of reactor design with the up-to-date international requirements, considering the extended service life of the main equipment, shows its rather high potential for implementation during completion of 'Belene' NPP

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

Science.gov (United States)

Hwang, Juwon; Shah, Dhavan V

2018-06-05

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

NRC comprehensive records disposition schedule

International Nuclear Information System (INIS)

1983-05-01

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

CMS multicore scheduling strategy

International Nuclear Information System (INIS)

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

2014-01-01

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

Colloquial French the complete course for beginners

CERN Document Server

Demouy, Valérie

2014-01-01

 COLLOQUIAL FRENCH is easy to use and completely up to date!Specially written by experienced teachers for self-study or class use, the course offers a step-by-step approach to written and spoken French. No prior knowledge of the language is required.What makes COLLOQUIAL FRENCH your best choice in personal language learning?Interactive - lots of exercises for regular practiceClear - concise grammar notesPractical - useful vocabulary and pronunciation guideComplete - including answer key and reference sectionWhether you''re a business traveller, or about to take up　a daring　challenge in　adventu

Development of an improved installation procedure and schedule of RVI modularization for APR1400

International Nuclear Information System (INIS)

Ko, Do Young

2011-01-01

The construction technology for reactor vessel internals (RVI) modularization is one of the most important factors to be considered in reducing the construction period of nuclear power plants. For RVI modularization, gaps between the reactor vessel (RV) core-stabilizing lug and the core support barrel (CSB) snubber lug must be measured using a remote method from outside the RV. In order to measure RVI gaps remotely at nuclear power plant construction sites, certain core technologies must be developed and verified. These include a remote measurement system to measure the gaps between the RV core-stabilizing lug and the CSB snubber lug, an RVI mockup to perform the gap measurement tests, and a new procedure and schedule for RVI installation. A remote measurement system was developed previously, and a gap measurement test was completed successfully using the RVI mockup. We also developed a new procedure and schedule for RVI installation. This paper presents the new and improved installation procedure and schedule for RVI modularization. These are expected to become core technologies that will allow us to shorten the construction period by a minimum of two months compared to the existing installation procedure and schedule

Data analysis with the DIANA meta-scheduling approach

International Nuclear Information System (INIS)

Anjum, A; McClatchey, R; Willers, I

2008-01-01

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

Scheduling lessons learned from the Autonomous Power System

Science.gov (United States)

Ringer, Mark J.

1992-01-01

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

Federal Facility Agreement plans and schedules for liquid low-level radioactive waste tank systems at Oak Ridge National Laboratory, Oak Ridge, Tennessee

International Nuclear Information System (INIS)

1993-06-01

The Superfund Amendments and Reauthorization Act of the Comprehensive Environmental Response, Compensation, and Liability Act (CERCLA) requires a Federal Facility Agreement (FFA) for federal facilities placed on the National Priorities List. The Oak Ridge Reservation was placed on that list on December 21, 1989, and the agreement was signed in November 1991 by the Department of Energy Oak Ridge Field Office (DOE-OR), the US Environmental Protection Agency (EPA)-Region IV, and the Tennessee Department of Environment and Conservation (TDEC). The effective date of the FFA was January 1, 1992. Section 9 and Appendix F of the agreement impose design and operating requirements on the Oak Ridge National Laboratory (ORNL) liquid low-level radioactive waste (LLLW) tank systems and identify several plans, schedules, and assessments that must be submitted to EPA/TDEC for review or approval. The initial issue of this document in March 1992 transmitted to EPA/TDEC those plans and schedules that were required within 60 to 90 days of the FFA effective date. The current revision of this document updates the plans, schedules, and strategy for achieving compliance with the FFA, and it summarizes the progress that has been made over the past year. Chapter 1 describes the history and operation of the ORNL LLLW System, the objectives of the FFA, the organization that has been established to bring the system into compliance, and the plans for achieving compliance. Chapters 2 through 7 of this report contain the updated plans and schedules for meeting FFA requirements. This document will continue to be periodically reassessed and refined to reflect newly developed information and progress

Optimization of Hierarchically Scheduled Heterogeneous Embedded Systems

DEFF Research Database (Denmark)

Pop, Traian; Pop, Paul; Eles, Petru

2005-01-01

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

Sport Tournament Automated Scheduling System

OpenAIRE

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

2018-01-01

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

17 CFR 248.128 - Effective date, compliance date, and prospective application.

Science.gov (United States)

2010-04-01

... Affiliate Marketing § 248.128 Effective date, compliance date, and prospective application. (a) Effective date. This subpart is effective September 10, 2009. (b) Mandatory compliance date. Compliance with this... 17 Commodity and Securities Exchanges 3 2010-04-01 2010-04-01 false Effective date, compliance...

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

Science.gov (United States)

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

2016-08-01

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

Routine environmental monitoring schedule, calendar year 1995

International Nuclear Information System (INIS)

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

1994-12-01

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

F/H Area high level waste removal plan ampersand schedule as required by the Federal Facility Agreement for the Savannah River Site

International Nuclear Information System (INIS)

Hunter, M.A.

1993-11-01

The F and H-area HLW Tank Farms are one component of a larger integrated waste treatment system consisting of facilities designed for the overall processing of several radioactive waste streams resulting from nuclear material processing. Section IX.E of the SRS Federal Facility Agreement requires the DOE to submit to the EPA and SCDHEC for review and approval, a plan(s) and schedule(s) for the removal from service of waste tank systems(s)/component(s) that do not meet secondary containment standards, or that leak or have leaked. The Plan and Schedule for removal from service of these waste tanks is shown in Appendices A and B, respectively. Other portions of this package which include schedule dates are provided for information only. The SRS intends to remove systems from service as opposed to providing secondary containment for non-compliant systems. The systems that do not meet secondary containment requirements or that have leaked (as determined by tank assessment reports) include High Level Waste Tanks No. 1--24 along with corresponding ancillary equipment

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.

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

Grain yield and baking quality of wheat under different sowing dates

Directory of Open Access Journals (Sweden)

Raphael Rossi Silva

2014-04-01

Full Text Available Choosing the right sowing dates can maximize the outcomes of the interaction between genotype and environment, thus increasing grain yield and baking quality of wheat (Triticum aestivum L.. The present study aimed at determining the most appropriate sowing dates that maximize grain yield and baking quality of wheat cultivars. Seven wheat cultivars (BRS 179, BRS Guamirim, BRS Guabiju, BRS Umbu, Safira, CD 105 and CD 115 were evaluated at four sowing dates (the 1st and the 15th of June and July in two harvesting seasons (2007 and 2008. The study was setup in a completely randomized block design with four repetitions. The effects of the year and sowing date when combined explained 93% of the grain yield variance. In 2007, the CD 105 and Safira cultivars had the highest grain yield (GY for all sowing dates. Only the BRS Guabiju and Safira cultivars possessed high baking quality for all sowing dates assessed. In 2008, the environmental conditions were favorable for superior GY, but the baking quality was inferior. Considering adapted cultivars and sowing dates, it is possible to maximize grain yield and baking quality of wheat.

Pukaki 1-01 : initial luminescence dating and radiometric measurements

International Nuclear Information System (INIS)

Rieser, U.

2001-01-01

Core from Pukaki 1-01 was sampled for luminescence dating and radiometric measurements on 14 March 2001 in the dark room laboratory at Victoria University. Seven samples were taken to get an overview of the crater history, and laboratory work was completed in August 2001. (author). 2 figs., 3 tabs

Patterns of Change in Adolescent Dating Victimization and Aggression During Middle School.

Science.gov (United States)

Goncy, Elizabeth A; Farrell, Albert D; Sullivan, Terri N

2018-03-01

Although mounting evidence suggests dating victimization and aggression begin in early adolescence, little work has examined the pattern of these behaviors across this age. This longitudinal study examined trajectories of dating victimization and aggression across middle school using 12 waves of data. A sample of early adolescents (N = 1369, 52.3% girls; 83% African American; 15% Hispanic or Latino) residing in an urban, economically disadvantaged area participated in this study. Youth completed measures of dating victimization and aggression quarterly across the 3 years of middle school. Although results indicated a general trend of increasing dating victimization and aggression across middle school, variation existed for boys and girls. Specifically, girls showed increasing patterns of both, whereas boys remained relatively stable across time. Dating victimization and aggression were also highly correlated across time. These findings support the implementation and refinement of prevention programming aimed at preventing and reducing dating aggression and victimization in middle school.

A neural network approach to job-shop scheduling.

Science.gov (United States)

Zhou, D N; Cherkassky, V; Baldwin, T R; Olson, D E

1991-01-01

A novel analog computational network is presented for solving NP-complete constraint satisfaction problems, i.e. job-shop scheduling. In contrast to most neural approaches to combinatorial optimization based on quadratic energy cost function, the authors propose to use linear cost functions. As a result, the network complexity (number of neurons and the number of resistive interconnections) grows only linearly with problem size, and large-scale implementations become possible. The proposed approach is related to the linear programming network described by D.W. Tank and J.J. Hopfield (1985), which also uses a linear cost function for a simple optimization problem. It is shown how to map a difficult constraint-satisfaction problem onto a simple neural net in which the number of neural processors equals the number of subjobs (operations) and the number of interconnections grows linearly with the total number of operations. Simulations show that the authors' approach produces better solutions than existing neural approaches to job-shop scheduling, i.e. the traveling salesman problem-type Hopfield approach and integer linear programming approach of J.P.S. Foo and Y. Takefuji (1988), in terms of the quality of the solution and the network complexity.

PRACTICAL IMPLICATIONS OF LOCATION-BASED SCHEDULING

DEFF Research Database (Denmark)

Andersson, Niclas; Christensen, Knud

2007-01-01

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

Environmental surveillance master sampling schedule

International Nuclear Information System (INIS)

Bisping, L.E.

1991-01-01

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

Environmental surveillance master sampling schedule

Energy Technology Data Exchange (ETDEWEB)

Bisping, L.E.

1991-01-01

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

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

Limited Preemptive Scheduling in Real-time Systems

OpenAIRE

Thekkilakattil, Abhilash

2016-01-01

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

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

Science.gov (United States)

Rash, James

2014-01-01

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

Clinch River Breeder Reactor Plant Project: construction schedule

International Nuclear Information System (INIS)

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

1982-01-01

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

A Hybrid Metaheuristic for Multi-Objective Scientific Workflow Scheduling in a Cloud Environment

Directory of Open Access Journals (Sweden)

Nazia Anwar

2018-03-01

Full Text Available Cloud computing has emerged as a high-performance computing environment with a large pool of abstracted, virtualized, flexible, and on-demand resources and services. Scheduling of scientific workflows in a distributed environment is a well-known NP-complete problem and therefore intractable with exact solutions. It becomes even more challenging in the cloud computing platform due to its dynamic and heterogeneous nature. The aim of this study is to optimize multi-objective scheduling of scientific workflows in a cloud computing environment based on the proposed metaheuristic-based algorithm, Hybrid Bio-inspired Metaheuristic for Multi-objective Optimization (HBMMO. The strong global exploration ability of the nature-inspired metaheuristic Symbiotic Organisms Search (SOS is enhanced by involving an efficient list-scheduling heuristic, Predict Earliest Finish Time (PEFT, in the proposed algorithm to obtain better convergence and diversity of the approximate Pareto front in terms of reduced makespan, minimized cost, and efficient load balance of the Virtual Machines (VMs. The experiments using different scientific workflow applications highlight the effectiveness, practicality, and better performance of the proposed algorithm.

Primary completion rates across socio-religious communities in West Bengal

OpenAIRE

Husain, Zakir; Chatterjee, Amrita

2009-01-01

Primary completion rates of Muslims in West Bengal are substantially lower than that of upper caste communities as well as backward castes, scheduled castes and tribes. Further, analysis of age-specific pcr indicates that differences in pcr between Muslims and other communities may have actually increased in recent years. An econometric analysis reveals that age, gender, household size and expenditure levels, education and gender of decision-maker, etc, are importan...

Radiocarbon dates for Rangitoto and Motutapu, a consideration of dating accuracy

International Nuclear Information System (INIS)

Law, R.G.

1975-01-01

The carbon dates for the eruptions of Rangitoto and the occupation of Maori sites on Motutapu contain inconsistencies which are explicable only after the dates have been corrected to allow for the nature of the dating method. The only date which is reasonably established is a 14th or 15th century dating for the ash shower covering Motutapu. (auth.)

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-08-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 also completed the Big Five Inventory-Adolescent, 144 provided 2-week retest data, and 128 others completed the Minnesota Multiphasic Personality Inventory-Adolescent. Outpatient adolescents (N = 103) completed the SNAP-Y, and 97 also completed the Minnesota Multiphasic Personality Inventory-Adolescent. The SNAP-Y demonstrated strong psychometric properties, and structural, convergent, discriminant, and external validities. Consistent with the continuity of personality, results paralleled those in adult and college samples using the adult Schedule for Nonadaptive and Adaptive Personality-Second Edition (SNAP-2), from which the SNAP-Y derives and which has established validity in personality-trait assessment across the normal-abnormal continuum. The SNAP-Y thus provides a new, clinically useful instrument to assess personality traits and personality pathology in adolescents.

Utilization Bound of Non-preemptive Fixed Priority Schedulers

Science.gov (United States)

Park, Moonju; Chae, Jinseok

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

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

Science.gov (United States)

Tang, Dunbing; Dai, Min

2015-09-01

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

Dating Violence

Science.gov (United States)

Stader, David L.

2011-01-01

Dating violence is a form of student-on-student victimization and is a serious school safety issue. Research indicates that at a minimum, 10 percent of high school students are victims of dating violence in one form or another. Among female high school students that date, some data indicate that as many as 30 percent may be victims of dating…

Integrated Job Scheduling and Network Routing

DEFF Research Database (Denmark)

Gamst, Mette; Pisinger, David

2013-01-01

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

14C AMS dating Yongcheon cave

International Nuclear Information System (INIS)

Lee, J.H.; Choe, K.; Kim, J.C.; Choi, S.H.; Kang, J.; Song, S.; Song, Y.M.; Jang, J.G.

2013-01-01

The biggest island in South Korea is Jeju Island, which lies 80 km south of the mainland and has one shield volcano, Mt. Halla. The volcanic island and its lava tubes were added to the world heritage list by UNESCO in 2007. Among the many lava tubes on the island, a unique cave had been accidentally found in 2005 while some workers were replacing a telephone pole. Until the discovery, it had been completely isolated from the outside by naturally-built sand blocks. Yongcheon cave is a lime-decorated lava tube showing both the properties of a volcanic lava tube and a limestone cave. This cave, about 3 km in length, is acknowledged to be the best of this type in the world and includes a large clean-water lake, lava falls, and richly developed speleothems inside it. Even though there is archaeological evidence from well preserved pottery that ancient people entered this place, the preservation of artifacts was ensured by a geological change that made later entrance difficult. We have collected charcoal samples scattered around the cave and dated them using AMS. Ages were in the range of ca. 1570-1260 BP (A.D. 340–880) and this corresponds to the Ancient Three Kingdoms and the Unified Silla era in Korean history. The 14 C AMS measurement results presented in this paper on wood charcoal provide precise dates which will be very useful not only to clarify the nature of human activities in this cave but also to provide reference dates when comparing other dating methods.

Estimating exponential scheduling preferences

DEFF Research Database (Denmark)

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

2015-01-01

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

Group Elevator Peak Scheduling Based on Robust Optimization Model

Directory of Open Access Journals (Sweden)

ZHANG, J.

2013-08-01

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

Cure Schedule for Stycast 2651/Catalyst 9.

Energy Technology Data Exchange (ETDEWEB)

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

2017-11-01

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

Job shop scheduling problem with late work criterion

Science.gov (United States)

Piroozfard, Hamed; Wong, Kuan Yew

2015-05-01

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

Luminescence dating

International Nuclear Information System (INIS)

Rieser, U.

2013-01-01

The luminescence techniques have evolved over the last 40 years to a powerful dating instrument in archaeology and geoscience. Depending on how the luminescence is stimulated, one distinguishes the phenomena of thermoluminescence (TL), optically stimulated luminescence (OSL) and infrared stimulated luminescence (IRSL). Each of these phenomena has its specific potential for dating various archaeological materials in the time range from medieval back to palaeolithic periods, or, speaking in geological terms, for dating of Holocene and late Pleistocene objects. The OSL and IRSL techniques are sometimes treated together as 'optical dating'. The luminescence techniques differ from other major dating techniques, such as 14 C, essentially by their applicability to inorganic materials, their wide age-range from about 100 years to more than 100,000 years and the kind of datable events which are the last exposure to heat or to light. (author). 10 refs., 3 figs.

Luminescence dating

International Nuclear Information System (INIS)

Rieser, U.

2009-01-01

The luminescence techniques have evolved over the last 40 years to a powerful dating instrument in archaeology and geoscience. Depending on how the luminescence is stimulated, one distinguishes the phenomena of thermoluminescence (TL), optically stimulated luminescence (OSL) and infrared stimulated luminescence (IRSL). Each of these phenomena has its specific potential for dating various archaeological materals in the time range from medieval back to palaeolithic periods, or, speaking in geological terms, for dating of Holocene and late Pleistocene objects. The OSL and IRSL techniques are sometimes treated together as 'optical dating'. The luminescence techniques differ from other major dating techniques, such as 14 C, essentially by their applicability to inorganic materials, their wide age-range from about 100 years to more than 100,000 years and the kind of datable events which are the last exposure to heat or to light. (author). 10 refs., 3 figs.

Luminescence dating

International Nuclear Information System (INIS)

Rieser, U.

2008-01-01

The luminescence techniques have evolved over the last 40 years to a powerful dating instrument in archaeology and geoscience. Depending on how the luminescence is stimulated, one distinguishes the phenomena of thermoluminescence (TL), optically stimulated luminescence (OSL) and infrared stimulated luminescence (IRSL). Each of these phenomena has its specific potential for dating various archaeological materals in the time range from medieval back to palaeolithic periods, or, speaking in geological terms, for dating of Holocene and late Pleistocene objects. The OSL and IRSL techniques are sometimes treated together as 'optical dating'. The luminescence techniques differ from other major dating techniques, such as 14 C, essentially by their applicability to inorganic materials, their wide age-range from about 100 years to more than 100,000 years and the kind of datable events which are the last exposure to heat or to light. (author). 10 refs., 3 figs

Luminescence dating

International Nuclear Information System (INIS)

Rieser, U.

2012-01-01

The luminescence techniques have evolved over the last 40 years to a powerful dating instrument in archaeology and geoscience. Depending on how the luminescence is stimulated, one distinguishes the phenomena of thermoluminescence (TL), optically stimulated luminescence (OSL) and infrared stimulated luminescence (IRSL). Each of these phenomena has its specific potential for dating various archaeological materials in the time range from medieval back to palaeolithic periods, or, speaking in geological terms, for dating of Holocene and late Pleistocene objects. The OSL and IRSL techniques are sometimes treated together as 'optical dating'. The luminescence techniques differ from other major dating techniques, such as 14 C, essentially by their applicability to inorganic materials, their wide age-range from about 100 years to more than 100,000 years and the kind of datable events which are the last exposure to heat or to light. (author). 10 refs., 3 figs.

Luminescence dating

International Nuclear Information System (INIS)

Rieser, U.

2009-01-01

The luminescence techniques have evolved over the last 40 years to a powerful dating instrument in archaeology and geoscience. Depending on how the luminescence is stimulated, one distinguishes the phenomena of thermoluminescence (TL), optically stimulated luminescence (OSL) and infrared stimulated luminescence (IRSL). Each of these phenomena has its specific potential for dating various archaeological materals in the time range from medieval back to palaeolithic periods, or, speaking in geological terms, for dating of Holocene and late Pleistocene objects. The OSL and IRSL techniques are sometimes treated together as 'optical dating'. The luminescence techniques differ from other major dating techniques, such as 14 C, essentially by their applicability to inorganic materials, their wide age-range from about 100 years to more than 100,000 years and the kind of datable events which are the last exposure to heat or to light. (author). 10 refs., 3 figs

An Improved Hierarchical Genetic Algorithm for Sheet Cutting Scheduling with Process Constraints

OpenAIRE

Yunqing Rao; Dezhong Qi; Jinling Li

2013-01-01

For the first time, an improved hierarchical genetic algorithm for sheet cutting problem which involves n cutting patterns for m non-identical parallel machines with process constraints has been proposed in the integrated cutting stock model. The objective of the cutting scheduling problem is minimizing the weighted completed time. A mathematical model for this problem is presented, an improved hierarchical genetic algorithm (ant colony—hierarchical genetic algorithm) is developed for better ...

A FAST AND ELITIST BI-OBJECTIVE EVOLUTIONARY ALGORITHM FOR SCHEDULING INDEPENDENT TASKS ON HETEROGENEOUS SYSTEMS

Directory of Open Access Journals (Sweden)

G.Subashini

2010-07-01

Full Text Available To meet the increasing computational demands, geographically distributed resources need to be logically coupled to make them work as a unified resource. In analyzing the performance of such distributed heterogeneous computing systems scheduling a set of tasks to the available set of resources for execution is highly important. Task scheduling being an NP-complete problem, use of metaheuristics is more appropriate in obtaining optimal solutions. Schedules thus obtained can be evaluated using several criteria that may conflict with one another which require multi objective problem formulation. This paper investigates the application of an elitist Nondominated Sorting Genetic Algorithm (NSGA-II, to efficiently schedule a set of independent tasks in a heterogeneous distributed computing system. The objectives considered in this paper include minimizing makespan and average flowtime simultaneously. The implementation of NSGA-II algorithm and Weighted-Sum Genetic Algorithm (WSGA has been tested on benchmark instances for distributed heterogeneous systems. As NSGA-II generates a set of Pareto optimal solutions, to verify the effectiveness of NSGA-II over WSGA a fuzzy based membership value assignment method is employed to choose the best compromise solution from the obtained Pareto solution set.

Thermoluminescence dating of sand dunes at Roonka, South Australia

International Nuclear Information System (INIS)

Prescott, J.R.

1983-01-01

Thermoluminescence has been used to date sediments associated with the archaeological excavations at Roonka. An age of 65,000 +- 12,000 years has been found for the terra rossa soil immediately underlying the oldest 14 C dated feature at the main site (18,000 years). At the East Bank site, an age of 2700 +- 300 years is found for the top of the dune at a depth of 30 cm. An age of 14,500 +- 2000 years is found for a stratigraphically distinct and sealed layer at a depth of 1 m. A similar (or possibly older) date is found at 1.7 m. These ages are consistent with the archaeological and geomorphological evidence. There is some evidence that bleaching of sediments by daylight may not be complete in the field. If this is confirmed the ages will need to be revised downwards. (author)

Irradiation of dates

International Nuclear Information System (INIS)

Farkas, J.; Al-Charchafchy, F.; Al-Shaikhaly, M.H.; Mirjan, J.; Auda, H.

1974-01-01

Testing of the technical feasibility of radurization of fresh dates was attempted. In addition preliminary studies were carried out to investigate the applicability of gamma rays to date syrup manufacture. The varieties Zahdi, Lelwi and Tabarzel were studied at different stages of ripening. The eating quality of fresh dates was not affected significantly by irradiation even with doses of 270 and 540 krad. The duration of the softening process, after-ripening, of dates was prolonged by low doses of 10-30 krad in the majority of the experimental batches. The time period of after-ripening was reduced with 270 krad, as well as with 540 krad as a result of shortening of the induction period, i.e. the time after which the date begins to soften. The microbial spoilage of khalaal Lelwi dates was considerably reduced by irradiation with doses above 90 krad. The dibis yield of fully rutab dates was highly increased by the radiation doses of 375 to 2000 krad. The darkness and viable cell count of dibis pressed from irradiated dates were significantly lower than that of untreated dates. (F.J.)

Dating methods and geochronology of fractures and movements in bedrock: a review

Energy Technology Data Exchange (ETDEWEB)

Tullborg, E.L. [Terralogica AB, Graabo (Sweden); Larson, Sven Aake [Goeteborgs Univ. (Sweden); Morad, S. [Uppsala Univ. (Sweden)

2001-06-01

Constraining the absolute and relative ages of crustal movements is of fundamental importance in evaluating the potentials of a site as a repository for spent radioactive fuel. In this report a review summary of up to date absolute and relative dating methods is presented with specific attention to those methods most amenable for dating of fractures. A review of major fracture-and shear zones in the Swedish part of the Baltic Shield is also given. Since the shield has suffered a long and complicated history, geo-chronologists are faced with the problem of reactivated zones when attempting to date these. It is important to get structural control in order to make the choice of dating method since different methods may give answer to completely different questions. An integration of all geological background data is necessary in order to make the proper chose to fit the raised question.

Dating methods and geochronology of fractures and movements in bedrock: a review

International Nuclear Information System (INIS)

Tullborg, E.L.; Larson, Sven Aake; Morad, S.

2001-06-01

Constraining the absolute and relative ages of crustal movements is of fundamental importance in evaluating the potentials of a site as a repository for spent radioactive fuel. In this report a review summary of up to date absolute and relative dating methods is presented with specific attention to those methods most amenable for dating of fractures. A review of major fracture-and shear zones in the Swedish part of the Baltic Shield is also given. Since the shield has suffered a long and complicated history, geo-chronologists are faced with the problem of reactivated zones when attempting to date these. It is important to get structural control in order to make the choice of dating method since different methods may give answer to completely different questions. An integration of all geological background data is necessary in order to make the proper chose to fit the raised question

MEDICAL STAFF SCHEDULING USING SIMULATED ANNEALING

Directory of Open Access Journals (Sweden)

Ladislav Rosocha

2015-07-01

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

Practical principles in appointment scheduling

NARCIS (Netherlands)

Kuiper, A.; Mandjes, M.

2015-01-01

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

The radiocarbon dating project at Aboriginal Affairs, Victoria

International Nuclear Information System (INIS)

Godfrey, M.C.S.

1997-01-01

The purpose of this project has been to publish a complete list of the age estimates relating to the archaeological sites in the State of Victoria from 1951 to 1995, and to assess the value and the limitations of this information for interpreting the prehistory of this region. This project has recorded 476 dates coming from 14 laboratories, and ranging in age from the time of European settlement to the limit of the technique at around 40,000 years BP. However, the available evidence indicates that large discrepancies may exist in these results, and this has lead to the recommendation that this data should not be used in research projects requiring dating accuracies of less than a few hundred years

Substitution of Sugar with Dates Powder and Dates Syrup in Cookies Making

OpenAIRE

W.A. Alsenaien; R.A. Alamer; Zhen-Xing Tang; S.A. Albahrani; M.A. Al-Ghannam; S.M. Aleid

2015-01-01

In this study, the effects of dates powder and dates syrup as a sugar substitution, on the physical properties and sensory attributes of cookies were studied. An increase in firmness and moisture content of cookies supplemented with dates was obtained. The diameter and spread ratio of cookies showed a decrease with increasing levels of date powder or date syrup. Partial replacement of sugar with date powder or date syrup produced cookies with more dark and red color. Sensory evaluation result...

Sport Tournament Automated Scheduling System

Directory of Open Access Journals (Sweden)

Raof R. A. A

2018-01-01

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

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

NARCIS (Netherlands)

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

2005-01-01

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

California LLW disposal site development update: Ahead of milestone schedule

International Nuclear Information System (INIS)

Romano, S.A.; Gaynor, R.K.

1987-01-01

US Ecology has been designated by the State of California to locate, develop and operate a low-level radioactive waste disposal facility. In early 1986, the firm identified eighteen desert basins in southeastern California for siting consideration. Three candidate sites were selected for detailed field characterization work in February, 1987. A preferred site for licensing purposes will be identified in early 1988. California is currently ahead of the siting milestone schedule mandated by the Low-Level Radioactive Waste Policy Amendments Act. It is likely that a license application will be filed before the 1990 milestone date. This paper describes the process undertaken by US Ecology to identify three candidates sites for characterization, and the public involvement program supporting this decision. Future activities leading to final site development are also described

Scheduling nursing personnel on a microcomputer.

Science.gov (United States)

Liao, C J; Kao, C Y

1997-01-01

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

Vehicle and driver scheduling for public transit.

Science.gov (United States)

2009-08-01

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

A hybrid job-shop scheduling system

Science.gov (United States)

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

1992-01-01

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

Mathematical programming and financial objectives for scheduling projects

CERN Document Server

Kimms, Alf

2001-01-01

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

A customizable, scalable scheduling and reporting system.

Science.gov (United States)

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

2014-06-01

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

The Composition of the Master Schedule

Science.gov (United States)

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

2010-01-01

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

Developing optimal nurses work schedule using integer programming

Science.gov (United States)

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

2017-08-01

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

77 FR 41258 - FOIA Fee Schedule Update

Science.gov (United States)

2012-07-13

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

76 FR 43819 - FOIA Fee Schedule Update

Science.gov (United States)

2011-07-22

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

75 FR 7411 - Schedule of Water Charges

Science.gov (United States)

2010-02-19

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

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

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.

Online dating in Japan: a test of social information processing theory.

Science.gov (United States)

Farrer, James; Gavin, Jeff

2009-08-01

This study examines the experiences of past and present members of a popular Japanese online dating site in order to explore the extent to which Western-based theories of computer-mediated communication (CMC) and the development of online relationships are relevant to the Japanese online dating experience. Specifically, it examines whether social information processing theory (SIPT) is applicable to Japanese online dating interactions, and how and to what extent Japanese daters overcome the limitations of CMC through the use of contextual and other cues. Thirty-six current members and 27 former members of Match.com Japan completed an online survey. Using issue-based procedures for grounded theory analysis, we found strong support for SIPT. Japanese online daters adapt their efforts to present and acquire social information using the cues that the online dating platform provides, although many of these cues are specific to Japanese social context.

Teens' Self-Efficacy to Deal with Dating Violence as Victim, Perpetrator or Bystander.

Science.gov (United States)

Van Camp, Tinneke; Hébert, Martine; Guidi, Elisa; Lavoie, Francine; Blais, Martin

2014-09-01

Multiple studies have demonstrated that adolescent dating violence is highly prevalent and associated with internalizing and externalizing problems. A number of prevention initiatives are being implemented in North-American high schools. Such initiatives do not only aim to raise awareness among potential victims and offenders but also among peer bystanders. Since teenagers mainly reach out to their peers when experiencing adversity, it is important to address adolescents' efficiency to deal with witnessing dating violence or with friends disclosing dating abuse, in addition to increasing ability to deal with experienced dating violence victimization or perpetration. The aim of this study is to explore adolescents' self-efficacy to deal with dating violence victimization and perpetration in their relationships and those of their peers. A paper-and-pencil questionnaire was completed by 259 14-18 years olds in Quebec, Canada. The data allows building insight into adolescents' confidence to reach out for help or to help others in a situation of dating violence victimization and perpetration. We also considered the impact of gender and dating victimization history. Results suggest that dating violence prevention can build on teens' self-efficacy to deal with dating violence and offer them tools to do so efficiently.

Scheduling multimedia services in cloud computing environment

Science.gov (United States)

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

2018-02-01

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

Scheduling nurses’ shifts at PGI Cikini Hospital

Science.gov (United States)

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

2018-03-01

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

Blind-date Conversation Joining

Directory of Open Access Journals (Sweden)

Luca Cesari

2013-07-01

Full Text Available We focus on a form of joining conversations among multiple parties in service-oriented applications where a client may asynchronously join an existing conversation without need to know in advance any information about it. More specifically, we show how the correlation mechanism provided by orchestration languages enables a form of conversation joining that is completely transparent to clients and that we call 'blind-date joining'. We provide an implementation of this strategy by using the standard orchestration language WS-BPEL. We then present its formal semantics by resorting to COWS, a process calculus specifically designed for modelling service-oriented applications. We illustrate our approach by means of a simple, but realistic, case study from the online games domain.

Analysis and Optimisation of Hierarchically Scheduled Multiprocessor Embedded Systems

DEFF Research Database (Denmark)

Pop, Traian; Pop, Paul; Eles, Petru

2008-01-01

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

Flow shop scheduling with heterogeneous workers

OpenAIRE

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

2014-01-01

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

An improved scheduling algorithm for linear networks

KAUST Repository

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

2017-01-01

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

21 CFR 113.83 - Establishing scheduled processes.

Science.gov (United States)

2010-04-01

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

An improved scheduling algorithm for linear networks

KAUST Repository

Bader, Ahmed

2017-02-09

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

Mechanisms for scheduling games with selfish players

NARCIS (Netherlands)

Hoeksma, R.P.

2015-01-01

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

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

Energy Technology Data Exchange (ETDEWEB)

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

2013-12-06

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

GSA eLibrary Schedules and Contracts

Data.gov (United States)

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

Minimizing tardiness for job shop scheduling under uncertainties

OpenAIRE

Yahouni , Zakaria; Mebarki , Nasser; Sari , Zaki

2016-01-01

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

76 FR 70064 - Atlantic Highly Migratory Species; Update to Information on the Effective Date of Atlantic...

Science.gov (United States)

2011-11-10

... provisions, and only after ESA Section 7 consultation is completed. Notice of the effective date will be.... 110912579-1627-01] RIN 0648-BB43 Atlantic Highly Migratory Species; Update to Information on the Effective.... SUMMARY: NMFS is updating the anticipated effective date of smoothhound shark management measures...

Integrated test schedule for buried waste integrated demonstration

International Nuclear Information System (INIS)

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

1992-05-01

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

Scheduling Accessory Assists Patients with Cognitive Disorders

Science.gov (United States)

2007-01-01

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

Resource Allocation in a Repetitive Project Scheduling Using Genetic Algorithm

Science.gov (United States)

Samuel, Biju; Mathew, Jeeno

2018-03-01

Resource Allocation is procedure of doling out or allocating the accessible assets in a monetary way and productive way. Resource allocation is the scheduling of the accessible assets and accessible exercises or activities required while thinking about both the asset accessibility and the total project completion time. Asset provisioning and allocation takes care of that issue by permitting the specialist co-ops to deal with the assets for every individual demand of asset. A probabilistic selection procedure has been developed in order to ensure various selections of chromosomes

14 CFR 399.81 - Unrealistic or deceptive scheduling.

Science.gov (United States)

2010-01-01

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

6th International Workshop on Computer-Aided Scheduling of Public Transport

CERN Document Server

Branco, Isabel; Paixão, José

1995-01-01

This proceedings volume consists of papers presented at the Sixth International Workshop on Computer-Aided Scheduling of Public Transpon, which was held at the Fund~lio Calouste Gulbenkian in Lisbon from July 6th to 9th, 1993. In the tradition of alternating Workshops between North America and Europe - Chicago (1975), Leeds (1980), Montreal (1983), Hamburg (1987) and again Montreal (1990), the European city of Lisbon was selected as the venue for the Workshop in 1993. As in earlier Workshops, the central theme dealt with vehicle and duty scheduling problems and the employment of operations-research-based software systems for operational planning in public transport. However, as was initiated in Hamburg in 1987, the scope of this Workshop was broadened to include topics in related fields. This fundamental alteration was an inevitable consequence of the growing demand over the last decade for solutions to the complete planning process in public transport through integrated systems. Therefore, the program of thi...

Barnett shale completions

Energy Technology Data Exchange (ETDEWEB)

Schein, G. [BJ Services, Dallas, TX (United States)

2006-07-01

Fractured shales yield oil and gas in various basins across the United States. A map indicating these fractured shale source-reservoir systems in the United States was presented along with the numerous similarities and differences that exist among these systems. Hydrocarbons in the organic rich black shale come from the bacterial decomposition of organic matter, primary thermogenic decomposition of organic matter or secondary thermogenic cracking of oil. The shale may be the reservoir or other horizons may be the primary or secondary reservoir. The reservoir has induced micro fractures or tectonic fractures. This paper described the well completions in the Barnett Shale in north Texas with reference to major players, reservoir properties, mineralogy, fluid sensitivity, previous treatments, design criteria and production examples. The Barnett Shale is an organic, black shale with thickness ranging from 100 to 1000 feet. The total organic carbon (TOC) averages 4.5 per cent. The unit has undergone high rate frac treatments. A review of the vertical wells in the Barnett Shale was presented along with the fracture treatment schedule and technology changes. A discussion of refracturing opportunities and proppant settling and transport revealed that additional proppant increases fluid recovery and enhances production. Compatible scale inhibitors and biocides can be beneficial. Horizontal completions in the Barnett Shale have shown better results than vertical wells, as demonstrated in a production comparison of 3 major horizontal wells in the basin. tabs., figs.

LEARNING SCHEDULER PARAMETERS FOR ADAPTIVE PREEMPTION

OpenAIRE

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

2015-01-01

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

Teen Dating Violence

Science.gov (United States)

... Room Social Media Publications Injury Center Teen Dating Violence Recommend on Facebook Tweet Share Compartir On This ... serious forms of violence. What is teen dating violence? Teen Dating Violence [550 KB, 2 Pages, 508] ...

Minimizing Project Cost by Integrating Subcontractor Selection Decisions with Scheduling

Science.gov (United States)

Biruk, Sławomir; Jaśkowski, Piotr; Czarnigowska, Agata

2017-10-01

Subcontracting has been a worldwide practice in the construction industry. It enables the construction enterprises to focus on their core competences and, at the same time, it makes complex project possible to be delivered. Since general contractors bear full responsibility for the works carried out by their subcontractors, it is their task and their risk to select a right subcontractor for a particular work. Although subcontractor management has been admitted to significantly affect the construction project’s performance, current practices and past research deal with subcontractor management and scheduling separately. The proposed model aims to support subcontracting decisions by integrating subcontractor selection with scheduling to enable the general contractor to select the optimal combination of subcontractors and own crews for all work packages of the project. The model allows for the interactions between the subcontractors and their impacts on the overall project performance in terms of cost and, indirectly, time and quality. The model is intended to be used at the general contractor’s bid preparation stage. The authors claim that the subcontracting decisions should be taken in a two-stage process. The first stage is a prequalification - provision of a short list of capable and reliable subcontractors; this stage is not the focus of the paper. The resulting pool of available resources is divided into two subsets: subcontractors, and general contractor’s in-house crews. Once it has been defined, the next stage is to assign them to the work packages that, bound by fixed precedence constraints, form the project’s network diagram. Each package is possible to be delivered by the general contractor’s crew or some of the potential subcontractors, at a specific time and cost. Particular crews and subcontractors can be contracted more than one package, but not at the same time. Other constraints include the predefined project completion date (the project is

33 CFR 401.58 - Pleasure craft scheduling.

Science.gov (United States)

2010-07-01

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

Spike: Artificial intelligence scheduling for Hubble space telescope

Science.gov (United States)