A Horizon-Varying, Zero-One Approach to Project Scheduling

James H. Patterson and Walter D. Huber
Additional contact information
James H. Patterson: The Pennsylvania State University
Walter D. Huber: Charmin Paper Products Company, Mehoopany, Pennsylvania

Management Science, 1974, vol. 20, issue 6, 990-998

Abstract: 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.

Date: 1974
References: Add references at CitEc
Citations: View citations in EconPapers (15)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.20.6.990 (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:20:y:1974:i:6:p:990-998

Access Statistics for this article

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