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

Job Shop Scheduling with Due Dates and Variable Processing Times

Author

Listed:
  • C. A. Holloway

    (Stanford University)

  • R. T. Nelson

    (University of California, Los Angeles)

Abstract

A multi-pass heuristic scheduling procedure developed for job scheduling problems with deterministic processing times is tested with processing times that are random variables. The heuristic procedure, which uses expected processing times, typically generates a delay schedule (i.e., a schedule in which some operations are delayed while the machine to process these operations is kept idle awaiting the arrival of another operation). Simulation is employed to compare the performance of the schedule generated by the heuristic procedure, a nondelay transformation of that schedule, and the nondelay schedules obtained with four single-pass dispatching rules. The criteria employed are fraction of jobs tardy, mean tardiness, variance of tardiness, and maximum tardiness. The delay schedule produced by the heuristic procedure was found to be markedly superior under certain conditions. Under other conditions, the relative performance of the scheduling rules appears highly problem dependent. Implications of these results are discussed with respect to further research.

Suggested Citation

  • C. A. Holloway & R. T. Nelson, 1974. "Job Shop Scheduling with Due Dates and Variable Processing Times," Management Science, INFORMS, vol. 20(9), pages 1264-1275, May.
    • Handle: RePEc:inm:ormnsc:v:20:y:1974:i:9:p:1264-1275
    DOI: 10.1287/mnsc.20.9.1264
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.20.9.1264
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.20.9.1264?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. Valls, Vicente & Angeles Perez, M. & Sacramento Quintanilla, M., 1998. "A tabu search approach to machine scheduling," European Journal of Operational Research, Elsevier, vol. 106(2-3), pages 277-300, April.
    2. Sabuncuoglu, I. & Bayiz, M., 2000. "Analysis of reactive scheduling problems in a job shop environment," European Journal of Operational Research, Elsevier, vol. 126(3), pages 567-586, November.
    3. Stanisław Gawiejnowicz, 2020. "A review of four decades of time-dependent scheduling: main results, new topics, and open problems," Journal of Scheduling, Springer, vol. 23(1), pages 3-47, February.
    4. Kasper, T.A. Arno & Land, Martin J. & Teunter, Ruud H., 2023. "Towards System State Dispatching in High‐Variety Manufacturing," Omega, Elsevier, vol. 114(C).
    5. van Ooijen, Henny & Bertrand, J. Will M. & Buyukkaramikli, Nasuh C., 2019. "Coordinating failed goods collecting and repair capacity policies in the maintenance of commoditized capital goods," International Journal of Production Economics, Elsevier, vol. 208(C), pages 29-42.

    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:20:y:1974:i:9:p:1264-1275. 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.