DETERMINING OPTIMAL FLOW-TIME SCHEDULES FOR THE MULTIPLE-PRODUCT BATCH-FLOW PROBLEM

Paul Schikora, Andrew Manikas and Michael Godfrey

International Journal of Management and Marketing Research, 2015, vol. 8, issue 2, 19-35

Abstract: We explore the problem of batch flow production scheduling on a single machine with deterministic demand and arrivals over a finite horizon. The objective of the production system is to minimize total flow-time over the horizon to reduce in-process inventory levels and to enable a company to compete on reduced leadtimes. Prior research has established optimal single job batch quantities. However, with multiple jobs on the shop floor, a job may incur wait time, thus the optimal local batch size for a given job may not result in global minimization of the total flow-time over all jobs. Our algorithm provides optimal results for batching with different products in a capacitated production environment. Numerous recommendations for further research are presented

Keywords: Scheduling; Single Machine; Batch; Flow-Time; Lead-Time (search for similar items in EconPapers)
JEL-codes: M11 (search for similar items in EconPapers)
Date: 2015
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.theibfr2.com/RePEc/ibf/ijmmre/ijmmr-v8n2-2015/IJMMR-V8N2-2015-2.pdf (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:ibf:ijmmre:v:8:y:2015:i:2:p:19-35

Access Statistics for this article

International Journal of Management and Marketing Research is currently edited by Terrance Jalbert

More articles in International Journal of Management and Marketing Research from The Institute for Business and Finance Research
Bibliographic data for series maintained by Mercedes Jalbert ( this e-mail address is bad, please contact ).