This report of an ongoing research project intended to provide computer assistance to Army units for the scheduling of training focuses on the feasibility of simulated annealing, a heuristic approach for solving scheduling problems. Following an executive summary and brief introduction, the document is divided into three sections. First, the Army training scheduling problem is described, with references to specific needs for different types of schedules for different echelons, types of scheduling constraints, time availability, downward inheritance of events and activities prescribed by higher echelons, command priorities, intra- and inter-schedule compatibility, and input-output requirements for scheduling. Simulated annealing is next introduced as a solution for scheduling problems and its process is described. An application of this algorithm is illustrated via an Army test program written in FORTRAN 77 on a VAX 11/780 computer, which focused on scheduling at the battalion level. A description of the test program (with flow diagram), methods of its evaluation, and a sample run of training schedules for five companies are provided. The third section presents conclusions and recommendations emerging from this application of the test program. Four figures, one table, and a list of references are provided. (JB)