Download
Download eBook for Free
| Format | File Size | Notes |
|---|---|---|
| PDF file | 2.5 MB | Use Adobe Acrobat Reader version 10 or higher for the best experience. |
Purchase
Purchase Print Copy
| Format | List Price | Price | |
|---|---|---|---|
| Add to Cart | Paperback76 pages | $15.00 | $12.00 20% Web Discount |
The purpose of this expository paper is to describe a number of representative problems in the field of scheduling which will furnish some idea of the types of mathematical questions which confront us in this domain. In doing so we shall touch upon some of the analytic and computational techniques which have been utilized to date to treat these problems, and thus unavoidably display the deplorable state of the art.
This report is part of the RAND Corporation Paper series. The paper was a product of the RAND Corporation from 1948 to 2003 that captured speeches, memorials, and derivative research, usually prepared on authors' own time and meant to be the scholarly or scientific contribution of individual authors to their professional fields. Papers were less formal than reports and did not require rigorous peer review.
This document and trademark(s) contained herein are protected by law. This representation of RAND intellectual property is provided for noncommercial use only. Unauthorized posting of this publication online is prohibited; linking directly to this product page is encouraged. Permission is required from RAND to reproduce, or reuse in another form, any of its research documents for commercial purposes. For information on reprint and reuse permissions, please visit www.rand.org/pubs/permissions.
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.