利用对称破缺约束求解配送中心调度问题

2011 IEEE International Conference on Automation Science and Engineering Pub Date : 2011-10-13 DOI:10.1109/CASE.2011.6042498

M. P. Fanti, G. Stecco, W. Ukovich

{"title":"利用对称破缺约束求解配送中心调度问题","authors":"M. P. Fanti, G. Stecco, W. Ukovich","doi":"10.1109/CASE.2011.6042498","DOIUrl":null,"url":null,"abstract":"This paper deals with the problem of scheduling the internal operations in Distribution Centers (DC). Internal operations of the DC consist essentially in de-consolidating inbound cases, sorting products according to customer requests and consolidating outbound cases. The objective is to minimize the total operation time determining the optimal sequence of the internal operations.","PeriodicalId":236208,"journal":{"name":"2011 IEEE International Conference on Automation Science and Engineering","volume":"77 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Solving scheduling problems in distribution centers using symmetry breaking constraints\",\"authors\":\"M. P. Fanti, G. Stecco, W. Ukovich\",\"doi\":\"10.1109/CASE.2011.6042498\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper deals with the problem of scheduling the internal operations in Distribution Centers (DC). Internal operations of the DC consist essentially in de-consolidating inbound cases, sorting products according to customer requests and consolidating outbound cases. The objective is to minimize the total operation time determining the optimal sequence of the internal operations.\",\"PeriodicalId\":236208,\"journal\":{\"name\":\"2011 IEEE International Conference on Automation Science and Engineering\",\"volume\":\"77 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-10-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 IEEE International Conference on Automation Science and Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CASE.2011.6042498\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 IEEE International Conference on Automation Science and Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CASE.2011.6042498","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

本文研究了配送中心内部作业的调度问题。DC的内部操作主要包括对入站案例进行拆包、根据客户要求对产品进行分类以及对出站案例进行整合。目标是最小化总操作时间，确定内部操作的最佳顺序。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

Solving scheduling problems in distribution centers using symmetry breaking constraints

This paper deals with the problem of scheduling the internal operations in Distribution Centers (DC). Internal operations of the DC consist essentially in de-consolidating inbound cases, sorting products according to customer requests and consolidating outbound cases. The objective is to minimize the total operation time determining the optimal sequence of the internal operations.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2011 IEEE International Conference on Automation Science and Engineering

自引率

0.00%

发文量