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}
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.