A machine-job scheduling model.
Purchase Print Copy
| Format | List Price | Price | |
|---|---|---|---|
| Add to Cart | Paperback12 pages | $15.00 | $12.00 20% Web Discount |
A discussion of a device proposed by Fulkerson and Ford for maximal multi-commodity network flows. A machine-job scheduling model is formulated that avoids the usual in-process inventories and that has fewer equations. The activities are the possible sequence, for each job, of machine steps and interspersed delays which greatly multiply the number of activities. However, a compact network representation of the set of possible activities is developed which permits the generating of just the activity to enter the basis on each iteration without explicitly generating the others. This is accomplished by using one of the efficient procedures that now exist for computing the shortest route through a network.
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.