工件相同且发送批数受限的供应链排序问题
DOI:
作者:
作者单位:

作者简介:

通讯作者:

中图分类号:

基金项目:


Supply Chain Scheduling with Same Jobs Based on Limited Delivery Times
Author:
Affiliation:

Fund Project:

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

    工件完工后成批发送的供应链排序问题是从实际生产中提炼出来的,针对发送批数受限制,最小化生产费用及发送费用的情况,当工件的权重与加工时间均相等时,生产费用是关于发送批数的单调递减函数,进而根据二分搜索法可以得到最优的发送批数。因此问题是多项式时间可解的。

    Abstract:

    This paper considers several scheduling problems where deliveries are made in batches with each batch delivered to the customer in a single shipment. Various scheduling costs, which are based on the limited delivery times of the jobs, are considered. The objective is to minimize the scheduling cost plus the delivery cost. When the jobs are same, with same processing time and same weight, production costs is decreasing function on the delivery times, but delivery cost is increasing function on the delivery times. Therefore, binary search is used to find the optimal delivery times, and the problem can be solved in polynomial times.

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

范静. 工件相同且发送批数受限的供应链排序问题[J]. 科学技术与工程, 2011, (33): .
fanjing. Supply Chain Scheduling with Same Jobs Based on Limited Delivery Times[J]. Science Technology and Engineering,2011,(33).

复制
分享
文章指标
  • 点击次数:
  • 下载次数:
  • HTML阅读次数:
  • 引用次数:
历史
  • 收稿日期:2011-09-05
  • 最后修改日期:2011-09-05
  • 录用日期:2011-09-13
  • 在线发布日期: 2011-10-24
  • 出版日期:
×
律回春渐,新元肇启|《科学技术与工程》编辑部恭祝新岁!
亟待确认版面费归属稿件,敬请作者关注