An MIP-based heuristic approach to determine production lot size for capacitated single-stage production processes with stochastic demand on parallel machines

Supatchaya Chotayakul, V. Punyangarm
{"title":"An MIP-based heuristic approach to determine production lot size for capacitated single-stage production processes with stochastic demand on parallel machines","authors":"Supatchaya Chotayakul, V. Punyangarm","doi":"10.1109/ICITM.2017.7917898","DOIUrl":null,"url":null,"abstract":"This paper deals with the capacitated single-stage production lot sizing and scheduling problem with multiple items, setup time, stochastic demand and unrelated parallel machines. A stochastic mixed-integer linear programming model is proposed to formulate the problem. Based on the uncertain constraints, the chance constrained programming approach is used to transform them into equivalent deterministic constraints and then obtain an optimal solution by deterministic mixed-integer linear programming model. Due to the complexity of problem, the mixed-integer programming (MIP) of the equivalence deterministic model of the capacitated single-stage production lot sizing problem with multiple items, setup time, stochastic demand and unrelated parallel machines is reformulated as a shortest path reformulation problem. The proposed algorithm is evaluated through a numerical example. Computational results show that the proposed method gives optimal or near optimal solution and have good-quality result for the test problem.","PeriodicalId":340270,"journal":{"name":"2017 6th International Conference on Industrial Technology and Management (ICITM)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 6th International Conference on Industrial Technology and Management (ICITM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICITM.2017.7917898","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

This paper deals with the capacitated single-stage production lot sizing and scheduling problem with multiple items, setup time, stochastic demand and unrelated parallel machines. A stochastic mixed-integer linear programming model is proposed to formulate the problem. Based on the uncertain constraints, the chance constrained programming approach is used to transform them into equivalent deterministic constraints and then obtain an optimal solution by deterministic mixed-integer linear programming model. Due to the complexity of problem, the mixed-integer programming (MIP) of the equivalence deterministic model of the capacitated single-stage production lot sizing problem with multiple items, setup time, stochastic demand and unrelated parallel machines is reformulated as a shortest path reformulation problem. The proposed algorithm is evaluated through a numerical example. Computational results show that the proposed method gives optimal or near optimal solution and have good-quality result for the test problem.
基于mip的并行随机需求单阶段生产过程生产批量确定方法
研究了具有多产品、生产时间、随机需求和不相关并联设备的单阶段生产批量调度问题。提出了一个随机混合整数线性规划模型来描述该问题。在不确定约束的基础上,利用机会约束规划方法将不确定约束转化为等价的确定性约束,然后利用确定性混合整数线性规划模型求最优解。考虑到问题的复杂性,将具有多产品、设置时间、随机需求和不相关并联机器的有能力单阶段生产批量问题等效确定性模型的混合整数规划(MIP)重新表述为最短路径重新表述问题。通过一个算例对该算法进行了验证。计算结果表明,该方法对试验问题具有较好的最优或近似最优解。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信