3 resultados para Running Lamps.
em Greenwich Academic Literature Archive - UK
Resumo:
Many different models have been postulated over the years for sizing of feeder drives; these models have different bases, some rationally based and others more rule-of-thumb. Experience of Jenike & Johanson and likewise of The Wolfson Centre in trouble-shooting feeder drives has shown that drive powers are often poorly matched, so there is clearly still some way to go towards establishing a universally-used reliable approach. This paper presents an on-going programme of work designed to measure feeder forces experimentally on a purpose designed testing rig, and to compare these against some of the best known available models, and also against a full size installation. One aspect which is novel is the monitoring of the transition between the “filling stress field” load on the feeder and the “flowing stress field” load.
Resumo:
The paper considers the single machine due date assignment and scheduling problems with n jobs in which the due dates are to be obtained from the processing times by adding a positive slack q. A schedule is feasible if there are no tardy jobs and the job sequence respects given precedence constraints. The value of q is chosen so as to minimize a function ϕ(F,q) which is non-decreasing in each of its arguments, where F is a certain non-decreasing earliness penalty function. Once q is chosen or fixed, the corresponding scheduling problem is to find a feasible schedule with the minimum value of function F. In the case of arbitrary precedence constraints the problems under consideration are shown to be NP-hard in the strong sense even for F being total earliness. If the precedence constraints are defined by a series-parallel graph, both scheduling and due date assignment problems are proved solvable in time, provided that F is either the sum of linear functions or the sum of exponential functions. The running time of the algorithms can be reduced to if the jobs are independent. Scope and purpose We consider the single machine due date assignment and scheduling problems and design fast algorithms for their solution under a wide range of assumptions. The problems under consideration arise in production planning when the management is faced with a problem of setting the realistic due dates for a number of orders. The due dates of the orders are determined by increasing the time needed for their fulfillment by a common positive slack. If the slack is set to be large enough, the due dates can be easily maintained, thereby producing a good image of the firm. This, however, may result in the substantial holding cost of the finished products before they are brought to the customer. The objective is to explore the trade-off between the size of the slack and the arising holding costs for the early orders.
Resumo:
In this paper a computer simulation tool capable of modelling multi-physics processes in complex geometry has been developed and applied to the casting process. The quest for high-quality complex casting components demanded by the aerospace and automobile industries, requires more precise numerical modelling techniques and one that need to be generic and modular in its approach to modelling multi-processes problems. For such a computer model to be successful in shape casting, the complete casting process needs to be addressed, the major events being:-• Filling of hot liquid metal into a cavity mould • Solidification and latent heat evolution of liquid metal • Convection currents generated in liquid metal by thermal gradients • Deformation of cast and stress development in solidified metal • Macroscopic porosity formation The above phenomena combines the analysis of fluid flow, heat transfer, change of phase and thermal stress development. None of these events can be treated in isolation as they inexorably interact with each other in a complex way. Also conditions such as design of running system, location of feeders and chills, moulding materials and types of boundary conditions can all affect on the final cast quality and must be appropriately represented in the model.