The Nature of Community OR

This paper outlines the results of a study undertaken to investigate the nature of Community Operational Research (COR). The objective was to contact the people involved in COR through a series of personal interviews and a questionnaire survey, in order to clarify many of the issues that have emerged within the profession relating to the practice of OR within the community and voluntary sector. A total of 20 individuals were successfully contacted, and they have been responsible for at least two-thirds of the projects in the COR area.     

A Note on an Input Control Model of a Predictive Regression Interval

A well-known problem of prediction in linear regression models is to find a confidence interval for the random value of the dependent variable when the values of the independent variables are given. Such a situation may arise in economic quality control models when the independent variables are costly inputs and the dependent variable is some measure of quality or production. In such a circumstance, an important control objective may be to find values for the inputs that will maximize the lower limit of the prediction confidence interval for a fixed budget, or alternatively, to minimize the cost of the inputs for a fixed lower limit of the confidence interval. In this paper, we shall show that global optima can be found using known algorithms. The special case of simple linear regression is discussed and an illustrative example is provided.     

Refining the Diffusion Approximation for the <Emphasis Type="Italic">GI</Emphasis><Superscript><Emphasis Type="Italic">x</Emphasis></Superscript><Emphasis Type="Italic">/G/c</Emphasis> Queue

This paper deals with the GI ^x /G/c queueing system in a steady state. We refine a diffusion approximation method incorporating the constraint of traffic conservation for general queueing systems. An approximate expression for the distribution of the number of customers is obtained. Numerical results are presented to show that the refined model provides improved performance.     

An Overview of Scheduling Problems Arising in Satellite Communications

Satellite communications, like batches of work in a job shop, need to be scheduled in order to use their resources as efficiently as possible. The most common satellite communications system in use today is known as Time Division Multiple Access (TDMA), in which data from earth stations is buffered before being transmitted to the appropriate receiver on a satellite. Cycles of transmission are fixed for all stations. Since the same satellite will be used for routeing data in several different ways, a schedule must be devised to use the receivers, repeaters and transmitters on board to minimize the time needed for completion of a batch of work. This paper is a survey of current scheduling algorithms used for optimizing satellite communications resources. Apart from telecommunications, the methods presented here could be applied to more general scheduling problems with renewable resources but without precedence constraints.     

Total Electron Content Measurements in the Ionosphere Disturbed by High-Power High-Frequency Waves by the Methods of Incoherent Scattering of Radio Waves and Radio Sounding by Glonass Satellite Signal

Radiophysics and Quantum Electronics - We present the results of comparing the total electron content measurements based on GLONASS satellite signals and the EISCAT UHF incoherent scatter radar...     

An extremal problem related to probability

Summary We consider a walk from a stateA ₁ to a stateA _n+1 in which the probability of remaining atA _i isp _i , and the probability of progressing fromA _i toA _i+1 is 1 –p _i . The probabilityW _nk of reachingA _n+1 fromA ₁ in exactlyn + k steps can then be expressed as a polynomial of degreen + k in then variablesp ₁,,p _n . We determine the maximum value ofW _nk and the (unique) choice (p ₁,,p _n ) for which this extremum occurs.Dedicated to Professor Otto Haupt with best wishes on his 100th birthday     

On regular polyhedra with hidden symmetries

We consider polyhedral realizations of oriented regular maps with or without self-intersections in E³ whose symmetry group is a subsgroup of small index in their. automorphism group. The four classical kepler-poinsot polyhedra are the only ones of index 1. There are exactly five of Index 2, all with icosahedral symmetry group [W2] as the Kepler-poinsot polyhedra. In this paper we show that there are no such polyhedral realizations with octahedral (tetrahedral) symmetry group and index 2 or 3 (2,3,4,5), which is best possible in the octahedral case.     

Experiences in Expert Systems

This paper describes some work carried out in the Scientific Research and Development Branch (SRDB) of the Home Office, intended to contribute to an overall aim of building up internal expertise in the field of expert systems. This was done by carrying out a number of pilot and demonstrator projects, two of which are described in some detail. The plan, which proved successful, was to build as far as possible on the relevant skills already possessed by an OR group in the branch. The lessons learned from these are summarized in the hope that they will be of use to other groups who wish to become involved in this important area.     

Multi-Item Scheduling by Benders' Decomposition

Scheduling the production of several items requires the determination of production quantities in different periods in the presence of resource constraints. Several approximate and heuristic algorithms have been proposed to solve this problem. However, no method for finding an optimal solution has as yet been developed. It is shown that the problem may be solved advantageously using Benders' decomposition. The subproblem in Benders' decomposition is shown to be a transportation problem, and some strategies for solving the master problem are indicated. The paper concludes with a sample problem demonstrating the application of the method.