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

Three Heuristic Rules for Sequencing Jobs to a Single Production Facility

Author

Listed:
  • J. William Gavett

    (University of Rochester)

Abstract

This paper presents the experimental performance of three elementary rules for sequencing jobs through a single production facility. The problem is a variant of the "traveling salesman problem." It is presented in terms of the job sequencing problem because of practical constraints on problem solving methods encountered in this situation. The objective of the sequencing decision is to minimize the facility downtime or setup time over a finite batch of jobs. The study consists of examining the performance of the three heuristic rules in terms of two criteria. The first is the optimal downtime obtained by the branch and bound algorithm. The second is the downtime which results from a random sequencing of jobs through the facility. The sampling procedure considers different values of the variance of between-job setup times, the number of jobs in the sequencing batch, and the form of the distribution of setup times.

Suggested Citation

  • J. William Gavett, 1965. "Three Heuristic Rules for Sequencing Jobs to a Single Production Facility," Management Science, INFORMS, vol. 11(8), pages 166-176, June.
  • Handle: RePEc:inm:ormnsc:v:11:y:1965:i:8:p:b166-b176
    DOI: 10.1287/mnsc.11.8.B166
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.11.8.B166
    Download Restriction: no

    File URL: https://libkey.io/10.1287/mnsc.11.8.B166?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. Liao, C. J. & Yu, W. C., 1996. "Sequencing heuristics for dependent setups in a continuous process industry," Omega, Elsevier, vol. 24(6), pages 649-659, December.
    2. 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.
    3. Durk-Jouke van der Zee, 2017. "Coordinating batching decisions in manufacturing networks," International Journal of Production Research, Taylor & Francis Journals, vol. 55(18), pages 5405-5422, September.
    4. Nauss, Robert M., 2008. "Optimal sequencing in the presence of setup times for tow/barge traffic through a river lock," European Journal of Operational Research, Elsevier, vol. 187(3), pages 1268-1281, June.
    5. Allahverdi, Ali & Gupta, Jatinder N. D. & Aldowaisan, Tariq, 1999. "A review of scheduling research involving setup considerations," Omega, Elsevier, vol. 27(2), pages 219-239, April.
    6. Schaller, Jeffrey E. & Gupta, Jatinder N. D. & Vakharia, Asoo J., 2000. "Scheduling a flowline manufacturing cell with sequence dependent family setup times," European Journal of Operational Research, Elsevier, vol. 125(2), pages 324-339, 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:inm:ormnsc:v:11:y:1965:i:8:p:b166-b176. 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.