<div class="description">
<dl><dd>Title from cover</dd>
<dd>"NPS-OR-93-023."</dd>
<dd>"November 1993."</dd>
<dd>AD A276 915</dd>
<dd>Includes bibliographical references (p. 18)</dd>
<dd>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</dd>
<dd>aq/ /aq cc:9116 11/24/97</dd></dl><br>Subjects: INTEGER PROGRAMMING.; SCHEDULING.; MILITARY FORCES(FOREIGN).</div>
<div class="fn value">
Dell, Robert F.;Rosenthal, Richard E.;Baig, Shafqat.</div>
Internet Archive identifier