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.     

A posteriori error estimates for optimal control problems governed by parabolic equations

Summary. In this paper, we derive a posteriori error estimates for the finite element approximation of quadratic optimal control problem governed by linear parabolic equation. We obtain a posteriori error estimates for both the state and the control approximation. Such estimates, which are apparently not available in the literature, are an important step towards developing reliable adaptive finite element approximation schemes for the control problem. Received July 7, 2000 / Revised version received January 22, 2001 / Published online January 30, 2002 RID="*" ID="*" Supported by EPSRC research grant GR/R31980     

Lower Bounds for the Height and Size of the Ideal Class Group in CM-Fields

 We prove that, under the assumption of the Generalized Riemann Hypothesis, the exponent of the ideal class group of a CM-field goes to infinity with its absolute discriminant. This gives a positive answer to a question raised by Louboutin and Okazaki [4]. Received September 10, 2001; in revised form April 5, 2002     

Dynamical localization for continuum random surface models

We prove Anderson localization and strong dynamical localization for random surface models in \mathbbR^d \mathbb{R}^d .     

The Solow model improved through the logistic manpower growth law

In this paper the neo-classical economic Solow-Swan model (1956) has been improved replacing its Malthusian manpower law with the Verhulst (logistic) one. The relevant ordinary differential equation for the ratio capital/work has been then integrated in closed form via the Hypergeometric function₂ F ₁. The logistic growth injection for the manpower is detected to induce a more slow dynamics onto the Solow-Swan system, which keeps its stability. Increasing developments are displayed as the technologic progress rises. Further sceneries are tested and the congruence of the new solution with the classical one is shown switching to zero the selflimitation coefficent in the logistic law. Research supported by MURST grant:Metodi matematici in economia     

OSCILLATORY SINGULAR INTEGRALS WITH VARIABLE ROUGH KERNEL,Ⅱ

Let n≥2. In this paper, the author establishes the L^2 (R^n)-boundedness of some oscillatory singular integrals with variable rough kernels by means of some estimates on hypergeometric functions and congqucnt hypergeometric funtions.     

A very special nonexistence theorem for abelian difference sets

It is wellknown that the technique of character sums together with the tools of algebraic number theory is the adequate method for the study of difference sets in abelian groups, compare for instance Ott [5] or Turyn [6]. In this paper we use this method to prove a new non-existence theorem for certain difference sets in abelian groups of order rp^a rp^a , where r 1 2 r \neq 2 and p are distinct primes.