Longitudinal manpower planning models

A manpower planning model is presented that exploits the longitudinal stability of manpower cohorts. The manpower planning process is described. An infinite horizon linear program for calculating minimum cost manpower input plans is presented and found to have a straightforward solution in a great many cases and to yield an easily implemented approximation technique in other cases.     

Two-characteristic markov-type manpower flow models

A two-dimensional state space Markov Model of a Manpower System with special structure is analyzed. Examples are given from the military services. The probabilistic properties are discussed in detail with emphasis on computation. The basic equations of manpower stocks and flows are analyzed.     

Estimation for dirichlet mixed models

Dirichlet mixed models find wide application. Estimation is usually achieved through the method of moments. Here we present an iterative hybrid algorithm for obtaining the maximum likelihood estimate employing both modified Newton-Raphson and E-M methods. This successful MLE algorithm enables calculation of a jack-knife MLE. Simulation comparison of the three estimates is provided. The MLE substantially improves upon the moments estimator particularly with increasing dimension. The jack-knife MLE in turn offers dramatic improvement over the MLE.     

Short-term retrenchment planning in hierarchical manpower systems

We address the issue of short-term retrenchment planning required of organizations that are phasing down their manpower levels at rates faster than are allowed by natural attrition. Specifically, the problem we study is as follows: given the initial and target grade populations in a hierarchical manpower system at the end of a finite time horizon and the per-period rate of natural attrition for each grade, find a stationary manpower policy that minimizes the maximum per-period rate of retrenchment across all the grades over all stationary policies that yield the target grade populations at the end of the horizon. Because the problem is a nonconvex, nonseparable, nonlinear program, we develop a heuristic in which the promotion proportions of all the grades are successively fixed, starting from the lowest grade. We prove optimality of the heuristic policy in three nontrivial situations. In a computational experiment, in 135 out of 150 randomly generated instances (i.e., in 90% of the cases), the heuristic yielded a solution that was as good or better than that yielded by a benchmark computer program that solves the present problem as a nonlinear program. Further, the average computational time under the heuristic was an order of magnitude less than that under the program. © 1995 John Wiley & Sons, Inc.     

Reliability models and inference for systems operating in different environments

We consider a class of models for the reliability function of a series system. The models incorporate dependence of the function on environmental covariates. On the basis of censored data obtained by monitoring several series systems operating under various sets of values of the covariates, estimators are derived of the reliability function of a series system operating under a different set of values of the covariates. Estimators of various functionals of the reliability function, such as the trimmed mean and quantiles, are also presented. Asymptotic properties of the estimators are obtained with the use of the framework of counting processes and martingales. The loss in efficiency in estimating the regression parameters and the reliability function is also examined when one assumes a more general semiparametric model, when in fact the true model belongs to a more restricted model. We illustrate these procedures with the use of accelerated failure-time data. © 1996 John Wiley & Sons, Inc.     

A survey of preventive maintenance models for stochastically deteriorating single-unit systems

A survey of the research done on preventive maintenance is presented. The scope of the present survey is on the research published after the 1976 paper by Pierskalla and Voelker [98]. This article includes optimization models for repair, replacement, and inspection of systems subject to stochastic deterioration. A classification scheme is used that categorizes recent research into inspection models, minimal repair models, shock models, or miscellaneous replacement models.     

A model for manpower productivity during organization growth

A mathematical model is developed that enables organization and manpower planners to quantify the inefficiencies involved in rapid buildups of organizations, such as is frequently found in the aerospace industry shortly after the award of a major contract. Consideration is given to the time required to train, indoctrinate, and familiarize new workers with their jobs and the general program aspects. Once trained, workers are assumed to be productive. If the ratio of untrained to trained workers exceeds a critical value, called the buildup threshold, then the performance of the trained workers is degraded to the extent that they are no longer 100 percent efficient until this ratio returns to a value less than the threshold. The model is sufficiently general to consider an arbitrary manpower plan with more than one peak or valley. The model outputs are functions of real time and consist of the fraction of the total labor force which is productive, the fraction of the total labor units expended for nonproductive effort, the cumulative labor costs for productive effort, and the cumulative labor cost for all effort.     

Optimal maintenance models for systems subject to failure–A Review

This paper is a state-of-the-art review of the literature related to optimal maintenance models of systems subject to failure. The emphasis is on work appearing since the 1976 survey, “A Survey of Maintenance Models: The Control and Surveillance of Deteriorating Systems,” by W.P. Pierskalla and J.A. Voelker, published in this journal.     

Approximate Bayesian intervals for the reliability of series systems from mixed subsystem test data

The determination of exact Bayesian intervals for the reliability of a series system from subsystem test data gives rise to computational difficulties involving severe loss of computing precision as the number of subsystems in the system increases. The end points of Bayesian intervals are percentage points of the posterior distribution and these are shown to be well approximated by Cornish and Fisher expansions when the number of subsystems is small. As the number of subsystems in the system increases even greater accuracy is guaranteed by the asymptotic nature of the expansions. The system posterior distribution function is also shown to be well approximated by an Edgeworth expansion.     

