Mathematical Aspects of Scheduling Theory
ResearchPublished 1955
ResearchPublished 1955
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 publication is part of the RAND paper series. The paper series was a product of RAND 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.
RAND 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.