Scheduling the Peacetime Rotation of Pakistan Army Units

Abstract

Since Pakistan has greatly varying climates and terrains, the Pakistan Army rotates its units between locations so that no unit endures inequitable hardship or enjoys unfair advantage. Army peacetime policy specifies strict constraints on unit rotations, including restriction on: the length of a unit's stay in any location, the number of units moving at any time, and the allowable replacements for any moving unit. Scheduling rotations manually in accordance with these rules, as is currently practiced, is extremely difficult and time-consuming. This thesis presents an integer programming model that finds feasible, minimum-cost schedules for planning horizons of up to eight years. The model also ensures that the units are positioned at the end of the planning horizon so that feasible schedules exist for future planners. The model is implemented with commercially available software: the GAMS algebraic modelling language and the XA and OSL optimizers. Schedules are obtained for realistic test problems in less than an hour on a 486/33 personal computer.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Sep 01, 1992
Accession Number
ADA257585

Entities

People

  • Shafqat Baig

Organizations

  • Naval Postgraduate School

Tags

Communities of Interest

  • Weapons Technologies

DTIC Thesaurus Topics

  • Army
  • Artillery
  • California
  • Classification
  • Computer Programming
  • Computers
  • Engineers
  • Infantry
  • Integer Programming
  • Linear Programming
  • Mathematical Programming
  • Military Applications
  • National Security
  • Operations Research
  • Pakistan
  • Personal Computers
  • Security

Readers

  • Military Mobilization and Reserve Forces Studies.
  • Operations Research