Phenomenological Model and Phase Behavior of Saturated and Unsaturated Lipids and Cholesterol

We present a phenomenological theory for the phase behavior of ternary mixtures of cholesterol and saturated and unsaturated lipids, one which describes both liquid and gel phases, and illuminates the mechanism of the behavior. In a binary system of the lipids, the two phase separate when the saturated chains are well ordered, as in the gel phase, simply due to packing effects. In the liquid phase the saturated ones are not sufficiently well ordered for separation to occur. The addition of cholesterol, however, increases the saturated lipid order to the point that phase separation is once again favorable. For the system above the main chain transition of the saturated lipid, we can obtain phase diagrams in which there is liquid-liquid phase separation in the ternary system but not in any of the binary ones, while below that temperature we obtain the more common phase diagram in which a gel phase, rich in saturated lipid, appears in addition to the two liquid phases.Comment: 16 pages, 2 figure

Domain Growth Kinetics in a Cell-sized Liposome

We investigated the kinetics of domain growth on liposomes consisting of a ternary mixture (unsaturated phospholipid, saturated phospholipid, and cholesterol) by temperature jump. The domain growth process was monitored by fluorescence microscopy, where the growth was mediated by the fusion of domains through the collision. It was found that an average domain size r develops with time t as r ~ t^0.15, indicating that the power is around a half of the theoretical expectation deduced from a model of Brownian motion on a 2-dimensional membrane. We discuss the mechanism of the experimental scaling behavior by considering the elasticity of the membrane

Optimal Control of Two-Station Tandem Production/Inventory System

A manufacturing facility consisting of two stations in tandem operates in a maketo-stock mode: after production, items are placed in a finished goods inventory that services an exogenous demand. Demand that cannot be met from inventory is backordered. Each station is modelled as a queue with controllable production rate, and the problem is to control these rates to minimize inventory holding and backordering costs. Optimal controls are computed using dynamic programming and compared with kanban and buffer control mechanisms, popular in manufacturing, and with the base stock mechanism popular in inventory/distribution systems. Conditions are found under which certain simple controls are optimal using stochastic coupling arguments. Insights are gained into when to hold work-in-process and finished goods inventory, comparable to previous studies of production lines in make-to-order and unlimited demand ("push") environments

Monotone Control of Queueing and Production/Inventory Systems

Weber and Stidham (1987) used submodularity to establish transition monotonicity (a service completion at one station cannot reduce the service rate at another station) for Markovian queueing networks that meet certain regularity conditions and are controlled to minimize service and queueing costs. We give an extension of monotonicity to other directions in the state space, such as arrival transitions, and to arrival routing problems. The conditions used to establish monotonicity, which deal with the boundary of the state space, are easily verified for many queueing systems. We also show that, without service costs, transition-monotone controls can be described by simple control regions and switching functions, extending earlier results. The theory is applied to production/inventory systems with holding costs at each stage and finished goods backorder costs

Scheduling a Make-To-Stock Queue: Index Policies and Hedging Points

A single machine produces several different classes of items in a make-to-stock mode. We consider the problem of scheduling the machine to regulate finished goods inventory, minimizing holding and backorder or holding and lost sales costs. Demands are Poisson, service times are exponentially distributed, and there are no delays or costs associated with switching products. A scheduling policy dictates whether the machine is idle or busy, and specifies the job class to serve in the latter case. Since the optimal solution can only be numerically computed for problems with several products, our goal is to develop effective policies that are computationally tractable for a large number of products. We develop index policies to decide which class to serve, including Whittle's "restless bandit" index, which possesses a certain asymptotic optimality. Several idleness policies, which are characterized by hedging points, are derived, and the best policy is obtained from a heavy traffic diffusion approximation. Nine sample problems are considered in a numerical study, and the average suboptimality of the best policy is less than 3%