IDEAS home Printed from
MyIDEAS: Login to save this article or follow this journal

Heuristic Scheduling of Activities under Resource and Precedence Restrictions

  • Arne Thesen

    (University of Wisconsin-Madison)

Registered author(s):

    This paper extends the field of heuristic algorithms for resource constrained scheduling problems in three important areas. First, an algorithm is introduced where the role of the heuristic scheduling urgency factor is expanded from one of solely determining the order in which activities are considered for scheduling at a given instant, to one of determining the combination of activities to be scheduled at this instant. Second, a new hybrid scheduling urgency factor capitalizing on the fact that this algorithm is sensitive to the absolute value rather than relative sequence of the urgency factors is introduced. Finally, a systematic approach to the evaluation of such algorithms is introduced. This includes the identification of relevant problem attributes and the adoption of evaluative concepts such as computational efficiency and analytic and systems effectiveness.

    If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.

    File URL:
    Download Restriction: no

    Article provided by INFORMS in its journal Management Science.

    Volume (Year): 23 (1976)
    Issue (Month): 4 (December)
    Pages: 412-422

    in new window

    Handle: RePEc:inm:ormnsc:v:23:y:1976:i:4:p:412-422
    Contact details of provider: Postal:
    7240 Parkway Drive, Suite 300, Hanover, MD 21076 USA

    Phone: +1-443-757-3500
    Fax: 443-757-3515
    Web page:

    More information through EDIRC

    No references listed on IDEAS
    You can help add them by filling out this form.

    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

    When requesting a correction, please mention this item's handle: RePEc:inm:ormnsc:v:23:y:1976:i:4:p:412-422. 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)

    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.

    If references are entirely missing, you can add them using this form.

    If the full references list an item that is present in RePEc, but the system did not link to it, you can help with 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 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.

    This information is provided to you by IDEAS at the Research Division of the Federal Reserve Bank of St. Louis using RePEc data.