979 resultados para Assignment Problem
Resumo:
In this paper, a hybrid simulation-based algorithm is proposed for the StochasticFlow Shop Problem. The main idea of the methodology is to transform the stochastic problem into a deterministic problem and then apply simulation to the latter. In order to achieve this goal, we rely on Monte Carlo Simulation and an adapted version of a deterministic heuristic. This approach aims to provide flexibility and simplicity due to the fact that it is not constrained by any previous assumption and relies in well-tested heuristics.
Resumo:
In this paper, a hybrid simulation-based algorithm is proposed for the StochasticFlow Shop Problem. The main idea of the methodology is to transform the stochastic problem into a deterministic problem and then apply simulation to the latter. In order to achieve this goal, we rely on Monte Carlo Simulation and an adapted version of a deterministic heuristic. This approach aims to provide flexibility and simplicity due to the fact that it is not constrained by any previous assumption and relies in well-tested heuristics.
Resumo:
Background The global mortality caused by cardiovascular disease increases with weight. The Framingham study showed that obesity is a cardiovascular risk factor independent of other risks such as type 2 diabetes mellitus, dyslipidemia and smoking. Moreover, the main problem in the management of weight-loss is its maintenance, if it is achieved. We have designed a study to determine whether a group motivational intervention, together with current clinical practice, is more efficient than the latter alone in the treatment of overweight and obesity, for initial weight loss and essentially to achieve maintenance of the weight achieved; and, secondly, to know if this intervention is more effective for reducing cardiovascular risk factors associated with overweight and obesity. Methods This 26-month follow up multi-centre trial, will include 1200 overweight/obese patients. Random assignment of the intervention by Basic Health Areas (BHA): two geographically separate groups have been created, one of which receives group motivational intervention (group intervention), delivered by a nurse trained by an expert phsychologist, in 32 group sessions, 1 to 12 fortnightly, and 13 to 32, monthly, on top of their standard program of diet, exercise, and the other (control group), receiving the usual follow up, with regular visits every 3 months. Discussion By addressing currently unanswered questions regarding the maintenance in weight loss in obesity/overweight, upon the expected completion of participant follow-up in 2012, the IMOAP trial should document, for the first time, the benefits of a motivational intervention as a treatment tool of weight loss in a primary care setting.
Resumo:
The existence of a new class of inclined periodic orbits of the collision restricted three-body problem is shown. The symmetric periodic solutions found are perturbations of elliptic kepler orbits and they exist only for special values of the inclination and are related to the motion of a satellite around an oblate planet
Resumo:
Forensic scientists face increasingly complex inference problems for evaluating likelihood ratios (LRs) for an appropriate pair of propositions. Up to now, scientists and statisticians have derived LR formulae using an algebraic approach. However, this approach reaches its limits when addressing cases with an increasing number of variables and dependence relationships between these variables. In this study, we suggest using a graphical approach, based on the construction of Bayesian networks (BNs). We first construct a BN that captures the problem, and then deduce the expression for calculating the LR from this model to compare it with existing LR formulae. We illustrate this idea by applying it to the evaluation of an activity level LR in the context of the two-trace transfer problem. Our approach allows us to relax assumptions made in previous LR developments, produce a new LR formula for the two-trace transfer problem and generalize this scenario to n traces.
Resumo:
On the domain of general assignment games (with possible reservation prices) the core is axiomatized as the unique solution satisfying two consistency principles: projection consistency and derived consistency. Also, an axiomatic characterization of the nucleolus is given as the unique solution that satisfies derived consistency and equal maximum complaint between groups. As a consequence, we obtain a geometric characterization of the nucleolus. Maschler et al. (1979) provide a geometrical characterization for the intersection of the kernel and the core of a coalitional game, showing that those allocations that lie in both sets are always the midpoint of certain bargaining range between each pair of players. In the case of the assignment game, this means that the kernel can be determined as those core allocations where the maximum amount, that can be transferred without getting outside the core, from one agent to his / her optimally matched partner equals the maximum amount that he / she can receive from this partner, also remaining inside the core. We now prove that the nucleolus of the assignment game can be characterized by requiring this bisection property be satisfied not only for optimally matched pairs but also for optimally matched coalitions. Key words: cooperative games, assignment game, core, nucleolus
Resumo:
Amino-N is preserved because of the scarcity and nutritional importance of protein. Excretion requires its conversion to ammonia, later incorporated into urea. Under conditions of excess dietary energy, the body cannot easily dispose of the excess amino-N against the evolutively adapted schemes that prevent its wastage; thus ammonia and glutamine formation (and urea excretion) are decreased. High lipid (and energy) availability limits the utilisation of glucose, and high glucose spares the production of ammonium from amino acids, limiting the synthesis of glutamine and its utilisation by the intestine and kidney. The amino acid composition of the diet affects the production of ammonium depending on its composition and the individual amino acid catabolic pathways. Surplus amino acids enhance protein synthesis and growth, and the synthesis of non-protein-N-containing compounds. But these outlets are not enough; consequently, less-conventional mechanisms are activated, such as increased synthesis of NO∙ followed by higher nitrite (and nitrate) excretion and changes in the microbiota. There is also a significant production of N(2) gas, through unknown mechanisms. Health consequences of amino-N surplus are difficult to fathom because of the sparse data available, but it can be speculated that the effects may be negative, largely because the fundamental N homeostasis is stretched out of normalcy, forcing the N removal through pathways unprepared for that task. The unreliable results of hyperproteic diets, and part of the dysregulation found in the metabolic syndrome may be an unwanted consequence of this N disposal conflict.
Resumo:
Abstract
Resumo:
Peer-reviewed
Resumo:
The continuous wavelet transform is obtained as a maximumentropy solution of the corresponding inverse problem. It is well knownthat although a signal can be reconstructed from its wavelet transform,the expansion is not unique due to the redundancy of continuous wavelets.Hence, the inverse problem has no unique solution. If we want to recognizeone solution as "optimal", then an appropriate decision criterion hasto be adopted. We show here that the continuous wavelet transform is an"optimal" solution in a maximum entropy sense.
Resumo:
The General Assembly Line Balancing Problem with Setups (GALBPS) was recently defined in the literature. It adds sequence-dependent setup time considerations to the classical Simple Assembly Line Balancing Problem (SALBP) as follows: whenever a task is assigned next to another at the same workstation, a setup time must be added to compute the global workstation time, thereby providing the task sequence inside each workstation. This paper proposes over 50 priority-rule-based heuristic procedures to solve GALBPS, many of which are an improvement upon heuristic procedures published to date.