Multiproject Scheduling with Limited Resources

A Zero-One Programming Approach

by A. Alan B. Pritsker, Lawrence J. Watters, Philip S. Wolfe

Purchase Print Copy

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

A zero-one (0-1) linear programming formulation of multiproject and job-shop scheduling problems that is more general and computationally tractable than other known formulations. It can accommodate a wide range of real-world situations, including multiple resource constraints, due dates, job splitting, resource substitutability, and concurrency/nonconcurrency of job performance requirements. Three possible objective functions are discussed: (1) minimizing total throughput time for all projects; (2) minimizing the time by which all projects are completed (minimizing makespan); and (3) minimizing total lateness or lateness penalty for all projects.

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.

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.