Enhancing production efficiency through integer linear programming-based production planning

Saurabh Chaudhary, Sushant Raj Giri
{"title":"Enhancing production efficiency through integer linear programming-based production planning","authors":"Saurabh Chaudhary, Sushant Raj Giri","doi":"10.3126/joeis.v3i1.63469","DOIUrl":null,"url":null,"abstract":"The management of a manufacturing plant's primary duties include the efficient planning, scheduling, and synchronization of all production activities. As a result, the management of the plant must design the manufacturing process to minimize the overall production cost, taking into account the resources that cannot be compromised. In this study, Shree Pashupati Biscuit Industries Pvt. Ltd. is chosen, and an integer linear programming (ILP) model is developed to predict the total number of batches that the facility should make each month from each product in order to meet the monthly demand with the resources at hand. The goal is to reduce the plant's monthly production costs. After a month of collecting the necessary data from the manufacturing facility, the goal function and restrictions were developed. In order to ensure that no consumer is dissatisfied, the management has placed a high priority on meeting demand. Any workable solution discovered by the model must meet the demand in accordance with the managerial need. Demand constraint is therefore seen as a harsh limitation. According to the monthly demand, the management is compelled to alter the labor and machine requirements more regularly. Therefore, labor and machine hour restrictions are regarded as mild restrictions. The simulated ILP model was constructed as an Excel spreadsheet model, and it was then solved using Excel Solver, which applies the simplex approach and takes into account the model's requirement for integers. Until a workable solution is identified, the total number of hours of labor and machine availability can be altered within a specific range. The number of batches to be produced from each product and the accompanying minimal monthly cost are determined by the solved model. This production strategy uses both the physical and human resources in the best possible way by preventing the manufacturing of surplus biscuits. The solution can also be used to calculate the required extra hours, machine and labor idle times, and additional overtime costs, which are then added to the monthly production costs.","PeriodicalId":111997,"journal":{"name":"Journal of Engineering Issues and Solutions","volume":"109 42","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Engineering Issues and Solutions","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3126/joeis.v3i1.63469","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

The management of a manufacturing plant's primary duties include the efficient planning, scheduling, and synchronization of all production activities. As a result, the management of the plant must design the manufacturing process to minimize the overall production cost, taking into account the resources that cannot be compromised. In this study, Shree Pashupati Biscuit Industries Pvt. Ltd. is chosen, and an integer linear programming (ILP) model is developed to predict the total number of batches that the facility should make each month from each product in order to meet the monthly demand with the resources at hand. The goal is to reduce the plant's monthly production costs. After a month of collecting the necessary data from the manufacturing facility, the goal function and restrictions were developed. In order to ensure that no consumer is dissatisfied, the management has placed a high priority on meeting demand. Any workable solution discovered by the model must meet the demand in accordance with the managerial need. Demand constraint is therefore seen as a harsh limitation. According to the monthly demand, the management is compelled to alter the labor and machine requirements more regularly. Therefore, labor and machine hour restrictions are regarded as mild restrictions. The simulated ILP model was constructed as an Excel spreadsheet model, and it was then solved using Excel Solver, which applies the simplex approach and takes into account the model's requirement for integers. Until a workable solution is identified, the total number of hours of labor and machine availability can be altered within a specific range. The number of batches to be produced from each product and the accompanying minimal monthly cost are determined by the solved model. This production strategy uses both the physical and human resources in the best possible way by preventing the manufacturing of surplus biscuits. The solution can also be used to calculate the required extra hours, machine and labor idle times, and additional overtime costs, which are then added to the monthly production costs.
通过基于整数线性规划的生产规划提高生产效率
制造工厂管理层的主要职责包括有效规划、安排和同步所有生产活动。因此,工厂管理层在设计生产流程时,必须考虑到不能妥协的资源,使总体生产成本最小化。本研究选择了 Shree Pashupati Biscuit Industries Pvt. Ltd.,并开发了一个整数线性规划(ILP)模型,以预测工厂每月应生产的每种产品的总批次数,从而利用现有资源满足每月的需求。目标是降低工厂的月生产成本。经过一个月从生产工厂收集必要数据的工作,目标函数和限制条件得以制定。为了确保没有消费者不满意,管理层高度重视满足需求。模型发现的任何可行方案都必须符合管理需要,满足需求。因此,需求约束被视为一种苛刻的限制。根据每月的需求量,管理层不得不更有规律地改变劳动力和机器需求。因此,劳动力和机器工时限制被视为温和的限制。模拟 ILP 模型以 Excel 电子表格模型的形式构建,然后使用 Excel 求解器求解,该求解器采用单纯形方法,并考虑到了模型对整数的要求。在找到可行的解决方案之前,可以在特定范围内改变总工时数和机器可用性。每种产品的生产批量和相应的最低月成本由求解模型决定。这种生产策略可以最大限度地利用物力和人力资源,避免生产出过剩的饼干。该解决方案还可用于计算所需的额外工时、机器和劳动力闲置时间以及额外的加班费用,然后将其计入每月生产成本。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信