A Mathematical Model for Determining the Optimal Production Lot Size of Multiple Products on a Machine

Journal of Modern Processes in Manufacturing and Production

مقاله 6، دوره 8، شماره 4، بهمن 2019، صفحه 67-75   

نوع مقاله: Research Paper

نویسنده

Ayub Rahimzadeh^*

Department of Industrial Engineering, College of Engineering, Kermanshah Branch, Islamic Azad University, Kermanshah, Iran

چکیده

In this research, the production of multi-products using one machine is investigated in continuous time. The machine has limited capacity and can produce only one product at any time. To change the product, the machine should be set up. Due to the difference in demand for products, there is no need to equate the number of machine start-ups for these products, by removing this constraint, a nonlinear mathematical model is presented that gives the optimal production lot size for each product. To solve the single-constraint nonlinear model, the Lagrange method is used. For a numerical example, the obtained solution is compared with the method of rotating a constant cycle. Due to the total cost, the solution was better than the solution of the rotation cycle method. Also, contrary to the rotation cycle method, the total holding cost is equal to the total setup costs, which is similar to the Wilson inventory basic formula.

کلیدواژه‌ها

Production Lot Size؛ Continuous Time؛ One Machine؛ Multi-product

مراجع

[1] Holmbom, M. 2013.  A solution procedure for economic lot scheduling problems even in high utilisation facilities. International Journal of Production Research. 51(12):3765-3777.

[2] Gallego, G., and Shaw, D. X. 1997. Complexity of the ELSP with general cyclic schedules. IIE Transactions. 29 (2): 109–113.

[3] E. W. Taft. The most economical production lot. The Iron Age. 1918. 101:1410-1412.

[4] Pentico, D.W. and Drake, M.J. 2011. A survey of deterministic models for the EOQ and EPQ with partial backordering. European Journal of Operational Research. 214:179-198.

[5] Goyal, S.K. 1973. Lot size scheduling on a single machine for stochastic demand. Management Science. 19(11):1322-1325.

[6] Kono Hirokazu,. 1994. A Singl-machine multi-product lot scheduling problem with consideration of product-dependent transportation. Journal of the Operations Research Society of Japan, 37(2):133-157.

[7] Hodgson, J.T., Ge G., King, R.E. and Said H. 1997. Dynamic lot size/sequencing policies in a multi-product, single-machine system.  IIE Transactions. 29(2):127-137.

[8] Khoury, B.N., Abboud, N.E. and Tannous, M.M. 2001. The common cycle approach to the ELSP problem with insufficient capacity. International Journal of Production Economics. 73(2):189-199.

[9] Cooke, D.L., Rohleder, T.R. and Silver, E.A. 2004. Finding effective schedules for the economic lot scheduling problem: A simple mixed integer programming approach. International Journal of Production Research, 42(1):21-36.

[10] Yao, M.J. 2005. The economic lot scheduling problem without capacity constraints. Annals of Operations Research. 133(1-4):193-205.

[11] Leven, E. and Segerstedt, A. 2007. A scheduling policy for adjusting economic lot quantities to a feasible solution. European Journal of Operational Research. 179(2):414-423.

[12] Nilsson, K. and Segerstedt, A. 2008. Corrections of costs to feasible solutions of economic lot scheduling problems. Computers & Industrial Engineering. 54(1):155-168.

[13] Brander, P. and Segerstedt, A. 2009. Economic lot scheduling problems incorporating a cost of using the production facility. International Journal of Production Research. 47(13):3611-3624.

[14] Sun, H., Huang, HC. and Jaruphongsa, W. 2010. The economic lot scheduling problem under extended basic period and power-of-two policy. Optimization Letters, 4(2):157-172.

[15] Chan, H.K., Chung, S.H. 2010. Genetic Approach to Solve Economic Lot-Scheduling Problem. Proceedings of the 6^th CIRP-Sponsored International Conference on Digital Enterprise Technology. Advances in Intelligent and Soft Computing, Springer, Berlin, Heidelberg.

[16] Gabay, M., Grigoriev, A., Kreuzen, V.J.C. and Oosterwijk, T. 2014. High multiplicity scheduling with switching costs for few products. Operations Research Proceedings. 437-443.

[17] Ilic, O. and Radovic, M. 2011. Models for the production runs for multiple products in flexible manufacturing system. Yugoslav Journal of Operations Research. 21(2):307-324.

[18] Al-Salamah, Muhammad. 2018. Economic production quantity with the presence of imperfect quality and random machine breakdown and repair based on the artificial bee colony heuristic. Applied Mathematical Modelling. 63:68-83.

[19] Zhang, E., Liu, Ming. , Zheng, Feifeng , and Xu, Yinfeng. 2019. Single machine lot scheduling to minimize the total weighted (discounted) completion time. Information Processing Letters. 142:46-51.

[20] Zheng, F. and Jin, K. 2019. An improved heuristic for single machine lot Scheduling problem. IFAC-Papers On Line. 52(13):217-222.

[21] Rios-Solis, Y., J. Ibarra-Rojas, O., Cabo, M. and Possani, E. 2020. A heuristic based on mathematical programming for a lot-sizing and scheduling problem in mold-injection production. European Journal of Operational Research. 284(3):861-873.

[22] Johnson, L.A. and Montgomery, D.C. 1974. Operations Research in Production Planning, Scheduling, and Inventory Control. John Wiley & Sons.