• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>IIE Annual Conference Exposition >A Combinatorial Optimization Model for Group Buying in Supply Chains
【24h】

A Combinatorial Optimization Model for Group Buying in Supply Chains

机译：供应链中群体购买组合优化模型

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Group-buying is a supply chain business process that brings small businesses together to increase their buying power. This paper provides a mathematical programming model for group-buying in a B2B framework for combinatorial reverse auctions. The objective is to identify the winning suppliers and the procurement quantities such that total procurement cost is minimal while the customer demand is met and additional business requirements such as the approved vendor list are satisfied. It is shown that the problem is NP-hard. Numerical computations are run to gain further insight about the group buying problem.
机译：集团购买是一种供应链业务流程，使小企业共同增加购买力。本文为B2B框架中的组建组合框架进行了数学编程模型，用于组合反向拍卖。目标是识别获胜供应商和采购量，使得总采购成本最小，而达到客户需求，并满足批准的供应商列表等额外的业务需求。结果表明，问题是NP - 硬。运行数值计算以增加对群组购买问题的进一步洞察力。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号