供应链协商调度模型与算法
作者:
作者单位:

作者简介:

通讯作者:

中图分类号:

基金项目:

国家自然科学基金(60904072); 广东省教育部省部产学研结合项目(2010B090400028); 国家教育部博士点新教师基金(20090185120002); 国家教育部人文社科青年基金(09YJC630018); 电子科技大学中央高校基本科研业务经费(103.1.2E022050205)


Negotiated Scheduling Model and Algorithms of Supply Chain
Author:
Affiliation:

Fund Project:

  • 摘要
  • |
  • 图/表
  • |
  • 访问统计
  • |
  • 参考文献
  • |
  • 相似文献
  • |
  • 引证文献
  • |
  • 资源附件
  • |
  • 文章评论
    摘要:

    研究了由一个制造商和一个分销商组成的供应链上分销商协商调度问题.此供应链中,制造商比分销商有更强的影响力,先于分销商进行调度.制造商与分销商之间不共享作业处理时间.为了改善分销商调度,建立了基于补偿的分销商协商模型,设计了保留信息私有性的协商调度策略,提出并分析了协商调度下制造商调度算法以及基于生态种群竞争的分销商协同演化调度算法.仿真实验结果表明,分销商协商调度模型与算法能够有效改善分销商调度性能,在不增加制造商调度成本的条件下,可最大程度地削减分销商调度成本超过25%.此外,提出的竞争协同演化算法能够获得比遗传算法、粒子群算法和蚁群算法更好的调度解.

    Abstract:

    The negotiated scheduling problem of distributor is studied for a supply chain that consists of a manufacture and a distributor. The manufacturer is more influential than the distributor. It makes scheduling decisions followed by the distributor. The manufacture and distributor do not share information during the process time of any job. To improve scheduling results of the distributor, a negotiation model is built based on compensation mechanism. A negotiated scheduling strategy with information privacy is designed. A distributor negotiation-scheduling algorithm that consists of a scheduling algorithm of the manufacturer and ecologic population competition based coevolutionary algorithm of the distributor is designed and analyzed. Simulation experiments show that the negotiated scheduling of the distributor can effectively improve the scheduling performance of the distributor. Scheduling cost of the distributor can be cut down over 25% while the scheduling performance of the manufacturer does not become worse. Moreover, the proposed coevolutionary algorithm can obtain better scheduling solutions than the genetic, particle swarm optimization, and ant colony optimization algorithms.

    参考文献
    相似文献
    引证文献
引用本文

苏生,于海杰,吴正华,汤羽.供应链协商调度模型与算法.软件学报,2013,24(1):12-24

复制
分享
文章指标
  • 点击次数:
  • 下载次数:
  • HTML阅读次数:
  • 引用次数:
历史
  • 收稿日期:2011-09-21
  • 最后修改日期:2012-03-27
  • 录用日期:
  • 在线发布日期: 2012-12-29
  • 出版日期:
文章二维码
您是第位访问者
版权所有:中国科学院软件研究所 京ICP备05046678号-3
地址:北京市海淀区中关村南四街4号,邮政编码:100190
电话:010-62562563 传真:010-62562533 Email:jos@iscas.ac.cn
技术支持:北京勤云科技发展有限公司

京公网安备 11040202500063号