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

Batching to Minimize Flow Times on Parallel Heterogeneous Machines

Author

Listed:
  • Gregory Dobson

    (William E. Simon Graduate School of Business Administration, University of Rochester, Rochester, New York 14627)

  • Uday S. Karmarkar

    (William E. Simon Graduate School of Business Administration, University of Rochester, Rochester, New York 14627)

  • Jeffrey L. Rummel

    (William E. Simon Graduate School of Business Administration, University of Rochester, Rochester, New York 14627)

Abstract

Traditional scheduling models have emphasized sequencing of tasks at machines. At multiple-machine work-centers mean flow times are affected by the allocation of work to machines, as well as the batch-sizes used for processing. An efficient algorithm for computing the optimal solution for the single product case is given. An approximate closed-form solution is available that could be used as a heuristic loading-rule in a dynamic environment. For the special case of equal setup times at machines, the optimal solution is given in closed form. Further, it is demonstrated that the optimal flow time for the work center depends only on the total processing rate at that center.

Suggested Citation

  • Gregory Dobson & Uday S. Karmarkar & Jeffrey L. Rummel, 1989. "Batching to Minimize Flow Times on Parallel Heterogeneous Machines," Management Science, INFORMS, vol. 35(5), pages 607-613, May.
    • Handle: RePEc:inm:ormnsc:v:35:y:1989:i:5:p:607-613
    DOI: 10.1287/mnsc.35.5.607
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.35.5.607
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.35.5.607?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. Ying Chen & Yongxi Cheng & Guiqing Zhang, 2022. "Single machine lot scheduling with non-uniform lot capacities and processing times," Journal of Combinatorial Optimization, Springer, vol. 43(5), pages 1359-1367, July.
    2. Gregory H. Graves & Chung‐Yee Lee, 1999. "Scheduling maintenance and semiresumable jobs on a single machine," Naval Research Logistics (NRL), John Wiley & Sons, vol. 46(7), pages 845-863, October.
    3. Lambrecht, Marc R. & Vandaele, Nico J., 1996. "A general approximation for the single product lot sizing model with queueing delays," European Journal of Operational Research, Elsevier, vol. 95(1), pages 73-88, November.
    4. Ching, Chung Yaw & Liao, Ching-Jong & Wu, Chutao John, 1997. "Batching to minimize total production time for two part types," International Journal of Production Economics, Elsevier, vol. 48(1), pages 63-72, January.
    5. Mor, Baruch & Mosheiov, Gur, 2014. "Batch scheduling with a rate-modifying maintenance activity to minimize total flowtime," International Journal of Production Economics, Elsevier, vol. 153(C), pages 238-242.
    6. Julia Pahl & Stefan Voß & David Woodruff, 2007. "Production planning with load dependent lead times: an update of research," Annals of Operations Research, Springer, vol. 153(1), pages 297-345, September.

    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:35:y:1989:i:5:p:607-613. 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.