Show simple item record

dc.contributor.authorDell, Robert F.
dc.contributor.authorRosenthal, Richard E.
dc.contributor.authorBaig, Shafqat
dc.date1993-11
dc.date.accessioned2013-03-07T21:54:04Z
dc.date.available2013-03-07T21:54:04Z
dc.date.issued1993-11
dc.identifier.urihttp://hdl.handle.net/10945/30153
dc.descriptionApproved for public release; distribution is unlimited.en_US
dc.description.abstractSince 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.en_US
dc.description.sponsorshipNaval Postgraduate School, Monterey, California.en_US
dc.description.urihttp://archive.org/details/schedulingpeacet00dell
dc.language.isoen_US
dc.publisherMonterey, California. Naval Postgraduate Schoolen_US
dc.rightsThis publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. As such, it is in the public domain, and under the provisions of Title 17, United States Code, Section 105, may not be copyrighted.en_US
dc.subject.lcshINTEGER PROGRAMMINGen_US
dc.titleScheduling Peacetime Rotation of Pakistan Army Unitsen_US
dc.typeReporten_US
dc.contributor.corporateNaval Postgraduate School (U.S.)
dc.contributor.departmentOperations Research
dc.subject.authorInteger Programming Applicationen_US
dc.subject.authorSchedulingen_US
dc.subject.authorTimetablingen_US
dc.description.funderRNX2DPen_US
dc.identifier.oclcNA
dc.identifier.npsreportNPS-OR-93-023


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record