IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v26y1980i12p1227-1237.html
   My bibliography  Save this article

Priority Update Intervals and Anomalies in Dynamic Ratio Type Job Shop Scheduling Rules

Author

Listed:
  • Nabil R. Adam

    (Rutgers University)

  • Julius Surkis

    (Rutgers University)

Abstract

Dynamic priority dispatching rules in job shops require the computation of all job priorities in a work center queue every time a machine in the work center becomes idle. This is extremely costly. Alternative priority update procedures are studied and comparative results in terms of performance measures and costs are reported. Ease of implementation of the various procedures in a real world job shop environment is discussed. A second problem related to an anomaly in ratio type dynamic priority rules is also studied; a simple modification to remove the anomaly is suggested and the performances of the "old" and "modified" procedures are compared.

Suggested Citation

  • Nabil R. Adam & Julius Surkis, 1980. "Priority Update Intervals and Anomalies in Dynamic Ratio Type Job Shop Scheduling Rules," Management Science, INFORMS, vol. 26(12), pages 1227-1237, December.
    • Handle: RePEc:inm:ormnsc:v:26:y:1980:i:12:p:1227-1237
    DOI: 10.1287/mnsc.26.12.1227
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.26.12.1227
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.26.12.1227?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

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


    Cited by:

    1. Xiong, Hegen & Fan, Huali & Jiang, Guozhang & Li, Gongfa, 2017. "A simulation-based study of dispatching rules in a dynamic job shop scheduling problem with batch release and extended technical precedence constraints," European Journal of Operational Research, Elsevier, vol. 257(1), pages 13-24.
    2. Suwa, Haruhiko, 2007. "A new when-to-schedule policy in online scheduling based on cumulative task delays," International Journal of Production Economics, Elsevier, vol. 110(1-2), pages 175-186, October.
    3. Holthaus, Oliver & Rajendran, Chandrasekharan, 1997. "Efficient dispatching rules for scheduling in a job shop," International Journal of Production Economics, Elsevier, vol. 48(1), pages 87-105, January.

    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:inm:ormnsc:v:26:y:1980:i:12:p:1227-1237. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.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.