A Method for Least-Cost Scheduling of Personnel through Training Course Sequences

by C. D. Roach

Download

Download eBook for Free

FormatFile SizeNotes
PDF file 0.8 MB

Use Adobe Acrobat Reader version 10 or higher for the best experience.

Purchase

Purchase Print Copy

 FormatList Price Price
Add to Cart Paperback32 pages $20.00 $16.00 20% Web Discount

An algorithm that finds the five least-cost sequences for scheduling military personnel through a series of courses where the costs incurred are transportation costs. The algorithm adapts the implicit enumeration approach of integer programming to this pipeline flow problem and will require at least [(n - 2.8)n]' fewer computations than total enumeration, where [n] is the number of courses. It can also be used to determine the least-cost sequences when mixed travel modes are involved.

This report is part of the RAND Corporation report series. The report was a product of the RAND Corporation from 1948 to 1993 that represented the principal publication documenting and transmitting RAND's major research findings and final research.

Permission is given to duplicate this electronic document for personal use only, as long as it is unaltered and complete. Copies may not be duplicated for commercial purposes. Unauthorized posting of RAND PDFs to a non-RAND Web site is prohibited. RAND PDFs are protected under copyright law. For information on reprint and linking permissions, please visit the RAND Permissions page.

The RAND Corporation is a nonprofit institution that helps improve policy and decisionmaking through research and analysis. RAND's publications do not necessarily reflect the opinions of its research clients and sponsors.