Multiproject Scheduling with Limited Resources: A Zero-One Programming Approach

A. Alan B. Pritsker, Lawrence J. Waiters and Philip M. Wolfe
Additional contact information
A. Alan B. Pritsker: Virginia Polytechnic Institute, Blacksburg, Virginia (consultant to the RAND Corporation)
Lawrence J. Waiters: The RAND Corporation
Philip M. Wolfe: Motorola, Inc., Phoenix, Arisona

Management Science, 1969, vol. 16, issue 1, 93-108

Abstract: A zero-one (0-1) linear programming formulation of multiproject and job-shop scheduling problems is presented 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 and nonconcurrency of job performance requirements. Three possible objective functions are discussed; minimizing total throughput time for all projects: minimizing the time by which all projects are completed (i.e., minimizing makespan); and minimizing total lateness or lateness penalty for all projects.

Date: 1969
References: Add references at CitEc
Citations: View citations in EconPapers (116)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.16.1.93 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:16:y:1969:i:1:p:93-108

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().