127 resultados para order-picking systeme
Resumo:
A method is given for solving an optimal H2 approximation problem for SISO linear time-invariant stable systems. The method, based on constructive algebra, guarantees that the global optimum is found; it does not involve any gradient-based search, and hence avoids the usual problems of local minima. We examine mostly the case when the model order is reduced by one, and when the original system has distinct poles. This case exhibits special structure which allows us to provide a complete solution. The problem is converted into linear algebra by exhibiting a finite-dimensional basis for a certain space, and can then be solved by eigenvalue calculations, following the methods developed by Stetter and Moeller. The use of Buchberger's algorithm is avoided by writing the first-order optimality conditions in a special form, from which a Groebner basis is immediately available. Compared with our previous work the method presented here has much smaller time and memory requirements, and can therefore be applied to systems of significantly higher McMillan degree. In addition, some hypotheses which were required in the previous work have been removed. Some examples are included.
Resumo:
The authors use simulation to analyse the resource-driven dependencies between concurrent processes used to create customised products in a company. Such processes are uncertain and unique according to the design changes required. However, they have similar structures. For simulation, a level of abstraction is chosen such that all possible processes are represented by the same activity network. Differences between processes are determined by the customisations that they implement. The approach is illustrated through application to a small business that creates customised fashion products. We suggest that similar techniques could be applied to study intertwined design processes in more complex domains. Copyright © 2011 Inderscience Enterprises Ltd.