An Investigation of the Weights of Pattern 1907 Bayonets made in the UK around the First World War Period

The standard issue bayonet of the British Army immediately preceding and during the First World War was the Pattern 1907. This was manufactured at different times and in varying numbers during that period by one official body, the Royal Small Arms Factory at Enfield, and by five private contractors. These bayonets were made according to published official specifications issued by the War Department and based on a ‘pattern example’ provided by the Royal Small Arms Factory. The specifications indicate, inter alia, the quality of metal used in making the bayonets, methods of inspection and proofing, and the required maximum and minimum weight range of the completed bayonet. However, examination of a series of these bayonets in a private collection suggested that their weights varied considerably from the mid-point values of the allowed weight ranges in the original and amended specifications (16.5 oz. and 17 oz., respectively). To establish if this was a common feature among this class of bayonet as opposed to a chance factor, the weights of other surviving Pattern 1907 bayonets were determined and compared to establish the degree of variance from the official specifications as originally set out by the Royal Small Arms Factory. Seventy-six percent of the 142 bayonets surveyed were found to be above the mid-point of the allowed weight range given in the amended manufacturing specifications, with many being at the upper end of the allowed range. This is a statistically unusual result. It is speculated that the target weight may have been deliberately set higher by the individual manufacturers to eliminate the possibility of rejection of any underweight bayonets by the Royal Small Arms Factory inspectors and so a refusal of acceptance and payment for the work.     

Labor staffing and scheduling models for controlling service levels

The problems of labor staffing and scheduling have received substantial attention in the literature. We introduce two new models of the labor staffing and scheduling problems that avoid the limitations of existing models. Collectively, the models have five important attributes. First, both models ensure the delivery of a minimally acceptable level of service in all periods. Second, one model can identify the least expensive way of delivering a specified aggregate level of customer service (the labor staffing problem and a form of labor scheduling problem). Third, the other model can identify the highest level of service attainable with a fixed amount of labor (the other form of the labor scheduling problem). Fourth, the models enable managers to identify the pareto relationship between labor costs and customer service. Fifth, the models allow a degree of control over service levels that is unattainable with existing models. Because of these attributes, which existing models largely do not possess, we expect these models to have broad applicability in a wide range of organizations operating in both competitive and noncompetitive environments. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44: 719–740, 1997     

An operator theory of parametric programming for the generalized transportation problem-III-weight operators

This paper investigates the effect on the optimum solution of a capacitated generalized transportation problem when any coefficient of any row constraint is continuously varied as a linear function of a single parameter. The entire analysis is divided into three parts. Results are derived relative to the cases when the coefficient under consideration is associated, to a cell where the optimal solution in that cell attains its lower bound or its upper bound. The discussion relative to the case when the coefficient under consideration is associated to a cell in the optimal basis is given in two parts. The first part deals with the primal changes of the optimal solution while the second part is concerned with the dual changes. It is shown that the optimal cost varies in a nonlinear fashion when the coefficient changes linearly in certain cases. The discussion in this paper is limited to basis-preserving operators for which the changes in the data are such that the optimum bases are preserved. Relevant algorithms and illustrations are provided throughout the paper.     

An operator theory of parametric programming for the generalized transportation problem: II Rim,cost and bound operators

This paper investigates the effect on the optimum solution of a capacitated generalized transportation problem when certain data of the problem are continuously varied as a linear function of a single parameter. First the rim conditions, then the cost coefficients, and finally the cell upper bounds are varied parametrically and the effect on the optimal solution, the associated change in costs and the dual changes are derived. Finally the effect of simultaneous changes in both cost coefficients and rim conditions are investigated. Bound operators that effect changes in upper bounds are shown to be equivalent to rim operators. The discussion in this paper is limited to basis preserving operators for which the changes in the data are such that the optimum bases are preserved.