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

On the representation of the One Machine Sequencing Problem in the Shifting Bottleneck Heuristic

Author

Listed:
  • Mukherjee, Saral
  • Chalterjee A K

Abstract

The Shilling Bottleneck heuristic decomposes the Job Shop problem into a series of One Machine Sequencing Problems (OMSPs) with release and due dates, precedence constraints and the minimization of maximum lateness objective. It is well known that delayed precedence constraints may exist between two operations to be performed on the same machine. We identify a new type of precedence constraint that may exist in an OMSP between the predecessor of an operation and the successor of another. The premise that an OMSP captures the sequencing relationships on other machines in the release and due date information is not valid when such precedence constraints exist. A modification of the OMSP representation is proposed based on a generalized lateness objective defined on a due window. The implications of such a representation for the OMSP solution procedure have been explored.

Suggested Citation

  • Mukherjee, Saral & Chalterjee A K, 2004. "On the representation of the One Machine Sequencing Problem in the Shifting Bottleneck Heuristic," IIMA Working Papers WP2004-11-01, Indian Institute of Management Ahmedabad, Research and Publication Department.
  • Handle: RePEc:iim:iimawp:wp01855
    as

    Download full text from publisher

    File URL: https://www.iima.ac.in/sites/default/files/rnpfiles/2004-11-01saralm.pdf
    File Function: English Version
    Download Restriction: no
    ---><---

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