Batching to Minimize Flow Times on One Machine

Gregory Dobson, Uday S. Karmarkar and Jeffrey L. Rummel
Additional contact information
Gregory Dobson: Graduate School of Management, University of Rochester, Rochester, New York 14627
Uday S. Karmarkar: Graduate School of Management, University of Rochester, Rochester, New York 14627
Jeffrey L. Rummel: Fuqua School of Business, Duke University, Durham, North Carolina 27706

Management Science, 1987, vol. 33, issue 6, 784-799

Abstract: Machine sequencing formulations typically assume that the characteristics of the job set to be processed are given. However, in many applications, jobs can be batched in different ways. Two types of minimum flow-time sequencing problems with lot sizing are formulated. The "item-flow" formulation is solved giving an index rule for ordering items. The "batch-flow" formulation is solved for the single product case showing that processing is done in unequal batches ordered in decreasing size. Heuristics and bounds are provided for the multiproduct case.

Keywords: production/scheduling; lot-sizing: closed shop; deterministic models (search for similar items in EconPapers)
Date: 1987
References: Add references at CitEc
Citations: View citations in EconPapers (20)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.33.6.784 (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:33:y:1987:i:6:p:784-799

Access Statistics for this article

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