A Horizon-Varying, Zero-One Approach to Project Scheduling
Bounding techniques similar to those used with branch and bound procedures are used in this study in conjunction with zero-one programming to produce minimum duration schedules for the resource constrained, project scheduling problem. The algorithms developed consist of examining the feasibility of a series of zero-one programming problems rather than solving one zero-one problem optimally. Computational results demonstrate the advantage of this method over using zero-one programming without employing any form of bounding. A comparison with other exact procedures for solving the resource constrained, project scheduling problem is also given.
Year of publication: |
1974
|
---|---|
Authors: | Patterson, James H. ; Huber, Walter D. |
Published in: |
Management Science. - Institute for Operations Research and the Management Sciences - INFORMS, ISSN 0025-1909. - Vol. 20.1974, 6, p. 990-998
|
Publisher: |
Institute for Operations Research and the Management Sciences - INFORMS |
Saved in:
Online Resource
Saved in favorites
Similar items by person
-
A horizon-varying, zero-one approach to project scheduling
Patterson, James H., (1974)
-
Patterson, James H., (1989)
-
Patterson, James H., (1984)
- More ...