نتایج جستجو برای: pert network

تعداد نتایج: 672662  

2002
S. M. T. Fatemi Ghomi

The classical PERT approach uses the path with the largest expected duration as the critical path to estimate the probability of completing a network by a given deadline. However, in general, such a path is not the most critical path (MCP) and does not have the smallest estimate for the probability of completion time. The main idea of this paper is derived from the domination structure between ...

2000
Ricki G. Ingalls Douglas J. Morrice

The Qualitative Simulation Graph Methodology (QSGM) is well suited to address the PERT scheduling with resources problem. The coverage property of QSGM has two important implications for the PERT scheduling problem. First, it means that all possible schedules are represented. Second, it means that, as long as the delay time intervals are not violated, we can characterize all possible outcomes o...

2015
David Dean John Pepper Robert Schmidt Steven Stern

The process of "transitioning" to adulthood for youth with disabilities has long been recognized to be an important but understudied public policy concern. This paper evaluates the labor market effects of Virginia’s school-to-work vocational evaluation program, PERT. Using a unique panel data set containing more than a decade of employment and service provision, we provide the first-ever assess...

Journal: :Journal of Cystic Fibrosis 2023

Approximately 85% of patients with CF are pancreatic insufficient (PI), requiring enzyme replacement therapy (PERT) all fat-containing food & drinks. PERT is commenced based on clinical signs PI such as steatorrhea poor weight gain. Faecal elastase (FE) tests used to confirm PI. This audit was conducted see if adults at a UK centre have FE result, check usage genotype CFTR modulator treatment. ...

Journal: :Oper. Res. Lett. 2003
Rafael Herrerías Pleguezuelo José García Pérez Salvador Cruz Rambaud

In this paper the expression for the mean in the PERT method is considered. This mean involves a parameter k, that sometimes has been set to 4. Insisting on the similarity between the beta and the normal distributions, certain hypotheses are proposed that lead to k necessarily being exactly 4. More speci6cally, by using the moments of the second and fourth orders, it is shown that the usual bet...

Journal: :Pancreatology 2021

ObjectiveUK national guidelines recommend pancreatic enzyme replacement therapy (PERT) in cancer. Over 80% of cancers are unresectable and managed non-surgical units. The aim was to assess variation PERT prescribing, determine factors associated with its use identify potential actions improve prescription rates.DesignRICOCHET a prospective audit malignant pancreatic, peri-ampullary lesions or b...

Journal: :Buildings 2022

Earned value management (EVM) is widely used when monitoring and estimating operations related to construction projects. As the scope complexity of projects expand, traditional EVM sometimes ineffective even results in conclusions that are contrary actual situation. Additionally, estimate produced by a deterministic does not account for uncertainty activities involved project. This study propos...

2016
David Dean John Pepper Robert Schmidt Steven Stern

The process of "transitioning" to adulthood for youth with disabilities has long been recognized to be an important but understudied public policy concern. This paper evaluates the labor market effects of Virginia’s school-to-work vocational evaluation program, PERT. Using a unique panel data set containing more than a decade of employment and service provision, we provide the first-ever assess...

2007
Yueping Zhang

Our modeling of PERT is composed of three parts: window adjustment, RED emulation, and queuing behavior. We start with the window dynamics. Similar to [7], we consider a single-link scenario and assume the forward propagation delay from the source to the router is negligible and thus the round-trip time R(t) measured by the end-user at time t is composed of backward propagation delay Tp and que...

Journal: :SIAM J. Comput. 1992
Wolfgang W. Bein Jerzy Kamburowski Matthias F. Stallmann

Algorithms for series-parallel graphs can be extended to arbitrary two-terminal dags if node reductions are used along with series and parallel reductions. A node reduction contracts a vertex with unit in-degree (out-degree) into its sole incoming (outgoing) neighbor. We give an O(n 2:5) algorithm for minimizing node reductions, based on vertex cover in a transitive auxiliary graph. Application...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید