959 resultados para Maintenance scheduling problem
Resumo:
This research paper has been written with the intention to discuss the problem of discipline in Cape Verdean secondary schools. While many of us discuss the effects that student misbehavior has on the student misbehavior has on the student, school and society as a whole, very few of us seek solutions which would impact on the prevention and management of this problem that each day becomes more complicated and harder to handle. This paper will discuss the need to better define discipline at the school level; identify the causes and factors that aggravate the problem, in addition, to provide what I hope to be useful strategies to better manage the problem as we make the effort to reclaim our schools and better educate our students. My research included surveys completed by teachers and student alike as they baffled over the question: what is discipline and how can we better manage discipline problems at our schools?
Resumo:
We start with a generalization of the well-known three-door problem:the n-door problem. The solution of this new problem leads us toa beautiful representation system for real numbers in (0,1] as alternated series, known in the literature as Pierce expansions. A closer look to Pierce expansions will take us to some metrical properties of sets defined through the Pierce expansions of its elements. Finally, these metrical properties will enable us to present 'strange' sets, similar to the classical Cantor set.
Resumo:
One of the assumptions of the Capacitated Facility Location Problem (CFLP) is thatdemand is known and fixed. Most often, this is not the case when managers take somestrategic decisions such as locating facilities and assigning demand points to thosefacilities. In this paper we consider demand as stochastic and we model each of thefacilities as an independent queue. Stochastic models of manufacturing systems anddeterministic location models are put together in order to obtain a formula for thebacklogging probability at a potential facility location.Several solution techniques have been proposed to solve the CFLP. One of the mostrecently proposed heuristics, a Reactive Greedy Adaptive Search Procedure, isimplemented in order to solve the model formulated. We present some computationalexperiments in order to evaluate the heuristics performance and to illustrate the use ofthis new formulation for the CFLP. The paper finishes with a simple simulationexercise.
Resumo:
The problems arising in commercial distribution are complex and involve several players and decision levels. One important decision is relatedwith the design of the routes to distribute the products, in an efficient and inexpensive way.This article deals with a complex vehicle routing problem that can beseen as a new extension of the basic vehicle routing problem. The proposed model is a multi-objective combinatorial optimization problemthat considers three objectives and multiple periods, which models in a closer way the real distribution problems. The first objective is costminimization, the second is balancing work levels and the third is amarketing objective. An application of the model on a small example, with5 clients and 3 days, is presented. The results of the model show the complexity of solving multi-objective combinatorial optimization problems and the contradiction between the several distribution management objective.
Resumo:
Granular shoulders are an important element of the transportation system and are constantly subjected to performance problems due to wind- and water-induced erosion, rutting, edge drop-off, and slope irregularities. Such problems can directly affect drivers’ safety and often require regular maintenance. The present research study was undertaken to investigate the factors contributing to these performance problems and to propose new ideas to design and maintain granular shoulders while keeping ownership costs low. This report includes observations made during a field reconnaissance study, findings from an effort to stabilize the granular and subgrade layer at six shoulder test sections, and the results of a laboratory box study where a shoulder section overlying a soft foundation layer was simulated. Based on the research described in this report, the following changes are proposed to the construction and maintenance methods for granular shoulders: • A minimum CBR value for the granular and subgrade layer should be selected to alleviate edge drop-off and rutting formation. • For those constructing new shoulder sections, the design charts provided in this report can be used as a rapid guide based on an allowable rut depth. The charts can also be used to predict the behavior of existing shoulders. • In the case of existing shoulder sections overlying soft foundations, the use of geogrid or fly ash stabilization proved to be an effective technique for mitigating shoulder rutting.
Resumo:
We obtain minimax lower bounds on the regret for the classicaltwo--armed bandit problem. We provide a finite--sample minimax version of the well--known log $n$ asymptotic lower bound of Lai and Robbins. Also, in contrast to the log $n$ asymptotic results on the regret, we show that the minimax regret is achieved by mere random guessing under fairly mild conditions on the set of allowable configurations of the two arms. That is, we show that for {\sl every} allocation rule and for {\sl every} $n$, there is a configuration such that the regret at time $n$ is at least 1 -- $\epsilon$ times the regret of random guessing, where $\epsilon$ is any small positive constant.
Resumo:
The forensic two-trace problem is a perplexing inference problem introduced by Evett (J Forensic Sci Soc 27:375-381, 1987). Different possible ways of wording the competing pair of propositions (i.e., one proposition advanced by the prosecution and one proposition advanced by the defence) led to different quantifications of the value of the evidence (Meester and Sjerps in Biometrics 59:727-732, 2003). Here, we re-examine this scenario with the aim of clarifying the interrelationships that exist between the different solutions, and in this way, produce a global vision of the problem. We propose to investigate the different expressions for evaluating the value of the evidence by using a graphical approach, i.e. Bayesian networks, to model the rationale behind each of the proposed solutions and the assumptions made on the unknown parameters in this problem.
Resumo:
In 6 hypertensive patients with terminal renal failure maintained on hemodialysis, the effects of 'salt subtraction' and of sequential ultrafiltrating were evaluated. Following each of 3 weekly hemodialysis sessions, salt subtraction was carried out by ultrafiltrating 1 liter and simultaneously infusing an equal volume of 5% dextrose. This resulted in a net sodium loss without hypovolemia. After a 2-week period of this procedure, the blood pressure prior to dialysis was lower (156/76 +/- 12/5 mm Hg) than after a comparable number of sequential ultrafiltration sessions (181/88 +/- 10/6 mm Hg; mean +/- SEM). This difference was not statistically significant. At the same time, body weight was comparable at 64.4 +/- 3 and 64.7 +/- 4 kg, respectively. Neither plasma renin activity nor plasma catecholamines responded with a clear increase to either procedure. The limited effect on blood pressure and the renin system of a marked sodium removal during salt subtraction suggests that sodium must still be present in excess in these patients. The procedure of salt subtraction appears safe and subjectively well tolerated, but it can probably not be used as the sole means of decreasing total body sodium without associating dietary measures to reduce sodium intake.