Article1968

A ZERO-ONE PROGRAMMING APPROACH TO SCHEDULING WITH LIMITED RESOURCES,

A. Alan B. Pritsker · Lawrence J. Watters

27 citations0/0 files stored

No readable copy stored yet — this record is metadata only.

No open-access location is known for this record yet.

Literature note Cite in a project Citation map

Resource-Constrained Project Scheduling Scheduling and Optimization Algorithms Optimization and Mathematical Programming

Abstract

Abstract : A zero-one linear programming formulation of scheduling problems that is more versatile and efficient than any other known LP formulation. It is the first formulation designed to accommodate multiple resource constraints. Bowman's formulation can be extended to do so, but in a sample comparison, it required 72 variables and 125 constraints for a 3-project, 8-job, 3-resource problem compared with 33 variables and 48 constraints for the new formulation. The new method also showed substantial improvement when compared with schedules based on two common dispatching rules: first-come-first-served and earliest-completion-date. Execution time on an IBM 7044, using the Geoffrion computer code was 3 seconds. Other objective functions are formulated in the study and additional constraints are modeled. Examples of larger problems rewritten for standard LP computer codes showed that the number of variables and constraints involved are probably within no more than one order-of-magnitude of the maximum number that could be handled with available zero-one computer codes. (Author)

Paper brief

Loading…

Cite this work

Citation unavailable for this work.

BibTeX RIS CSL-JSON

No public copy is stored for this record, so only the metadata is cited.

Citations in this library

Citation map →

Stored only when both papers are in the corpus — 27 citations exist upstream.

Cited by

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

Imported from OpenAlex (CC0) — nothing here is generated.