A Note on the Legendre Series Solution of the Biharmonic Equation for Cylindrical Problems

The solution of cylindrical problems is addressed. A series solution is considered of the biharmonic equation, in which the series terms of the stress function Φ are expressions based upon Legendre polynomials and logarithmically singular functions. An explicit form of a polynomial supplementing each logarithmically singular part of the series solution is obtained.     

An Incompressible Fluid in a Weakly Deformable Shell. Part I: Analysis of the Model

We consider the flow of a viscous incompressible fluid in a pipe when the boundary is a deformable shell of Naghdi type. We prove that the corresponding system of partial differential equations has a solution when the deformation of the shell is smooth and small enough. We propose an algorithm that uncouples the unknowns and prove its convergence.     

A Lie symmetry approach for the solution of the inverse kinematics problem

In this paper, it is considered the inverse kinematics problem, which is faced from a differential point of view. In particular, it is shown that an asymptotic inverse kinematics can be interpreted as a Lie symmetry of the direct kinematics. A parameterization of all Lie symmetries of the direct kinematics is proposed, and the classical Newton and gradient method are obtained as particular cases.     

Nonlinear analysis of laser droplet generation by means of 0–1 test for chaos

We apply the recently improved version of the 0–1 test for chaos to real experimental time series of laser droplet generation process. In particular two marginal regimes of dripping are considered: spontaneous and forced dripping. The outcomes of the test reveal that both spontaneous and forced dripping time series can be characterized as chaotic, which coincides with the previous analysis based on nonlinear time series analysis.     

On some recent proposals for testing macrorealism versus quantum mechanics

In order to evaluate its relevance, we reconsider critically the recent proposal by Leggett and Garg to test macrorealism against quantum mechanics by resorting to experiments involving noninvasive measurement processes on a SQUID. Our conclusion is that, in spite of the fact that the proposed experiment would neither constitute a test of macrorealism nor a test of macrocontextuality, a simplified form of it represents a (presumably) feasible experiment permitting a direct test of macroscopic quantum coherence. We also analyze the proposal from the point of view of the recent attempts to build up model theories allowing to take, within a purely quantum framework, a macrorealistic position about natural phenomena, i.e., the socalled dynamical reduction models and we stress that the proposed experiment has no relevance for the dynamical reduction program, as developed so far. However consideration of the SQUID system allows one to test other possible dynamical mechanisms leading to the objectification of macroproperties which could, in principle, be operative. We also briefly sketch experimental procedures to be followed to get all relevant information concerning macrocoherence.     

A Lot-sizing Model for Just-in-time Manufacturing

We consider the problem of determining lot sizes of multiple items that are manufactured by a single capacitated facility. The manufacturing facility may represent a bottleneck processing activity on the shop floor or a storeroom that provides components to the shop floor. Items flow from the facility to a downstream facility, where they are assembled according to a specified mix. Just-in-time (JIT) manufacturing requires a balanced flow of items, in the proper mix, between successive facilities. Our model determines lot sizes of the various items based on available capacity and four attributes of each item: demand rate, holding cost, set-up time and processing time. Holding costs for each item accrue until the appropriate mix of items is available for shipment downstream. We develop a lot-sizing heuristic that minimizes total holding cost per time unit over all items, subject to capacity availability and the required mix of items.     

Developing and Maintaining an Equity Index Fund

An index fund is a portfolio of shares designed to replicate the investment performance of a market index. The index represents the behaviour of the market as a whole. This paper describes the selection of an index fund which minimizes expected tracking error. Using a multivariate model of returns on shares, a development of a univariate model by Taylor, the selection problem is formulated as a quadratic programme. The effects of various constraints on tracking error are demonstrated. Several policies for the readjustment of a fund are examined in the context of the differing objectives of fund managers. As a general rule, regular readjustment is shown to be a more expensive policy than irregular updating.     

Scheduling Parts in a Combined Production-transportation Work Cell

This paper is concerned with a combined production-transportation scheduling problem. The problem comprises a simple, two-machine, automated manufacturing cell, which either stands alone or is a subunit of a complete flexible manufacturing system. The cell consists of two machines in series with a dedicated part-handling device such as a crane or robotic arm for transferring parts from the first machine to the second. The loading of a new piece on the first machine and the ejection of a finished piece from the second machine are performed by dedicated automated mechanisms. The introduction of parts into the system is done n at a time, whereby the parts are reshuffled into a sequence that minimizes completion time. All processing and transfer times are considered deterministic—a reasonable assumption for a cell comprising a robotic transfer device and two CNC machining units. What complicates the problem is the assumption of a non-negligible time for the transfer device to return (empty) from the second machine to the first. The operation is a generalization of a two-machine flowshop problem, and is formulated as a specially structured, asymmetric travelling salesman problem. An approximate polynomial time 0(n log n) algorithm is proffered. The procedure incorporates a lower bound using the Gilmore–Gomory algorithm for the no-wait, two-machine flowshop problem.