针对轮胎养护调度问题的一种MILP公式

Héctor Cancela , Pedro Piñeyro, Joaquín Velázquez
{"title":"针对轮胎养护调度问题的一种MILP公式","authors":"Héctor Cancela ,&nbsp;Pedro Piñeyro,&nbsp;Joaquín Velázquez","doi":"10.1016/j.endm.2018.07.009","DOIUrl":null,"url":null,"abstract":"<div><p>In this paper we consider the scheduling problem of the curing process for a tire factory. The objective is to determine the minimum makespan in order to meet the demand requirements of different tires, restricted by the number of parts, molds and heaters and allowed combinations of mold-mold and mold-heater. We provide a mixed-integer linear programming (MILP) for the problem and two different rules or estimators for determining an upper bound value of the planning horizon, needed for solving the model. In order to evaluate the suggested estimators, we carry out some numerical experiments over ten different instances based on real data. From the results of these numerical experiments we can conclude that the tightness of estimators have a significant impact on the resolution time of the model.</p></div>","PeriodicalId":35408,"journal":{"name":"Electronic Notes in Discrete Mathematics","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.endm.2018.07.009","citationCount":"2","resultStr":"{\"title\":\"A MILP formulation for a tire curing scheduling problem\",\"authors\":\"Héctor Cancela ,&nbsp;Pedro Piñeyro,&nbsp;Joaquín Velázquez\",\"doi\":\"10.1016/j.endm.2018.07.009\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>In this paper we consider the scheduling problem of the curing process for a tire factory. The objective is to determine the minimum makespan in order to meet the demand requirements of different tires, restricted by the number of parts, molds and heaters and allowed combinations of mold-mold and mold-heater. We provide a mixed-integer linear programming (MILP) for the problem and two different rules or estimators for determining an upper bound value of the planning horizon, needed for solving the model. In order to evaluate the suggested estimators, we carry out some numerical experiments over ten different instances based on real data. From the results of these numerical experiments we can conclude that the tightness of estimators have a significant impact on the resolution time of the model.</p></div>\",\"PeriodicalId\":35408,\"journal\":{\"name\":\"Electronic Notes in Discrete Mathematics\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1016/j.endm.2018.07.009\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Electronic Notes in Discrete Mathematics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S1571065318301537\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"Mathematics\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Electronic Notes in Discrete Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1571065318301537","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"Mathematics","Score":null,"Total":0}
引用次数: 2

摘要

本文研究了某轮胎厂固化过程的调度问题。目标是确定最小的完工时间,以满足不同轮胎的需求,受限于零件、模具和加热器的数量,并允许模具-模具和模具-加热器的组合。我们为该问题提供了一个混合整数线性规划(MILP)和两个不同的规则或估计来确定求解模型所需的规划水平的上界值。为了评估所建议的估计量,我们基于实际数据进行了十多个不同实例的数值实验。从这些数值实验的结果可以得出结论,估计器的紧密性对模型的分辨时间有显著的影响。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A MILP formulation for a tire curing scheduling problem

In this paper we consider the scheduling problem of the curing process for a tire factory. The objective is to determine the minimum makespan in order to meet the demand requirements of different tires, restricted by the number of parts, molds and heaters and allowed combinations of mold-mold and mold-heater. We provide a mixed-integer linear programming (MILP) for the problem and two different rules or estimators for determining an upper bound value of the planning horizon, needed for solving the model. In order to evaluate the suggested estimators, we carry out some numerical experiments over ten different instances based on real data. From the results of these numerical experiments we can conclude that the tightness of estimators have a significant impact on the resolution time of the model.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Electronic Notes in Discrete Mathematics
Electronic Notes in Discrete Mathematics Mathematics-Discrete Mathematics and Combinatorics
CiteScore
1.30
自引率
0.00%
发文量
0
期刊介绍: Electronic Notes in Discrete Mathematics is a venue for the rapid electronic publication of the proceedings of conferences, of lecture notes, monographs and other similar material for which quick publication is appropriate. Organizers of conferences whose proceedings appear in Electronic Notes in Discrete Mathematics, and authors of other material appearing as a volume in the series are allowed to make hard copies of the relevant volume for limited distribution. For example, conference proceedings may be distributed to participants at the meeting, and lecture notes can be distributed to those taking a course based on the material in the volume.
期刊最新文献
Preface Minimal condition for shortest vectors in lattices of low dimension Enumerating words with forbidden factors Polygon-circle and word-representable graphs On an arithmetic triangle of numbers arising from inverses of analytic functions
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1