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

Some Properties of Optimal Schedule of Jobs with a Common Due Date

Author

Listed:
  • Raghavacahari M

Abstract

Kanet (Naval Research Logistics Quarters, 1981) considered the problem of minimizing the average deviation of job completion times above a common due date. Under the condition that the common due date exceeds the makespan of the job set, he obtained a procedure SCHED which yields optimal sequence for the problem. In this paper, we consider the general problem without any condition and some general properties and in particular the V – shape of optimal schedule is proved. It is also shown that the SCHED algorithm of Kanet gives optimal sequence under less restrictive and a more practical condition on d. A few special cases including the complete solution for n=3 jobs are also given.

Suggested Citation

  • Raghavacahari M, 1983. "Some Properties of Optimal Schedule of Jobs with a Common Due Date," IIMA Working Papers WP1983-06-01_00536, Indian Institute of Management Ahmedabad, Research and Publication Department.
    • Handle: RePEc:iim:iimawp:wp00536
    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.

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