Multi-Item Scheduling by Benders' Decomposition

Scheduling the production of several items requires the determination of production quantities in different periods in the presence of resource constraints. Several approximate and heuristic algorithms have been proposed to solve this problem. However, no method for finding an optimal solution has as yet been developed. It is shown that the problem may be solved advantageously using Benders' decomposition. The subproblem in Benders' decomposition is shown to be a transportation problem, and some strategies for solving the master problem are indicated. The paper concludes with a sample problem demonstrating the application of the method.     

Thin film synthesis and the influence of irradiation-induced defects on the superconductivity of La1.8Sr0.2CuO4

Thin superconducting films of La_1.8Sr_0.2CuO₄ have been prepared by magnetron sputter deposition and subsequent temperature treatment. The composition of the films has been determined by Rutherford backscattering and the structure by thin film X-ray diffraction. The onset of superconductivity was about 32 K and the midpoint near 28 K. Defect production in the films by He ion bombardment revealed a drasticT _c reduction with a sensitivity similar to that observed in the Chevrel phases. Oxygen implantation and subsequent annealing led to an enhancement of theT _c onset.     

On theL p-bounds for maximal functions associated to convex bodies inR n

The dimension-freeL ²-maximal inequality for convex symmetric bodies obtained in [2] is extended forp>3/2.     

Karhunen–Loeve representations of turbulent channel flows using the method of snapshots

For three‐dimensional flows with one inhomogeneous spatial coordinate and two periodic directions, the Karhunen–Loeve procedure is typically formulated as a spatial eigenvalue problem. This is normally referred to as the direct method (DM). Here we derive an equivalent formulation in which the eigenvalue problem is formulated in the temporal coordinate. It is shown that this so‐called method of snapshots (MOS) has some numerical advantages when compared to the DM. In particular, the MOS can be formulated purely as a matrix composed of scalars, thus avoiding the need to construct a matrix of matrices as in the DM. In addition, the MOS avoids the need for so‐called weight functions, which emerge in the DM as a result of the non‐uniform grid typically employed in the inhomogeneous direction. The avoidance of such weight functions, which may exhibit singular behaviour, guarantees satisfaction of the boundary conditions. The MOS is applied to data sets recently obtained from the direct simulation of turbulence in a channel in which viscoelasticity is imparted to the fluid using a Giesekus model. The analysis reveals a steep drop in the dimensionality of the turbulence as viscoelasticity is increased. This is consistent with the results that have been obtained with other viscoelastic models, thus revealing an essential generic feature of polymer‐induced drag reduced turbulent flows. Published in 2006 by John Wiley & Sons, Ltd.     

On the Convenience to Form Coalitions or Partnerships in Simple Games

A partnership in a cooperative game is a coalition that possesses an internal structure and, simultaneously, behaves as an individual member. Forming partnerships leads to a modification of the original game which differs from the quotient game that arises when one or more coalitions are actually formed. In this paper, the Shapley value is used to discuss the convenience to form either coalitions or partnerships. To this end, the difference between the additive Shapley value of the partnership in the partnership game and the Shapley alliance value of the coalition, and also between the corresponding value of the internal and external players, are analysed. Simple games are especially considered. Research partially supported by Grant BFM 2003-01314 of the Science and Technology Spanish Ministry and the European Regional Development Fund.     

On the group extension of the transformation associated to non-archimedean continued fractions

Summary Let F_q be a finite field with q elements. We consider formal Laurent series of F_q -coefficients with their continued fraction expansions by F_q -polynomials. We prove some arithmetic properties for almost every formal Laurent series with respect to the Haar measure. We construct a group extension of the non-archimedean continued fraction transformation and show its ergodicity. Then we get some results as an application of the individual ergodic theorem. We also discuss the convergence rate for limit behaviors.     

On rank-perfect subclasses of near-bipartite graphs

Shepherd95 proved that the stable set polytopes of near-bipartite graphs are given by constraints associated with the complete join of antiwebs only. For antiwebs, the facet set reduces to rank constraints associated with single antiwebs by Wagler2004. We extend this result to a larger graph class, the complements of fuzzy circular interval graphs, recently introduced in ChudnovskySeymour2004. Received: November 2004 / Revised version: June 2005