A heuristic network procedure for the assembly line balancing problem

Proposed is a Heuristic Network (HN) Procedure for balancing assembly lines. The procedure uses simple heuristic rules to generate a network which is then traversed using a shortest route algorithm to obtain a heuristic solution. The advantages of the HN Procedure are: a) it generally yields better solutions than those obtained by application of the heuristics, and b) sensitivity analysis with different values of cycle time is possible without having to regenerate the network. The rationale for its effectiveness and its application to problems with paralleling are presented. Computational experience with the procedure on up to 50 task test problems is provided.     

A single period model for a multiproduct perishable inventory system with economic substitution

This paper develops a single period model for a specific class of multiproduct perishable inventory systems where demands are interdependent. This class of inventory systems has the property that there is economic substitution between products. It is shown that the optimal policy has the economic substitution property, and that the rate of substitution is age dependent. The model serves as a generalization of a theorem discovered by Ignall and Veinott.     

Single machine sequencing with random processing times and random due-dates

A single machine scheduling problem in which both the processing times and due-dates of the jobs awaiting servicing are random variables is analyzed. It is proved that the properties of the shortest processing time rule and the due-date rule which are known for the deterministic situation also hold in the probabilistic environment when they are suitably, and reasonably, refined for this context.     

A decomposable transshipment algorithm for a multiperiod transportation problem

A dynamic version of the transportation (Hitchcock) problem occurs when there are demands at each of n sinks for T periods which can be fulfilled by shipments from m sources. A requirement in period t₂ can be satisfied by a shipment in the same period (a linear shipping cost is incurred) or by a shipment in period t₁ < t₂ (in addition to the linear shipping cost a linear inventory cost is incurred for every period in which the commodity is stored). A well known method for solving this problem is to transform it into an equivalent single period transportation problem with mT sources and nT sinks. Our approach treats the model as a transshipment problem consisting of T, m source — n sink transportation problems linked together by inventory variables. Storage requirements are proportional to T² for the single period equivalent transportation algorithm, proportional to T, for our algorithm without decomposition, and independent of T for our algorithm with decomposition. This storage saving feature enables much larger problems to be solved than were previously possible. Futhermore, we can easily incorporate upper bounds on inventories. This is not possible in the single period transportation equivalent.     

电磁振动给料机的研究与制造

利用振动原理,研究、设计、制造微型电磁振动给料机（筛）．设计了激磁铁芯、半波可控硅整流及控制电路．在对振动机械的隔振分析及优化设计理论的基础上,设计了整部机器的结构图纸,并制造了一部样机,给出了振动利用的一个范例．所研究制造的微型电磁振动机集机电为一体,在焊接、制药等诸多行业中具有广泛的应用价值．     

Book reviews

The Balkanization of the West: The Confluence of Postmodernism and Postcommunism By Stjepan G. Mestrovic, Routledge, London (1994). ISBN: 0-414-08755-4, Price £40.00 hardback, £13.99 paperback.

A Naval History of World War I By Professor Paul G. Halpern, UCL Press, 1994. pp. 624 ISBN 1-85728-295-7. Price £25.00

Arms Watch - SIPRI Report on the First Year of the UN Register of Conventional Arms By Edward J. Laurance, Siemon T. Wezeman and Herbert Wulf, Oxford University Press for SIPRI (1993) ISBN 019-829-1795, Price £25.00 hardback, £16.50 paperback.

A League of Airmen By J. A. Winnefeld, (Ed.), RAND, Santa Monica, ISBN 08330-1503-6, Price $30.00 (Hardcover) $15.00 (Softcover)     

A stochastic constrained optimal replacement model

In this paper a stochastically constrained replacement model is formulated. This model determines a sequence of replacement dates such that the total “current account” cost of all future costs and capital expenditures over an infinite time horizon for the n initial incumbent machines is minimized subject to the constraints that an expected number of machines are in a chosen utility class at any point in time. We then indicate one possible solution method for the model.