Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