Themes in defence manpower economics and challenges for the future

Raising and maintaining military forces have posed enormous challenges for the United States and its allies. Economists have made significant contributions to understanding of how to recruit and manage such forces. This paper highlights key past contributions and discusses challenges for future research. Rapid changes in the roles and missions of military personnel, technology, and the civilian labor market pose serious challenges for future military manpower policy and will challenge economists to develop new approaches to military recruiting and personnel management. Yet the body of past research can continue to provide insight and guidance in making decisions about defense manpower.     

The mixed ordering policy in periodic review stochastic multi-commodity inventory systems

In multi-commodity inventory systems with variable setup costs, the mixed ordering policy assumes that commodities may be ordered either individually, or may be arbitrarily grouped for joint ordering. Thus, for a two-commodity system, commodity one or commodity two or commodities one and two may be ordered incurring respectively fixed order costs of K, K₁, or K₂, where max (K₁, K₂) ≤ K ≤ K₁ + K₂, This paper considers a two-commodity periodic review system. The stationary characteristics of the system are analyzed, and, for a special case, explicit solutions are obtained for the distribution of the stock levels at the beginning of the periods. In a numerical example, optimal policy variables are computed, and the mixed ordering policy is compared with individual and joint ordering policies.     

Dynamic scheduling in single-server multiclass service systems with unit buffers

The problem of optimal dynamic sequencing for a single-server multiclass service system with only unit storage (buffer) space at each queue is considered. The model is applicable to many computer operating and telecommunicating systems (e.g., polling systems). Index policies to minimize costs for the special case of symmetric arrival rates are derived. Simulations suggest that using these indices provides a substantial improvement over cyclic schedules.     

A survey of maintenance models: The control and surveillance of deteriorating systems

The literature on maintenance models is surveyed. The focus is on work appearing since the 1965 survey, “Maintenance Policies for Stochastically Failing Equipment: A Survey” by John McCall and the 1965 book, The Mathematical Theory of Reliability, by Richard Barlow and Frank Proschan. The survey includes models which involve an optimal decision to procure, inspect, and repair and/or replace a unit subject to deterioration in service.     

Likelihood estimation for generalized mixed exponential distributions

The class of functions expressed as linear (not necessarily convex) combinations of negative exponential functions is dense in the set of all square integrable functions on the nonnegative reals. Because of this and resultant mathematical properties, linear combinations of exponential densities have excellent potential for wide application in stochastic modeling. This work documents the development and testing of a practical procedure for maximum-likelihood estimation for these generalized exponential mixtures. The algorithm offered for the problem is of the Jacobi type and guarantees that the result will provide a legitimate probability function of the prescribed type. Extensive testing has been performed and results are very favorable: convergence is rapid and the use of computer resources rather limited.     

Inequalities for mixed integer programs with structure

Mixed integer programming problems arising in practice often contain special structures such as imbedded networks and multiple choice constraints. Easily derived inequalities are given that can be used to reduce the range of admissible solutions for such problems.     

Queueing models for spares provisioning

A population of items which break down at random times and require repair is studied (the classic “machine repair problem with spares”). It is desired to determine the number of repair channels and spares required over a multiyear planning horizon in which population size and component reliability varies, and a service level constraint is imposed. When an item fails, a spare (if available) is immediately dispatched to replace the failed item. The failed item is removed, transported to the repair depot, repaired, and then placed in the spares pool (which is constrained to be empty not more than 10% of the time) unless there is a backlog of requests for spares, in which case it is dispatched immediately. The first model considered treats removal, transportation, and repair as one service operation. The second model is a series queue which allows for the separate treatment of removal, transportation, and repair. Breakdowns are assumed Poisson and repair times exponential.     

Refined prediction for linear regression models

Adequate prediction of a response variable using a multiple linear regression model is shown in this article to be related to the presence of multicollinearities among the predictor variables. If strong multicollinearities are present in the data, this information can be used to determine when prediction is likely to be accurate. A region of prediction, R, is proposed as a guide for prediction purposes. This region is related to a prediction interval when the matrix of predictor variables is of full column rank, but it can also be used when the sample is undersized. The Gorman-Toman ten-variable data is used to illustrate the effectiveness of the region R.     

Optimal replacement for fault-tolerant systems

We consider the optimal replacement problem for a fault tolerant system comprised of N components. The components are distingushable, and the state of the system is given by knowing exactly which components are operationl and which have failed. The individual component failure rates depend on the state of the entire system. We assume that the rate at which the system produces income decreases as the system deteriorates and the system replacement cost rises. Individual components cannot be replaced. We give a greedy-type algorithm that produces the replacement policy that maximizes the long-run net system income per unit time.