Least-absolute-value estimators for one-way and two-way tables

This paper concerns itself with the problem of estimating the parameters of one-way and two-way classification models by minimization of the sum of the absolute deviations of the regression function from the observed points. The one-way model reduces to obtaining a set of medians from which optimal parameters can be obtained by simple arithmetic manipulations. The two-way model is transformed into a specially structured linear programming problem, and two algorithms are presented to solve this problem. The occurrence of alternative optimal solutions in both models is discussed, and numerical examples are presented.     

Multiproduct lot-size scheduling with proportional product demands

In this paper we consider the multiproduct, multiperiod production-scheduling model of Manne under the assumption that, across products, demands are interrelated over time. When demand requirements are proportional we show that the solution has a specific structure determined by the ratio of setup to production-run time of each product. This structure holds for any length horizon and may permit a substantial (time) savings for column generation solution procedures.     

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.     

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

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