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.     

On balking from an empty queue

The intuition while observing the economy of queueing systems, is that one’s motivation to join the system, decreases with its level of congestion. Here we present a queueing model where sometimes the opposite is the case. The point of departure is the standard first-come first-served single server queue with Poisson arrivals. Customers commence service immediately if upon their arrival the server is idle. Otherwise, they are informed if the queue is empty or not. Then, they have to decide whether to join or not. We assume that the customers are homogeneous and when they consider whether to join or not, they assess their queueing costs against their reward due to service completion. As the whereabouts of customers interact, we look for the (possibly mixed) join/do not join Nash equilibrium strategy, a strategy that if adopted by all, then under the resulting steady-state conditions, no one has any incentive not to follow it oneself. We show that when the queue is empty then depending on the service distribution, both ‘avoid the crowd’ (ATC) and ‘follow the crowd’ (FTC) scenarios (as well as none-of-the-above) are possible. When the queue is not empty, the situation is always that of ATC. Also, we show that under Nash equilibrium it is possible (depending on the service distribution) that the joining probability when the queue is empty is smaller than it is when the queue is not empty. This research was supported by The Israel Science Foundation Grant No. 237/02.     

Mechanistic Insight into the Stereochemical Control of Lactide Polymerization by Salan–Aluminum Catalysts

Alkyl aluminum complexes of chiral salan ligands assembled around the 2,2′‐bipyrrolidine core form as single diastereomers that have identical configurations of the N donors. Active catalysts for the polymerization of lactide were formed upon the addition of benzyl alcohol. Polymeryl exchange between enantiomorphous aluminum species had a dramatic effect on the tacticity of the poly(lactic acid) (PLA) in the polymerization of racemic lactide (rac‐LA): The enantiomerically pure catalyst of the nonsubstituted salan ligand led to isotactic PLA, and the racemic catalyst exhibited lower stereocontrol. The enantiomerically pure catalyst of the chloro‐substituted salan ligand led to PLA with a slight tendency toward heterotacticity, whereas the racemic catalyst led to PLA of almost perfect heterotacticity following an insertion/auto‐inhibition/exchange mechanism.     

Dynamic investigation of triangles inscribed in a circle,which tend to an equilateral triangle

We present a geometrical investigation of the process of creating an infinite sequence of triangles inscribed in a circle, whose areas, perimeters and lengths of radii of the inscribed circles tend to a limit in a monotonous manner.

First, using geometrical software, we investigate four theorems that represent interesting geometrical properties, after which we present formal proofs that rest on a combination between different fields of mathematics: trigonometry, algebra and geometry, and the use of the concept of standard deviation that is taken from statistics.     

Complexity analysis of an assignment problem with controllable assignment costs and its applications in scheduling

We extend the classical linear assignment problem to the case where the cost of assigning agent j to task i is a multiplication of task i’s cost parameter by a cost function of agent j. The cost function of agent j is a linear function of the amount of resource allocated to the agent. A solution for our assignment problem is defined by the assignment of agents to tasks and by a resource allocation to each agent. The quality of a solution is measured by two criteria. The first criterion is the total assignment cost and the second is the total weighted resource consumption. We address these criteria via four different problem variations. We prove that our assignment problem is NP-hard for three of the four variations, even if all the resource consumption weights are equal. However, and somewhat surprisingly, we find that the fourth variation is solvable in polynomial time. In addition, we find that our assignment problem is equivalent to a large set of important scheduling problems whose complexity has been an open question until now, for three of the four variations.     

Optical purification of a mixture of chiral forms by dimer formation

We introduce a readily executable method for the optical purification of "scalemic" (non 50%-50%) mixtures of chiral molecules of opposite handedness ("enantiomers"). The method relies on the formation of two types of dimers, (R-R or S-S) "homodimers" and (R-S) "heterodimers." The selectivity is linked to the difference in sign recently discovered by us to exist between certain transition-dipole matrix elements of opposite enantiomers. This sign difference results in differences in spectral propensity rules: In homodimers, transitions from the ground state can only take place to inversion symmetric excited states, while in the heterodimer the transitions are much more likely to proceed to antisymmetric excited states (although for heterodimers weak transitions to symmetric states might exist). These opposing propensity rules fully explain the observed large differences in the spectra of homodimers vs. heterodimers, which exist despite the almost identical energy levels positions. We illustrate the general concepts by computationally demonstrating the optically induced enantio-purification of scalemic mixtures of the hydropropionic C(3)H(6)O(3) (lactic) acid.     

Inversion of two-dimensional potentials from frequency-resolved spectroscopic data

We report the first successful reconstruction of two-dimensional potential energy surfaces (PES) using the magnitudes and positions of a set of frequency-resolved fluorescence (or absorption) lines. The inversion proceeds by first extracting the phases of the transition-dipole matrix elements, yielding, together with the (ground) PES to (from) which emission (absorption) occurs, a point by point reconstruction of the two-dimensional excited state PES. The inversion procedure is highly accurate even for PES with multiple minima and many missing lines, with typical RMS errors <0.002 cm(-1) in the classically allowed region and <0.018 cm(-1) in the classically forbidden region.     

The isomorphism problem for some universal operator algebras

This paper addresses the isomorphism problem for the universal (non-self-adjoint) operator algebras generated by a row contraction subject to homogeneous polynomial relations. We find that two such algebras are isometrically isomorphic if and only if the defining polynomial relations are the same up to a unitary change of variables, and that this happens if and only if the associated subproduct systems are isomorphic. The proof makes use of the complex analytic structure of the character space, together with some recent results on subproduct systems. Restricting attention to commutative operator algebras defined by a radical ideal of relations yields strong resemblances with classical algebraic geometry. These commutative operator algebras turn out to be algebras of analytic functions on algebraic varieties. We prove a projective Nullstellensatz connecting closed ideals and their zero sets. Under some technical assumptions, we find that two such algebras are isomorphic as algebras if and only if they are similar, and we obtain a clear geometrical picture of when this happens. This result is obtained with tools from algebraic geometry, reproducing kernel Hilbert spaces, and some new complex-geometric rigidity results of independent interest. The C^?-envelopes of these algebras are also determined. The Banach-algebraic and the algebraic classification results are shown to hold for the wot-closures of these algebras as well.     

Preventive maintenance for inspected systems with additive subexponential shock magnitudes

We examine the long-run average availability and cost rate of a maintained system which deteriorates according to a random-shock process. Shocks arrive according to a Poisson process. The system fails whenever the cumulative damage exceeds a given threshold. The system's failures are not self-announcing, hence, failures must be detected via inspections. The system is inspected at periodic or exponentially distributed intervals. Systems are replaced by preventive maintenance or after failure (corrective maintenance), whichever occurs first. When the distribution function of the shock magnitudes belongs to the class of subexponential distributions, we obtain simple approximations for the availability and the cost rate. Copyright © 2007 John Wiley & Sons, Ltd.