971 resultados para Production Capacity
Resumo:
This paper presents a complete, quadratic programming formulation of the standard thermal unit commitment problem in power generation planning, together with a novel iterative optimisation algorithm for its solution. The algorithm, based on a mixed-integer formulation of the problem, considers piecewise linear approximations of the quadratic fuel cost function that are dynamically updated in an iterative way, converging to the optimum; this avoids the requirement of resorting to quadratic programming, making the solution process much quicker. From extensive computational tests on a broad set of benchmark instances of this problem, the algorithm was found to be flexible and capable of easily incorporating different problem constraints. Indeed, it is able to tackle ramp constraints, which although very important in practice were rarely considered in previous publications. Most importantly, optimal solutions were obtained for several well-known benchmark instances, including instances of practical relevance, that are not yet known to have been solved to optimality. Computational experiments and their results showed that the method proposed is both simple and extremely effective.
Resumo:
CYCLOTech is a high-tech Project, related with an innovative method for direct production of a radioactive pharmaceutical, used in excess of 85% of 35 Million Nuclear Medicine procedures done yearly, worldwide, representing globally more than 3 Billion Euros. The CYCLOTech team has developed an innovative proprietary methodology based on the use of Cyclotron Centers, formally identified as the Clients (actually, there are around 450 of this Centers in function worldwide), to directly produce and deliver the radiopharmaceutical to the final users, at the Hospitals and other Health Institutions (estimating at around 25.000, worldwide). The investment still need to finish Research and Technological Development (RTD), Industrial, Regulatory and Intellectual Property Rights (IPR) issues and allow the introduction in the Market is 4,35 M€, with a Payback of 3 years, with an Investment Return Rate (IRR) of 81,7% and a Net Present Value (NPV) of 60.620.525€ (in 2020).
Resumo:
Trabalho Final de Mestrado para obtenção do grau de Mestre em Engenharia Civil na Área de Especialização de Estruturas
Resumo:
Zero-valent iron nanoparticles (nZVIs) are often used in environmental remediation. Their high surface area that is associated with their high reactivity makes them an excellent agent capable of transforming/degrading contaminants in soils and waters. Due to the recent development of green methods for the production of nZVIs, the use of this material became even more attractive. However, the knowledge of its capacity to degrade distinct types of contaminants is still scarce. The present work describes the study of the application of green nZVIs to the remediation of soils contaminated with a common anti-inflammatory drug, ibuprofen. The main objectives of this work were to produce nZVIs using extracts of grape marc, black tea and vine leaves, to verify the degradation of ibuprofen in aqueous solutions by the nZVIs, to study the remediation process of a sandy soil contaminated with ibuprofen using the nZVIs, and to compare the experiments with other common chemical oxidants. The produced nZVIs had nanometric sizes and were able to degrade ibuprofen (54 to 66% of the initial amount) in aqueous solutions. Similar remediation efficiencies were obtained in sandy soils. In this case the remediation could be enhanced (achieving degradation efficiencies above 95%) through the complementation of the process with a catalyzed nZVI Fenton-like reaction. These results indicate that this remediation technology represents a good alternative to traditional and more aggressive technologies.
Resumo:
A dynamic scheduler that supports the coexistence of guaranteed and non-guaranteed bandwidth servers is proposed. Overloads are handled by an efficient reclaiming of residual capacities originated by early completions as well as by allowing reserved capacity stealing of non-guaranteed bandwidth servers. The proposed dynamic budget accounting mechanism ensures that at a particular time the currently executing server is using a residual capacity, its own capacity or is stealing some reserved capacity, eliminating the need of additional server states or unbounded queues. The server to which the budget accounting is going to be performed is dynamically determined at the time instant when a capacity is needed. This paper describes and evaluates the proposed scheduling algorithm, showing that it can efficiently reduce the mean tardiness of periodic jobs. The achieved results become even more significant when tasks’ computation times have a large variance.
Resumo:
Dissertação para obtenção do grau de Mestre em Engenharia Electrotécnica Ramo Energia
Resumo:
Dissertação para obtenção do grau de Mestre em Engenharia Electrotécnica Ramo de Energia
Resumo:
Firms located within a cluster have access to tacit, complex and specific local knowledge which allow them to develop competitive advantage. However, firms have no equal ability to access and to apply that knowledge, meaning that not all have a similar knowledge absorptive capacity. Using a sample of the largest Portuguese firms within a footwear cluster, this paper examine whether there are significant differences in firm’s absorptive capacity and whether such differences within a cluster are related to firms’ specific characteristics. The results suggest that absorptive capacity is significantly associated with the firms’ characteristics, namely size, export intensity and position within the cluster.
Resumo:
This paper focuses on the scheduling of tasks with hard and soft real-time constraints in open and dynamic real-time systems. It starts by presenting a capacity sharing and stealing (CSS) strategy that supports the coexistence of guaranteed and non-guaranteed bandwidth servers to efficiently handle soft-tasks’ overloads by making additional capacity available from two sources: (i) reclaiming unused reserved capacity when jobs complete in less than their budgeted execution time and (ii) stealing reserved capacity from inactive non-isolated servers used to schedule best-effort jobs. CSS is then combined with the concept of bandwidth inheritance to efficiently exchange reserved bandwidth among sets of inter-dependent tasks which share resources and exhibit precedence constraints, assuming no previous information on critical sections and computation times is available. The proposed Capacity Exchange Protocol (CXP) has a better performance and a lower overhead when compared against other available solutions and introduces a novel approach to integrate precedence constraints among tasks of open real-time systems.
Resumo:
Modeling the fundamental performance limits of Wireless Sensor Networks (WSNs) is of paramount importance to understand their behavior under worst-case conditions and to make the appropriate design choices. In that direction this paper contributes with an analytical methodology for modeling cluster-tree WSNs where the data sink can either be static or mobile. We assess the validity and pessimism of analytical model by comparing the worst-case results with the values measured through an experimental test-bed based on Commercial-Off- The-Shelf (COTS) technologies, namely TelosB motes running TinyOS.
Resumo:
This paper proposes a dynamic scheduler that supports the coexistence of guaranteed and non-guaranteed bandwidth servers to efficiently handle soft-tasks’ overloads by making additional capacity available from two sources: (i) residual capacity allocated but unused when jobs complete in less than their budgeted execution time; (ii) stealing capacity from inactive non-isolated servers used to schedule best-effort jobs. The effectiveness of the proposed approach in reducing the mean tardiness of periodic jobs is demonstrated through extensive simulations. The achieved results become even more significant when tasks’ computation times have a large variance.
Resumo:
This paper proposes a new strategy to integrate shared resources and precedence constraints among real-time tasks, assuming no precise information on critical sections and computation times is available. The concept of bandwidth inheritance is combined with a capacity sharing and stealing mechanism to efficiently exchange bandwidth among tasks to minimise the degree of deviation from the ideal system’s behaviour caused by inter-application blocking. The proposed Capacity Exchange Protocol (CXP) is simpler than other proposed solutions for sharing resources in open real-time systems since it does not attempt to return the inherited capacity in the same exact amount to blocked servers. This loss of optimality is worth the reduced complexity as the protocol’s behaviour nevertheless tends to be fair and outperforms the previous solutions in highly dynamic scenarios as demonstrated by extensive simulations. A formal analysis of CXP is presented and the conditions under which it is possible to guarantee hard real-time tasks are discussed.
Resumo:
To cope with permanent fluctuations in demand, organizations are challenged to organize their manpower capacity in a flexible way. Different strategies of manpower planning are being used for this purpose. Using data from the 2002 Panel Survey of Organisations Flanders, we first verify to what extent temporal, contractual and functional flexibility strategies are applied in Flemish organizations. Subsequently, logistic regression is used to analyse the link between these flexible work strategies and a ‘fitting manpower capacity’. While the results show a negative association between the use of temporal or contractual flexibility measures and a balanced manpower capacity, functional flexibility seems to be positively related. The different logics in which numerical and functional flexibility proceed can be labeled as ‘curative’ versus ‘preventive’ strategies of flexibility. Further analyses discern between various interpretations of functional flexibility and assess whether different team types make a contribution to a fitting manpower capacity.
Resumo:
This paper proposes a new strategy to integrate shared resources and precedence constraints among real-time tasks, assuming no precise information on critical sections and computation times is available. The concept of bandwidth inheritance is combined with a greedy capacity sharing and stealing policy to efficiently exchange bandwidth among tasks, minimising the degree of deviation from the ideal system's behaviour caused by inter-application blocking. The proposed capacity exchange protocol (CXP) focus on exchanging extra capacities as early, and not necessarily as fairly, as possible. This loss of optimality is worth the reduced complexity as the protocol's behaviour nevertheless tends to be fair in the long run and outperforms other solutions in highly dynamic scenarios, as demonstrated by extensive simulations.
Resumo:
Portugal has an accentuated aging tendency, presenting an elderly population (individuals with more than 65 years old) of 19.2%. The average life expectancy is 79.2 years. Thus, it’s important to maintain autonomy and independency as long as possible. Functional ability concept rises from the need to evaluate the capacity to conduct daily activities in an independent way. It can be estimated with the 6-minute walk test (6MWT) and other validated test. This test is simple, reliable, valid and consists in a daily activity (walk). The goals of this study was to verify associations between functional capacity measured with two different instruments (6MWT and Composite Physical Function (CPF) scale) and between those results and characterization variables.