多站点供应链的可用性-承诺模型

Wen Yang, R. Fung
{"title":"多站点供应链的可用性-承诺模型","authors":"Wen Yang, R. Fung","doi":"10.1109/ICAL.2012.6308173","DOIUrl":null,"url":null,"abstract":"Available-to-promise (ATP) as a means for management of customer demands, production scheduling and the available resource has to make three main decisions: order acceptance/selection, due date assignment, and order scheduling. This research integrates the three decision-making mechanisms. A mixed integer nonlinear programming model of ATP problem is proposed to maximize the profit while satisfying customer orders at required time horizon over a multi-site supply chain scope. In order to improve efficiency, a branch-and-price approach is adopted to solve this model.","PeriodicalId":373152,"journal":{"name":"2012 IEEE International Conference on Automation and Logistics","volume":"63 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Available-to-promise model for a multi-site supply chain\",\"authors\":\"Wen Yang, R. Fung\",\"doi\":\"10.1109/ICAL.2012.6308173\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Available-to-promise (ATP) as a means for management of customer demands, production scheduling and the available resource has to make three main decisions: order acceptance/selection, due date assignment, and order scheduling. This research integrates the three decision-making mechanisms. A mixed integer nonlinear programming model of ATP problem is proposed to maximize the profit while satisfying customer orders at required time horizon over a multi-site supply chain scope. In order to improve efficiency, a branch-and-price approach is adopted to solve this model.\",\"PeriodicalId\":373152,\"journal\":{\"name\":\"2012 IEEE International Conference on Automation and Logistics\",\"volume\":\"63 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-09-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 IEEE International Conference on Automation and Logistics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICAL.2012.6308173\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 IEEE International Conference on Automation and Logistics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICAL.2012.6308173","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

可用性承诺(ATP)作为管理客户需求、生产调度和可用资源的手段,必须做出三个主要决策:订单接受/选择、截止日期分配和订单调度。本研究整合了三种决策机制。为了在多站点供应链范围内满足客户要求的时间范围内实现利润最大化,提出了ATP问题的混合整数非线性规划模型。为了提高效率,采用分支-价格方法求解该模型。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Available-to-promise model for a multi-site supply chain
Available-to-promise (ATP) as a means for management of customer demands, production scheduling and the available resource has to make three main decisions: order acceptance/selection, due date assignment, and order scheduling. This research integrates the three decision-making mechanisms. A mixed integer nonlinear programming model of ATP problem is proposed to maximize the profit while satisfying customer orders at required time horizon over a multi-site supply chain scope. In order to improve efficiency, a branch-and-price approach is adopted to solve this model.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信