MINIMIZING PROCESS LEAD TIME FOR A SINGLE MACHINE USING THE DEVELOPED OPTIMAL BATCH SIZE EQUATIONS
Manufacturing with an optimal batch size can significantly increase production performance. In the past, complicated techniques such as optimization models, simulation, queuing theory, and complex algorithms had been explored to solve for the optimal batch size. By applying those techniques, some customizations are needed when production factors such as demands and capacity change. It is even more difficult for a plant manager to customize the model when producing more than one type of products in a single machine. In the previous research studies, none of researchers proposed the equations that a plant manager can just put the numbers into and get the optimal solution. Therefore, the developed closed-form optimal batch size equations are proposed in this research. The formula can be easily used to assess the impact of changes in production volume. The purpose is to minimize process lead time. The developed optimal batch size equation can be applied to estimate the process lead time associated with the size of the batch when the demand is given. This research provides an illustration of proposed method with various parameters applied to different products. The optimal batch size is solved and the result verifies the effectiveness of the approach.
G.R. Parija and B. R. Sarker, “Operations planning in a supply chain system with fixed-interval deliveries of finished goods to multiple customers”, IIE Transactions, vol. 31, no. 11, pp. 1075-1082, 1999.
H. Wang and Y. Chen, “Mathematical model with simulation to find the optimal batch size for a supply chain system”, Journal of the Chinese Institute of Industrial Engineers, vol. 22, no. 3, pp. 262-271, 2005.
J.W.M. Bertrand, “Multiproduct optimal batch sizes with in-process inventories and multi work centers”, IIT Transaction, vol. 17, no. 2, pp. 157-163, 1985.
S. Wang and B.R. Sarker, “A single-stage supply chain system controlled by Kanban under just-in-time philosophy”, Journal of the Operational Research Society, vol. 55, no. 5, pp. 485-494, 2004.
D. Ojha, B.R. Sarker and P. Biswas, “An optimal batch size for an imperfect production system with quality assurance and rework”, International Journal of Production Research, vol. 45, no. 14, pp. 3191-3214, 2007.
H. Rau and B.C. OuYang, “An optimal batch size for integrated production-inventory policy in supply chain”, European Journal of Operational Research, vol. 185, no. 2, pp. 619-634, 2004.
F.J.P. Tielemans and R. Kuik, “An exploration of models that minimize leadtime through batching of arrived orders”, European Journal of Operational Research, vol. 95, no. 2, pp. 374-389, 1996.
V. Sohner and C. Schneeweiss, “Hierarchically integrated lot size optimization”, European Journal of Operational Research, vol. 86, no. 1, pp. 73-90, 1995.
J.J. Solberg, “CAN-Q User's Guide,” School of Industrial Engineering, Purdue University, West Lafayette, Indiana, Report No. 9, 1980.
J.G. Shanthickumar and J.A. Buzacott, “Open queuing network models of dynamic job shops”, International Journal of Production Research, vol. 19, no. 3, pp. 255–266, 1981.
W. Whitt, “The queuing network analyzer”, The Bell System Technical Journal, vol. 62, no. 9, pp. 2779–2815, 1983.
U.S. Karmarkar, “Lot sizes, lead time and in-process inventories”, Management Science, vol. 33, no. 3, pp. 409–418, 1987.
D. Shin , J. Park , N. Kim and R.A. Wysk, “A stochastic model for the optimal batch size in multi-step operations with process and product variability”, International Journal of Production Research, vol. 47, no. 14, pp. 3919-3936, 2009.
H.H. Millar and T. Yang, “Batch sizes and lead-time performance in flexible manufacturing systems”, International Journal of Flexible Manufacturing Systems, vol. 8, no. 1, pp. 5-21, 1996.
P.H. Koo, R. Bulfin and S.G. Koh, “Determination of batch size at a bottleneck machine in manufacturing systems”, International Journal of Production Research, vol. 45, no. 5, pp. 1215-1231, 2007.
G. Wang, T. Liang and W. Song, “A chaotic-search-based self-organizing optimization approach for multistage batch scheduling problem,”, in Proceedings of the 32nd Chinese Control Conference, Xi'an, China, 2013, pp. 8441-8445.
L. Yang, H. P. Pan and Y. B. Zhang, “Comprehensive optimization of batch process based on particle swarm optimization algorithm”, in Proceedings of the 29th Chinese Control And Decision Conference, Chongqing, China, 2017, pp. 4504-4508.
M.G. Calkin, Lagrangian and Hamiltonian Mechanics. Singapore: World Scientific Publishing, 1996.
Authors who publish with this journal agree to the following terms:
- Authors transfer copyright to the publisher as part of a journal publishing agreement with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) after the manuscript is accepted, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).