家电制造工厂产品运输和临时储存成本的最小化

Shan Zeng, Yan Qiao, SiWei Zhang, Jie Li, N. Wu, Bin Liu
{"title":"家电制造工厂产品运输和临时储存成本的最小化","authors":"Shan Zeng, Yan Qiao, SiWei Zhang, Jie Li, N. Wu, Bin Liu","doi":"10.1109/ICNSC52481.2021.9702188","DOIUrl":null,"url":null,"abstract":"In home appliances manufacturing factories, the cycle time of a certain type of products is deterministic such that the daily outputs of such products are fixed. If the completed products are not delivered out of the factory in time, the warehouse in the factory cannot hold all completed products since its capacity is limited. This work focuses on a factory for which the completed products should be delivered out of the factory to a warehouse at a harbor for temporary storage and then shipped abroad. This results in a cost for the product transportation from the warehouse in the factory to the one at the harbor as well as a storage cost for the warehouse at the harbor. This work aims at finding out a schedule for product transportation with the objective of minimizing the total cost. To do so, a periodical scheduling method is proposed for the product transportation. Based on the scheduling method, a mathematical programming model is established to minimize the total cost for the product transportation. Finally, an actual case study is given to show the applicability of the proposed method.","PeriodicalId":129062,"journal":{"name":"2021 IEEE International Conference on Networking, Sensing and Control (ICNSC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Minimization of Product Transportation and Temporary Storage Costs for Home Appliances Manufacturing Factories\",\"authors\":\"Shan Zeng, Yan Qiao, SiWei Zhang, Jie Li, N. Wu, Bin Liu\",\"doi\":\"10.1109/ICNSC52481.2021.9702188\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In home appliances manufacturing factories, the cycle time of a certain type of products is deterministic such that the daily outputs of such products are fixed. If the completed products are not delivered out of the factory in time, the warehouse in the factory cannot hold all completed products since its capacity is limited. This work focuses on a factory for which the completed products should be delivered out of the factory to a warehouse at a harbor for temporary storage and then shipped abroad. This results in a cost for the product transportation from the warehouse in the factory to the one at the harbor as well as a storage cost for the warehouse at the harbor. This work aims at finding out a schedule for product transportation with the objective of minimizing the total cost. To do so, a periodical scheduling method is proposed for the product transportation. Based on the scheduling method, a mathematical programming model is established to minimize the total cost for the product transportation. Finally, an actual case study is given to show the applicability of the proposed method.\",\"PeriodicalId\":129062,\"journal\":{\"name\":\"2021 IEEE International Conference on Networking, Sensing and Control (ICNSC)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-12-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 IEEE International Conference on Networking, Sensing and Control (ICNSC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICNSC52481.2021.9702188\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 IEEE International Conference on Networking, Sensing and Control (ICNSC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICNSC52481.2021.9702188","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

在家电制造工厂中,某类产品的生产周期是确定的,因此该类产品的日产量是固定的。如果成品不能及时出库,工厂仓库的容量有限,无法容纳所有的成品。这项工作的重点是一个工厂,完成的产品应该从工厂交付到一个港口的仓库临时储存,然后运往国外。这就产生了产品从工厂仓库到港口仓库的运输成本,以及港口仓库的存储成本。这项工作的目的是找出一个时间表的产品运输的目标,使总成本最小。为此,提出了产品运输的周期调度方法。在此基础上,建立了以产品运输总成本最小为目标的数学规划模型。最后,给出了一个实际的案例分析,说明了所提方法的适用性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Minimization of Product Transportation and Temporary Storage Costs for Home Appliances Manufacturing Factories
In home appliances manufacturing factories, the cycle time of a certain type of products is deterministic such that the daily outputs of such products are fixed. If the completed products are not delivered out of the factory in time, the warehouse in the factory cannot hold all completed products since its capacity is limited. This work focuses on a factory for which the completed products should be delivered out of the factory to a warehouse at a harbor for temporary storage and then shipped abroad. This results in a cost for the product transportation from the warehouse in the factory to the one at the harbor as well as a storage cost for the warehouse at the harbor. This work aims at finding out a schedule for product transportation with the objective of minimizing the total cost. To do so, a periodical scheduling method is proposed for the product transportation. Based on the scheduling method, a mathematical programming model is established to minimize the total cost for the product transportation. Finally, an actual case study is given to show the applicability of the proposed method.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信