Scheduling for Known but Irregular Batch-Wise Demand

The paper deals with the batch size problem, given that demand is batch-wise and the times and quantities of the first n demands are known. This is found to be a problem in dynamic programming.A treatment is devised which may often enable that part of the demand to be scheduled optimally which must be procured before further information becomes available; which solves the problem in such cases. In other cases the final decision between the surviving possibilities may have to be based on possibly non-optimal criteria. Where it is known that the nth demand is the last, the problem can be solved completely.Details of computational methods are given, including worked examples. The methods appear suitable for computer programming, but are in any case (relatively) fast by hand; a solution may normally be obtained in, say, 5n minutes or less, except where the individual demands are much smaller than the optimum batch size (in which case other—approximate—methods may be preferred and would be unlikely to incur much penalty).     

Erratum: Scheduling for a Known but Irregular Batch-Wise Demand

Journal of the Operational Research Society -     

Mean value of weyl sums

We give a simple proof of a mean value theorem of I. M. Vinogradov in the following form. Suppose P, n, k, τ are integers, P≥1, n≥2, k≥n (τ+1), τ≥0. Put $$J_{k,n} (P) = \int_0^1 \cdots \int_0^1 {\left| {\sum\nolimits_{x = 1}^P {e^{2\pi i(a_1 x + \cdots + a_n x^n )} } } \right|^{2k} da_1 \ldots da_n .} $$ Then $$J_{k,n} \leqslant n!k^{2n\tau } n^{\sigma n^2 u} \cdot 2^{2n^2 \tau } P^{2k - \Delta } ,$$ where $$\begin{gathered} u = u_\tau = min(n + 1,\tau ), \hfill \\ \Delta = \Delta _\tau = n(n + 1)/2 - (1 - 1/n)^{\tau + 1} n^2 /2. \hfill \\ \end{gathered} $$      

Indecomposable representations of generalized weyl algebras

For a class of generalized Weyl algebras which includes the Weyl algebras A_n a criterion is given as to when the category of indecomposable weight and generalized weight modules with supports from a fixed orbit is tame. In tame cases indecomposable modules are described.     

Eigenfrequencies of fractal drums

A method for the computation of eigenfrequencies and eigenmodes of fractal drums is presented. The approach involves first conformally mapping the unit disk to a polygon approximating the fractal and then solving a weighted eigenvalue problem on the unit disk by a spectral collocation method. The numerical computation of the complicated conformal mapping was made feasible by the use of the fast multipole method as described in [L. Banjai, L.N. Trefethen, A multipole method for Schwarz–Christoffel mapping of polygons with thousands of sides, SIAM J. Sci. Comput. 25(3) (2003) 1042–1065]. The linear system arising from the spectral discretization is large and dense. To circumvent this problem we devise a fast method for the inversion of such a system. Consequently, the eigenvalue problem is solved iteratively. We obtain eight digits for the first eigenvalue of the Koch snowflake and at least five digits for eigenvalues up to the 20th. Numerical results for two more fractals are shown.     

Simple lie color algebras of weyl type

A class of graded simple associative algebras are constructed, and from them, simple Lie color algebras are obtained. The structure of these simple Lie color algebras is explicitly described. More precisely, for an (ε, Γ)-color-commutative associative algebraA with an identity element over a fieldF of characteristic not 2, and for a color-commutative subalgebraD of color-derivations ofA, denote byA[D] the associative subalgebra of End (A) generated byA (regarded as operators onA via left multiplication) andD. It is easily proved that, as an associative algebra,A[D] is Γ-graded simple if and only ifA is Γ-gradedD-simple. SupposeA is Γ-gradedD-simple. Then, (a)A[D] is a free leftA-module; (b) as a Lie color algebra, the subquotient [A[D],A[D]]/Z(A[D])∩[A[D],A[D]] is simple (except one minor case), whereZ(A[D]) is the color center ofA[D]. This work was supported by NSF of China, National Educational Department of China, Jiangsu Educational Committee, and Hundred Talents Program of Chinese Academy of Sciences. These authors were partially supported by Academy of Mathematics and System Sciences during their visit to this academy.     

Left almost split morphisms and generalized weyl algebras

It is proved that the category of modules of finite length over a broad class of generalized Weyl algebras contains no left almost split morphism starting from a simple module. It is shown that a similar assertion holds for the algebraUsl₂(k) over an algebraically closed field k of characteristic 0. As a by-product, a new series of simple modules for such algebras is constructed. Translated fromMatematicheskie Zametki, Vol. 66, No. 5 pp. 734–740, November, 1999.     

On eigenvalues of spherical fractal drums

We will give better estimates of a kind of nonisotropic fractal drum.     

d-critical modules of length 2 over weyl algebras

We construct a family of modules over Weyl algebras with the property of being non-simple of finite length and alsod-critical (i.e.d(M)>d(M/N) for every non-trivial submoduleN, ofM). Hered stands for the Gelfand-Kirillov dimension. We further study some properties of these modules.     

Simple weith modules over twisted generalized weyl algebras

We introduce a twisted higher rank generalization of generalized Weyl algebras and study simple weight modules over such algebras.