961 resultados para Lot sizing and scheduling
Resumo:
Dynamic Nuclear Polarization (DNP) is an emerging technique that could revolutionize the NMR study of small molecules at very low concentrations by the increase in sensitivity that results from transfer of polarization between electronic and nuclear spins. Although the underlying physics has been known for a long time, in the last few years there has been a lot of excitement on the chemistry and biology NMR community caused by the demonstration that the highly polarized nuclei that are prepared in solid state at very low temperatures (1-2 K) could be rapidly transferred to liquid samples at room temperature and studied in solution by conventional NMR techniques. In favorable cases several order of magnitude increases in sensitivity have been achieved. The technique is now mature enough that a commercial instrument is available. The efficiency of DNP depends on two crucial aspects: i) the efficiency of the nuclear polarization process and ii) the efficiency of the transfer from the initial solid state to the fluid state in which NMR is measured. The preferred areas of application (iii) will be dictated by situations in which the low concentration of the sample or its intrinsic low receptivity are the limiting factors .
Resumo:
This is a critical review of the medical, ethical, judicial and financial aspects of the so called "social freezing", the cryopreservation of a woman's oocytes for non-medical purposes. The possibility of storing the eggs of fertile women in order to prevent age-related fertility decline is being widely promoted by fertility centres and the lay press throughout the world. Research data has shown that social freezing should ideally be performed on women around 25 years of age in order to increase their chances of a future pregnancy. In reality, it is mostly performed after the age of 35. Unfortunately, social freezing is in general not a solution for the underlying societal problems to fit in with professionally active women and having children. It only delays the existing problems. Furthermore, it creates a lot of potential new problems. A great deal more should be undertaken to offer real solutions to the underlying societal problems which are in part: pre-school education, care in the event of childhood illness, and the many weeks of school holidays, acceptance of professionally active women having children, and more job offers with a workload <100%.). Furthermore, society should be informed about the decreasing chances of pregnancy with increasing maternal (and paternal) age as well as the increasing risks of miscarriage and obstetric/neonatal complications. Detailed information for woman considering social freezing is crucial. Every doctor, proposing social freezing to his patients, should be up to date with all these details. Follow-up studies on the outcome of these children are needed.
Resumo:
Several large randomized trials showed that tamoxifen alone is no more the standard adjuvant hormonal therapy for menopausal patients. Aromatase inhibitors, given upfront or sequentially after tamoxifen, confirmed their efficacy by improving disease free survival, risk of distant metastasis and overall survival in some situations or subgroups of patients. These drugs are usually well tolerated, but they clearly increase bone mineral density loss as well as the risk of fractures and their long term safety on the cardio-vascular system needs to be followed. Thus, even if the role of the aromatase inhibitors is now evident in the adjuvant therapy of postmenopausal women the benefice/risk ratio should be carefully evaluated for each patient.
Resumo:
In the last decades; a growing stock of literature has been devoted to the criticism of GDP as an indicator of societal wealth. A relevant question is: what are the perspectives to build, on the existing knowledge and consensus, alternative measures of prosperity? A starting point may be to connect well-being research agenda with the sustainability one. However, there is no doubt that there is a lot of complexity and fuzziness inherent in multidimensional concepts such as sustainability and well-being. This article analyses the theoretical foundations and the empirical validity of some multidimensional technical tools that can be used for well-being evaluation and assessment. Of course one should not forget that policy conclusions derived through any mathematical model depend also on the conceptual framework used, i.e. which representation of reality (and thus which societal values and interests) has been considered.
Resumo:
The number of studies related to vitamin D has increased exponentially in recent years and it becomes difficult to integrate these data into daily practice. This article focuses on the practice by offering an overview on screening, needs, treatment and consequences of deficiency. While in some areas, a consensus seems to emerge, other issues still require a lot of research in order to have an impact on practice. Independently of the threshold values we use, there is an increased prevalence, which makes vitamin D deficiency the most common and also the most underdiagnosed deficiency. Vitamin D is like a marker of good health and a marker of the evolution of our society. How can be used this marker by the practitioner?
Resumo:
In this article we present a hybrid approach for automatic summarization of Spanish medical texts. There are a lot of systems for automatic summarization using statistics or linguistics, but only a few of them combining both techniques. Our idea is that to reach a good summary we need to use linguistic aspects of texts, but as well we should benefit of the advantages of statistical techniques. We have integrated the Cortex (Vector Space Model) and Enertex (statistical physics) systems coupled with the Yate term extractor, and the Disicosum system (linguistics). We have compared these systems and afterwards we have integrated them in a hybrid approach. Finally, we have applied this hybrid system over a corpora of medical articles and we have evaluated their performances obtaining good results.
Resumo:
From a managerial point of view, the more effcient, simple, and parameter-free (ESP) an algorithm is, the more likely it will be used in practice for solving real-life problems. Following this principle, an ESP algorithm for solving the Permutation Flowshop Sequencing Problem (PFSP) is proposed in this article. Using an Iterated Local Search (ILS) framework, the so-called ILS-ESP algorithm is able to compete in performance with other well-known ILS-based approaches, which are considered among the most effcient algorithms for the PFSP. However, while other similar approaches still employ several parameters that can affect their performance if not properly chosen, our algorithm does not require any particular fine-tuning process since it uses basic "common sense" rules for the local search, perturbation, and acceptance criterion stages of the ILS metaheuristic. Our approach defines a new operator for the ILS perturbation process, a new acceptance criterion based on extremely simple and transparent rules, and a biased randomization process of the initial solution to randomly generate different alternative initial solutions of similar quality -which is attained by applying a biased randomization to a classical PFSP heuristic. This diversification of the initial solution aims at avoiding poorly designed starting points and, thus, allows the methodology to take advantage of current trends in parallel and distributed computing. A set of extensive tests, based on literature benchmarks, has been carried out in order to validate our algorithm and compare it against other approaches. These tests show that our parameter-free algorithm is able to compete with state-of-the-art metaheuristics for the PFSP. Also, the experiments show that, when using parallel computing, it is possible to improve the top ILS-based metaheuristic by just incorporating to it our biased randomization process with a high-quality pseudo-random number generator.
Resumo:
OBJECTIVE To verify the adequacy of the professional nursing staff in the emergency room of a university hospital and to evaluate the association between categories of risk classification triage with the Fugulin Patient Classification System. METHOD The classification of patients admitted into the emergency room was performed for 30 consecutive days through the methodology proposed by Gaidzinski for calculating nursing requirements. RESULTS The calculation determines the need for three registered nurses and four non-registered nursing for each six hour shift. However, only one registered nurse and four non-registered nurse were available per shift. There was no correlation between triage risk classification and classification of care by the Fugulin Patient Classification System. CONCLUSION A deficit in professional staff was identified in the emergency room. The specificity of this unit made it difficult to measure. To find the best strategy to do so, further studies should be performed.
Resumo:
I believe and, I hope others believe that writing well is not only a personal accomplishment but also a valuable form of social participation and leadership. After reviewing the literature, this work tries to identify the problem and to identify the key issues to EFL writing so as to suggest a remedial procedure that may help the learners to express themselves better in English. It aims at finding areas of difficulty in the writing skill among the students and to work out remedial procedures to help them overcome their weakness. A survey carried out on 12th grade students, regarding their comprehension, shows that organizing idea on paper is one of the factors which influences their ability to write. It also shows that students feel the need to be instructed on strategies of writing success and consequently improving their writing. There are a lot systematic approaches and methods for discerning which skills and type of writing teacher should focus on and meaningful classroom activities and strategies that teacher can use to help students improving their writing.
Resumo:
The standard one-machine scheduling problem consists in schedulinga set of jobs in one machine which can handle only one job at atime, minimizing the maximum lateness. Each job is available forprocessing at its release date, requires a known processing timeand after finishing the processing, it is delivery after a certaintime. There also can exists precedence constraints between pairsof jobs, requiring that the first jobs must be completed beforethe second job can start. An extension of this problem consistsin assigning a time interval between the processing of the jobsassociated with the precedence constrains, known by finish-starttime-lags. In presence of this constraints, the problem is NP-hardeven if preemption is allowed. In this work, we consider a specialcase of the one-machine preemption scheduling problem with time-lags, where the time-lags have a chain form, and propose apolynomial algorithm to solve it. The algorithm consist in apolynomial number of calls of the preemption version of the LongestTail Heuristic. One of the applicability of the method is to obtainlower bounds for NP-hard one-machine and job-shop schedulingproblems. We present some computational results of thisapplication, followed by some conclusions.
Resumo:
This paper presents an Optimised Search Heuristic that combines a tabu search method with the verification of violated valid inequalities. The solution delivered by the tabu search is partially destroyed by a randomised greedy procedure, and then the valid inequalities are used to guide the reconstruction of a complete solution. An application of the new method to the Job-Shop Scheduling problem is presented.
Resumo:
Most research on single machine scheduling has assumedthe linearity of job holding costs, which is arguablynot appropriate in some applications. This motivates ourstudy of a model for scheduling $n$ classes of stochasticjobs on a single machine, with the objective of minimizingthe total expected holding cost (discounted or undiscounted). We allow general holding cost rates that are separable,nondecreasing and convex on the number of jobs in eachclass. We formulate the problem as a linear program overa certain greedoid polytope, and establish that it issolved optimally by a dynamic (priority) index rule,whichextends the classical Smith's rule (1956) for the linearcase. Unlike Smith's indices, defined for each class, ournew indices are defined for each extended class, consistingof a class and a number of jobs in that class, and yieldan optimal dynamic index rule: work at each time on a jobwhose current extended class has larger index. We furthershow that the indices possess a decomposition property,as they are computed separately for each class, andinterpret them in economic terms as marginal expected cost rate reductions per unit of expected processing time.We establish the results by deploying a methodology recentlyintroduced by us [J. Niño-Mora (1999). "Restless bandits,partial conservation laws, and indexability. "Forthcomingin Advances in Applied Probability Vol. 33 No. 1, 2001],based on the satisfaction by performance measures of partialconservation laws (PCL) (which extend the generalizedconservation laws of Bertsimas and Niño-Mora (1996)):PCL provide a polyhedral framework for establishing theoptimality of index policies with special structure inscheduling problems under admissible objectives, which weapply to the model of concern.
Resumo:
In todays competitive markets, the importance of goodscheduling strategies in manufacturing companies lead to theneed of developing efficient methods to solve complexscheduling problems.In this paper, we studied two production scheduling problemswith sequence-dependent setups times. The setup times areone of the most common complications in scheduling problems,and are usually associated with cleaning operations andchanging tools and shapes in machines.The first problem considered is a single-machine schedulingwith release dates, sequence-dependent setup times anddelivery times. The performance measure is the maximumlateness.The second problem is a job-shop scheduling problem withsequence-dependent setup times where the objective is tominimize the makespan.We present several priority dispatching rules for bothproblems, followed by a study of their performance. Finally,conclusions and directions of future research are presented.
Resumo:
The public transportation is gaining importance every year basically duethe population growth, environmental policies and, route and streetcongestion. Too able an efficient management of all the resources relatedto public transportation, several techniques from different areas are beingapplied and several projects in Transportation Planning Systems, indifferent countries, are being developed. In this work, we present theGIST Planning Transportation Systems, a Portuguese project involving twouniversities and six public transportation companies. We describe indetail one of the most relevant modules of this project, the crew-scheduling module. The crew-scheduling module is based on the application of meta-heuristics, in particular GRASP, tabu search and geneticalgorithm to solve the bus-driver-scheduling problem. The metaheuristicshave been successfully incorporated in the GIST Planning TransportationSystems and are actually used by several companies.
Resumo:
We show that if performance measures in a stochastic scheduling problem satisfy a set of so-called partial conservation laws (PCL), which extend previously studied generalized conservation laws (GCL), then the problem is solved optimally by a priority-index policy for an appropriate range of linear performance objectives, where the optimal indices are computed by a one-pass adaptive-greedy algorithm, based on Klimov's. We further apply this framework to investigate the indexability property of restless bandits introduced by Whittle, obtaining the following results: (1) we identify a class of restless bandits (PCL-indexable) which are indexable; membership in this class is tested through a single run of the adaptive-greedy algorithm, which also computes the Whittle indices when the test is positive; this provides a tractable sufficient condition for indexability; (2) we further indentify the class of GCL-indexable bandits, which includes classical bandits, having the property that they are indexable under any linear reward objective. The analysis is based on the so-called achievable region method, as the results follow fromnew linear programming formulations for the problems investigated.