Navy Personnel Planning and the Optimal Partition

One could argue that the Navy's most important resource is its personnel, and as such, workforce planning is a crucial task. We investigate a new model and solution technique that is designed to aid in optimizing the process of assigning sailors to jobs. This procedure attempts to achieve an increased level of sailor satisfaction by providing a list of possible jobs from which a sailor may choose. We show that the optimal partition provided by an interior-point algorithm is particularly useful when designing the job lists. This follows because a strictly complementary solution to the linear programming relaxation observes all possible optimal solutions to the original binary problem. The techniques developed rely on a continuous parametric analysis, and we show that the parameterization provides meaningful information about the structure of the optimal assignments.

[1]  T. Liang,et al.  A LARGE‐SCALE PERSONNEL ASSIGNMENT MODEL FOR THE NAVY* , 1987 .

[2]  Jeffery L. Kennington,et al.  Assignment with En route training of navy personnel , 1993, Naval Research Logistics (NRL).

[3]  D. Klingman,et al.  Topological and Computational Aspects of Preemptive Multicriteria Military Personnel Assignment Problems , 1984 .

[4]  A. Holder.  Partitioning multiple objective optimal solutions with applications in radiotherapy design , 2006 .

[5]  David M. Ryan,et al.  Flight Attendant Rostering for Short-Haul Airline Operations , 1997, Oper. Res..

[6]  Stephen Miller,et al.  Optimized Crew Scheduling at Air New Zealand , 2001, Interfaces.

[7]  Yinyu Ye,et al.  Interior point algorithms: theory and analysis , 1997 .

[8]  S. Itoh,et al.  Variational inequalities and complementarity problems , 1978 .

[9]  T. Liang,et al.  Improving the utilization of training resources through optimal personnel assignment in the U.S. Navy , 1988 .

[10]  David M. Ryan,et al.  The Solution of Massive Generalized Set Partitioning Problems in Aircrew Rostering , 1992 .

[11]  William J. Cook,et al.  Combinatorial optimization , 1997 .

[12]  P. Hall.  On Representatives of Subsets , 1935 .

[13]  Stephen J. Wright.  Primal-Dual Interior-Point Methods , 1997, Other Titles in Applied Mathematics.

[14]  Jean-Philippe Vial,et al.  Theory and algorithms for linear optimization - an interior point approach , 1998, Wiley-Interscience series in discrete mathematics and optimization.

[15]  L. McLinden.  An analogue of Moreau's proximation theorem, with application to the nonlinear complementarity problem. , 1980 .

[16]  Thomas A. Blanco,et al.  A Sea Story: Implementing the Navy's Personnel Assignment System , 1994, Oper. Res..

[17]  Renato D. C. Monteiro,et al.  A general parametric analysis approach and its implication to sensitivity analysis in interior point methods , 1996, Math. Program..