Scheduling Peacetime Rotation of Pakistan Army Units
Loading...
Authors
Dell, Robert F.
Rosenthal, Richard E.
Baig, Shafqat
Subjects
Integer Programming Application
Scheduling
Timetabling
Scheduling
Timetabling
Advisors
Date of Issue
1993-11
Date
1993-11
Publisher
Monterey, California. Naval Postgraduate School
Language
en_US
Abstract
Since Pakistan has varying climates and terrains, the Pakistan Army rotates its units between peacetime locations so that no unit endures inequitable hardship or enjoys unfair advantage. Army policy specifies strict constraints on unit rotations, such as 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 paper presents an integer programming model that finds feasible, minimum- cost schedules for the Pakistan Army's desired planning horizons. 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 optimization software. Schedules are obtained for realistic test problems in less than an hour on a personal computer.
Type
Technical Report
Description
Series/Report No
Department
Operations Research
Organization
Graduate School of Operational and Information Sciences (GSOIS)
Identifiers
NPS Report Number
NPS-OR-93-023
Sponsors
Naval Postgraduate School, Monterey, California.
Funder
RNX2DP
Format
Citation
Distribution Statement
Approved for public release; distribution is unlimited.
Rights
This publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.