Scheduling peacetime rotation of Pakistan Army units
By: Robert F. Dell, Richard E. Rosenthal, Shafqat Baig
Contributors: Rosenthal, Richard E.; Baig, Shafqat; Naval Postgraduate School (U.S.). Dept. of Operations Research
Publisher: Naval Postgraduate School; Available from National Technical Information Service
Published: 1993
Place of publication: Monterey, Calif; Springfield, Va
Language: eng
Number of pages: 22
Subjects: SCHEDULING; MILITARY FORCES(FOREIGN); INTEGER PROGRAMMING
Other titles: NPS-OR-93-023.
Description: 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. Integer programming      application, Scheduling, Time-tabling.
Notes: Title from cover.

"NPS-OR-93-023."

"November 1993."

AD A276 915.

Includes bibliographical references (p. 18).

aq/  /aq cc:9116 11/24/97