IDEAS home Printed from https://ideas.repec.org/a/eee/jomega/v15y1987i1p49-57.html
   My bibliography  Save this article

Priority dispatching rules in an assembly shop

Author

Listed:
  • Sculli, D

Abstract

This paper reports the results of a job shop computer simulation study in which jobs were made up of several parts, and where operations on the different parts can be going on at the same time in different machining centres. Priority rules are evaluated in terms of average job flow time, and have been chosen mainly for their ability to coordinate the completion time of the various job parts. A rule based on the minimum remaining job time has been found to produce the best results. The paper also attempts to classify the various priority rules in terms of their operational significance.

Suggested Citation

  • Sculli, D, 1987. "Priority dispatching rules in an assembly shop," Omega, Elsevier, vol. 15(1), pages 49-57.
    • Handle: RePEc:eee:jomega:v:15:y:1987:i:1:p:49-57
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0305-0483(87)90052-1
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

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


    Cited by:

    1. Xiao Wang & Mei Liu & Peisi Zhong & Chao Zhang & Dawei Zhang, 2023. "A Discrete Cooperative Control Method for Production Scheduling Problem of Assembly Manufacturing System," Sustainability, MDPI, vol. 15(18), pages 1-23, September.
    2. Golenko-Ginzburg, Dimitri & Kesler, Shmuel & Landsman, Zinoviy, 1995. "Industrial job-shop scheduling with random operations and different priorities," International Journal of Production Economics, Elsevier, vol. 40(2-3), pages 185-195, August.
    3. Guide, V. Daniel R. & Kraus, Mark E. & Srivastava, Rajesh, 1997. "Scheduling policies for remanufacturing," International Journal of Production Economics, Elsevier, vol. 48(2), pages 187-204, January.
    4. Daniel, V. & Guide, R. Jr., 1997. "Scheduling with priority dispatching rules and drum-buffer-rope in a recoverable manufacturing system," International Journal of Production Economics, Elsevier, vol. 53(1), pages 101-116, November.
    5. Jianjun Liu & Martin J. Land & Jos A. C. Bokhorst & Qingxin Chen, 2023. "Improving coordination in assembly job shops: redesigning order release and dispatching," Flexible Services and Manufacturing Journal, Springer, vol. 35(3), pages 669-697, September.

    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:eee:jomega:v:15:y:1987:i:1:p:49-57. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/375/description#description .

    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.