Recent articles on partial backorders: Comment

This note points out the omission of a simple but vital constraint in the recent articles on partial backlogging. Also, a simple intuitive interpretation of the “backorder” inequality of [2], [3], and [4] is provided.     

A (Q,R) inventory model with lost sales and erlang-distributed lead times

The exact expression is derived for the average stationary cost of a (Q,R) inventory system with lost sales, unit Poisson demands, Erlang-distributed lead times, fixed order cost, fixed cost per unit lost sale, linear holding cost per unit time, and a maximum of one order outstanding. Explicit expressions for the state probabilities and a fast method of calculating them are obtained for the case of Q greater than R. Exponential lead times are analyzed as a special case. A simple cyclic coordinate search procedure is used to locate the minimum cost policy. Examples of the effect of lead time variability on costs are given.     

A heuristic with tie breaking for certain 0–1 integer programming models

A heuristic for 0–1 integer programming is proposed that features a specific rule for breaking ties that occur when attempting to determine a variable to set to 1 during a given iteration. It is tested on a large number of small- to moderate-sized randomly generated generalized set-packing models. Solutions are compared to those obtained using an existing well-regarded heuristic and to solutions to the linear programming relaxations. Results indicate that the proposed heuristic outperforms the existing heuristic except for models in which the number of constraints is large relative to the number of variables. In this case, it performs on par with the existing heuristic. Results also indicate that use of a specific rule for tie breaking can be very effective, especially for low-density models in which the number of variables is large relative to the number of constraints.     

Causative matrix technique for deriving interim period transition probabilities in nonstationary markov process

The Markov assumption that transition probabilities are assumed to be constant over entire periods has been applied in economic and social structures, for example, in the analysis of income and wage distributions. In many cases, however, nonstationary transition probabilities exist over different periods. Based on causative matrix technique, this study shows a binomial approximation for obtaining nonstationary interim transition probabilities under undisturbance when the first and the last transition matrices are known.     

一种远程联机信息系统

远程联机信息系统是建立在远程计算机网络上的应用信息系统。它既要遵循网络联机的通信特性,又要完成应用系统的任务。从而远程联机信息系统就有它的新特点。我们在日本富士通公司的计算机集中式网络上完了计划管理的远程联机信息系统。