Batching to Minimize Flow Times on Parallel Heterogeneous Machines

Gregory Dobson, Uday S. Karmarkar and Jeffrey L. Rummel
Additional contact information
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

Management Science, 1989, vol. 35, issue 5, 607-613

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.

Keywords: batching; and; allocation; rules; for; parallel; machines (search for similar items in EconPapers)
Date: 1989
References: Add references at CitEc
Citations: View citations in EconPapers (6)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.35.5.607 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:35:y:1989:i:5:p:607-613

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().