IDEAS home Printed from
   My bibliography  Save this article

Resource-Constrained Project Scheduling with Time-Resource Tradeoffs: The Nonpreemptive Case


  • F. Brian Talbot

    (University of Michigan)


This paper introduces methods for formulating and solving a general class of nonpreemptive resource-constrained project scheduling problems in which the duration of each job is a function of the resources committed to it. The approach is broad enough to permit the evaluation of numerous time or resource-based objective functions, while simultaneously taking into account a variety of constraint types. Typical of the objective functions permitted are minimize project duration, minimize project cost given performance payments and penalties, and minimize the consumption of a critical resource. Resources which may be considered include those which are limited on a period-to-period basis such as skilled labor, as well as those such as money, which are consumed and constrained over the life of the project. At the planning stage the user of this approach is permitted to identify several alternative ways, or modes, of accomplishing each job in the project. Each mode may have a different duration, reflecting the magnitude and mix of the resources allocated to it. At the scheduling phase, the procedure derives a solution which specifies how each job should be performed, that is, which mode should be selected, and when each mode should be scheduled. In order to make the presentation concrete, this paper focuses on two problems: given multiple resource restrictions, minimize project completion time, and minimize project cost. The latter problem is also known as the resource-constrained time-cost tradeoff problem. Computational results indicate that the procedures provide cost-effective optimal solutions for small problems and good heuristic solutions for larger problems. The programmed solution algorithms are relatively simple and require only modest computing facilities, which permits them to be potentially useful scheduling tools for organizations having small computer systems.

Suggested Citation

  • F. Brian Talbot, 1982. "Resource-Constrained Project Scheduling with Time-Resource Tradeoffs: The Nonpreemptive Case," Management Science, INFORMS, vol. 28(10), pages 1197-1210, October.
  • Handle: RePEc:inm:ormnsc:v:28:y:1982:i:10:p:1197-1210

    Download full text from publisher

    File URL:
    Download Restriction: no


    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:ormnsc:v:28:y:1982:i:10:p:1197-1210. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Mirko Janc). General contact details of provider: .

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.