The machine sequencing problem – review and extensions

The deterministic sequencing problem is reviewed from the points of view of variety, models, context, methodology, and current state of the art. The relationship between the theory of sequencing and other areas of control is illustrated with the relationship of sequencing to inventory. The “cyclical EMQ (Economical Manufacturing Quantities)” problem is discussed and new formulations are presented which promise a computationally feasible resolution of this outstanding problem.     

Some results of the queueing system E/M/c

This paper analyses the E/M/c queueing system and shows how to calculate the expected number in the system, both at a random epoch and immediately preceding an arrival. These expectations are expressed in terms of certain initial probabilities which are determined by linear equations. The advantages and disadvantages of this method are also discussed.     

Scheduling coupled tasks

Consider a set of task pairs coupled in time: a first (initial) and second (completion) tasks of known durations with a specified time between them. If the operator or machine performing these tasks is able to process only one at a time, scheduling is necessary to insure that no overlap occurs. This problem has a particular application to production scheduling, transportation, and radar operations (send-receive pulses are ideal examples of time-linked tasks requiring scheduling). This article discusses several candidate techniques for schedule determination, and these are evaluated in a specific radar scheduling application.     

Estimating reliability growth (or deterioration) using time series analysis

In this paper we propose a method for estimating reliability growth (or deterioration) using time series analysis. Our method does not call for the specification of a particular model, and estimates the growth in the presence of periodicity. We illustrate our procedure by considering some binomial failure data generated during the testing of a large system of the U.S. Navy.     

Geometry of the total time on test transform

Total time on test (TTT) plots provide a useful graphical method for tentative identification of failure distribution models. Identification is based on properties of the TTT transform. New properties of the TTT transform distribution are obtained. These results are useful to the user of TTT plots. Although IFR (DFR) distributions are particularly easy to identify from TTT plots, the user must exercise caution relative to identification of IFR A (DFRA) distributions.     

A note on duality in homogeneous fractional programming

For a linear fractional programming problem, Sharma and Swarup have constructed a dual problem, also a linear fractional program, in which the objective functions of both primal and dual problems are the same. Craven and Mond have extended this result to a nonlinear fractional programming problem with linear constraints, and a dual problem for which the objective function is the same as that of the primal. This theorem is now further extended from linear to differentiable convex constraints.     

Toward a study of bidding processes part IV - games with unknown costs

This paper represents a continuation of three previous papers [1-.3] in the study of competitive bidding processes. It treats the case where a bidder's knowledge of his competitor's cost i s given by a probability distribution over a certain interval. The results obtained extend the work of Vickrey [4] to the case where the cost intervals a r e not necessarily symmetric.     

Bounds on parallel-processing of queues with multiple-phase jobs

Currently, both the hardware and software designs of many large computing systems aim at improved system performance through exploitation of parallelism in multiprocessor systems. In studying these systems, mathematical modelling and analysis constitute an important step towards providing design tools that can be used in building such systems. With this view the present paper describes a queueing model of a multiprocessor system operating in a job-shop environment in which arriving jobs consist of a random number of segments (sub-jobs). Two service disciplines are considered: one assumes that the sub-jobs of a given job are capable of parallel operation on different processors while the other assumes that the same sub-jobs must be operated in a strictly serial sequ'snce. The results (in particular, the mean number in the system and waiting time in queue) obtained for these two disciplines are shown to be bounds for more general job structures.