IDEAS home Printed from https://ideas.repec.org/p/iim/iimawp/wp01765.html
   My bibliography  Save this paper

Scheduling Partially Ordered Jobs Under Resource Constraints To Optimize Non-Regular Performance Measures

Author

Listed:
  • Dhavale N P
  • Verma, Sanjay
  • Bagchi Amitava

Abstract

We describe a general best-first tree search scheme that schedules a set of partially ordered jobs under resource constraints to optimize a non-regular performance measure. The scheme has been implemented for two categories of problems. In the first category, jobs have individual duedates, and the objective is to minimize the total weighted earliness-tardiness penalty. Algorithms currently available for solving problems of this type lack the full generality of the scheme proposed here. In the second category, jobs have associated cash flows, and the objective is to maximize the Net Present Value (NPV). Our methods have been implemented in C both on a Linux-based Pentium PC and on a UNIX-based DEC ALPHA workstation, and successfully tested on problem instances derived from benchmark sets such as the PROGEN set and the Patterson set. For the NPV problem, it has been compared experimentally with the existing method of Icmeli and Erenguc. A theoretical proof of optimality is also provided.

Suggested Citation

  • Dhavale N P & Verma, Sanjay & Bagchi Amitava, 2003. "Scheduling Partially Ordered Jobs Under Resource Constraints To Optimize Non-Regular Performance Measures," IIMA Working Papers WP2003-07-03, Indian Institute of Management Ahmedabad, Research and Publication Department.
    • Handle: RePEc:iim:iimawp:wp01765
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Dayal Madhukar & Verma, Sanjay, 2015. "Multi-processor Exact Procedures for Regular Measures of the Multi-mode RCPSP," IIMA Working Papers WP2015-03-25, Indian Institute of Management Ahmedabad, Research and Publication Department.
    2. Dayal Madhukar & Verma, Sanjay, 2015. "Exact Procedures for Non-Regular Measures of the Multi-Mode RCPSP," IIMA Working Papers WP2015-03-06, Indian Institute of Management Ahmedabad, Research and Publication Department.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    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:iim:iimawp:wp01765. See general information about how to correct material in RePEc.

    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 bibliographic 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.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: the person in charge (email available below). General contact details of provider: https://edirc.repec.org/data/eciimin.html .

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

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.