Cover: Linear Programming Models of Crew Assignments for Refuse Collection.

Linear Programming Models of Crew Assignments for Refuse Collection.

Published 1971

by Edward Ignall, Peter Kolesar, Warren Walker

Purchase Print Copy

 Format Price
Add to Cart Paperback24 pages $20.00

Three equivalent linear programming formulations are developed for the problem of assigning sanitation men in a district to shifts and days of the week. Payroll costs are balanced against the cost of uncollected refuse. One formulation allows problems to be solved by inspection in many cases. MPS (Mathematical Programming System for IBM System/350 computers) solutions were obtained and analyzed for a problem which used data from a sanitation district in New York City. Several extensions to the model are presented. 24 pp. Ref.

This report is part of the RAND paper series. The paper 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

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.