Resource scheduling for the United States Army's basic combat training program.

Persistent Link:
http://hdl.handle.net/10150/186816
Title:
Resource scheduling for the United States Army's basic combat training program.
Author:
McGinnis, Michael Luther.
Issue Date:
1994
Publisher:
The University of Arizona.
Rights:
Copyright © is held by the author. Digital access to this material is made possible by the University Libraries, University of Arizona. Further transmission, reproduction or presentation (such as public display or performance) of protected items is prohibited except with permission of the author.
Abstract:
Each year, the United States Army recruits and trains thousands of new soldiers to fill vacancies in Army organizations created by promotion, transfer, or termination of service. Installations responsible for training new recruits is conducted in two phases: Basic Combat Training followed by Advanced Individual Training. Proper management of the Army's initial entry training program is a very complex, practical military logistics problem that demands timely scheduling of a broad range of reusable training resources, such as, training companies. Currently, manual heuristic methods are used to schedule training companies throughout the planning horizon to support initial entry training, where training company scheduling also involves deciding how many recruits to assign to training companies each week. These methods have evolved over a number of years when there were few changes to the training base, and recruiting levels remained relatively stationary. Unfortunately, there are several severe shortcomings with these methods. For example, determining the number of recruits assigned per training company and the number of weeks a training company remains busy training recruits is a manual trial-and-error process. Second, it is possible for different analysts to generate different solutions for the same recruitment scenario. Third, no methods exist for conducting comparative analyses to appraise the quality of competing feasible training schedules. Finally, the temporal interdependence of decisions makes decision variables in the future periods depend on current decision variables. This complicates resource scheduling and makes the manual generation of week-by-week training schedules a tedious, time-consuming task. This dissertation: (1) formulates a mathematical dynamic model of the Basic Combat Training phase of initial entry training; (2) formulates a decision model for optimally scheduling training resources based on dynamic programming; (3) formulates an improved heuristic procedure for scheduling training resources; (4) incorporates a "training quality" performance measure into the formulation of the objective function making it possible to compare competing feasible training schedules obtained by various methods; and (5) designs, develops and implements a fully operational computer-based decision support system (DSS) for scheduling basic training resources. The computational experiments reveal that the heuristic procedures developed are indeed computationally efficient and provide "good" solutions in terms of training "quality," resources utilization, and training cost.
Type:
text; Dissertation-Reproduction (electronic)
Keywords:
Basic training (Military education) -- United States -- Mathematical models.; Scheduling -- United States -- Mathematical models.
Degree Name:
Ph.D.
Degree Level:
doctoral
Degree Program:
Systems and Industrial Engineering; Graduate College
Degree Grantor:
University of Arizona
Committee Chair:
Fernandez, Emmanuel; Mirchandani, Pitu

Full metadata record

DC FieldValue Language
dc.language.isoenen_US
dc.titleResource scheduling for the United States Army's basic combat training program.en_US
dc.creatorMcGinnis, Michael Luther.en_US
dc.contributor.authorMcGinnis, Michael Luther.en_US
dc.date.issued1994en_US
dc.publisherThe University of Arizona.en_US
dc.rightsCopyright © is held by the author. Digital access to this material is made possible by the University Libraries, University of Arizona. Further transmission, reproduction or presentation (such as public display or performance) of protected items is prohibited except with permission of the author.en_US
dc.description.abstractEach year, the United States Army recruits and trains thousands of new soldiers to fill vacancies in Army organizations created by promotion, transfer, or termination of service. Installations responsible for training new recruits is conducted in two phases: Basic Combat Training followed by Advanced Individual Training. Proper management of the Army's initial entry training program is a very complex, practical military logistics problem that demands timely scheduling of a broad range of reusable training resources, such as, training companies. Currently, manual heuristic methods are used to schedule training companies throughout the planning horizon to support initial entry training, where training company scheduling also involves deciding how many recruits to assign to training companies each week. These methods have evolved over a number of years when there were few changes to the training base, and recruiting levels remained relatively stationary. Unfortunately, there are several severe shortcomings with these methods. For example, determining the number of recruits assigned per training company and the number of weeks a training company remains busy training recruits is a manual trial-and-error process. Second, it is possible for different analysts to generate different solutions for the same recruitment scenario. Third, no methods exist for conducting comparative analyses to appraise the quality of competing feasible training schedules. Finally, the temporal interdependence of decisions makes decision variables in the future periods depend on current decision variables. This complicates resource scheduling and makes the manual generation of week-by-week training schedules a tedious, time-consuming task. This dissertation: (1) formulates a mathematical dynamic model of the Basic Combat Training phase of initial entry training; (2) formulates a decision model for optimally scheduling training resources based on dynamic programming; (3) formulates an improved heuristic procedure for scheduling training resources; (4) incorporates a "training quality" performance measure into the formulation of the objective function making it possible to compare competing feasible training schedules obtained by various methods; and (5) designs, develops and implements a fully operational computer-based decision support system (DSS) for scheduling basic training resources. The computational experiments reveal that the heuristic procedures developed are indeed computationally efficient and provide "good" solutions in terms of training "quality," resources utilization, and training cost.en_US
dc.typetexten_US
dc.typeDissertation-Reproduction (electronic)en_US
dc.subjectBasic training (Military education) -- United States -- Mathematical models.en_US
dc.subjectScheduling -- United States -- Mathematical models.en_US
thesis.degree.namePh.D.en_US
thesis.degree.leveldoctoralen_US
thesis.degree.disciplineSystems and Industrial Engineeringen_US
thesis.degree.disciplineGraduate Collegeen_US
thesis.degree.grantorUniversity of Arizonaen_US
dc.contributor.chairFernandez, Emmanuelen_US
dc.contributor.chairMirchandani, Pituen_US
dc.contributor.committeememberSzidarovszky, Ferencen_US
dc.identifier.proquest9502616en_US
dc.identifier.oclc705384328en_US
All Items in UA Campus Repository are protected by copyright, with all rights reserved, unless otherwise indicated.