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

Search and Simulation Selection of a Job-Shop Sequencing Rule

Author

Listed:
  • James C. Hershauer

    (Arizona State University)

  • Ronald J. Ebert

    (University of Missouri--Columbia)

Abstract

A standardized approach to selecting a simple sequencing rule for decentralized application throughout a job shop is developed and illustrated. The sequencing rule is a linear combination of decision factors, each of which is initially assigned a relative weighting. The rule is then used to determine the priority of each job in the queues, and resulting shop costs are determined by computer simulation. The coefficients of the priority function are thereafter modified by a patterned search procedure to find priority coefficients that minimize expected cost per order for a specified cost structure. The cost structure is a combination of multiple response measures for the shop. Rather than leading to a "single best rule" for all job shops, the approach is a "method for finding" a sequencing rule that performs well in any specific job shop situation.

Suggested Citation

  • James C. Hershauer & Ronald J. Ebert, 1975. "Search and Simulation Selection of a Job-Shop Sequencing Rule," Management Science, INFORMS, vol. 21(7), pages 833-843, March.
    • Handle: RePEc:inm:ormnsc:v:21:y:1975:i:7:p:833-843
    DOI: 10.1287/mnsc.21.7.833
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.21.7.833
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.21.7.833?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. Kim, S. C. & Bobrowski, P. M., 1997. "Scheduling jobs with uncertain setup times and sequence dependency," Omega, Elsevier, vol. 25(4), pages 437-447, August.
    2. Pickardt, Christoph W. & Hildebrandt, Torsten & Branke, Jürgen & Heger, Jens & Scholz-Reiter, Bernd, 2013. "Evolutionary generation of dispatching rule sets for complex dynamic scheduling problems," International Journal of Production Economics, Elsevier, vol. 145(1), pages 67-77.
    3. Agliari, Anna & Diligenti, Mauro & Zavanella, Lucio, 1995. "Variable priority dispatching rules: An analytical approach," International Journal of Production Economics, Elsevier, vol. 41(1-3), pages 51-58, October.
    4. Azadivar, Farhad & Lee, Young-Hae, 1988. "Optimization of discrete variable stochastic systems by computer simulation," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 30(4), pages 331-345.
    5. Chandrashekar, Ashok & Callarman, Thomas E., 1998. "A modelling study of the effects of continuous incremental improvement in the case of a process shop," European Journal of Operational Research, Elsevier, vol. 109(1), pages 111-121, August.

    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:inm:ormnsc:v:21:y:1975:i:7:p:833-843. 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.