排序论文:单机供应链排序集成性研究.docVIP

排序论文:单机供应链排序集成性研究.doc

  1. 1、本文档共4页,可阅读全部内容。
  2. 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
  3. 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  4. 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
  5. 5、该文档为VIP文档,如果想要下载,成为VIP会员后,下载免费。
  6. 6、成为VIP后,下载本文档将扣除1次下载权益。下载后,不支持退款、换文档。如有疑问请联系我们
  7. 7、成为VIP后,您将拥有八大权益,权益包括:VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
  8. 8、VIP文档为合作方或网友上传,每下载1次, 网站将根据用户上传文档的质量评分、类型等,对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
排序论文:单机供应链排序集成性研究

排序论文:单机供应链排序集成性研究 【中文摘要】在生产和物流管理中,一个重要的问题是生产和运输之间的协调。要使供应链达到更好的运作绩效,生产和运输这两个环节必须集合在一起进行协调运作。本文研究单机供应链排序模型,加工工件首先在机器上加工,再立刻运送给顾客,不考虑库存,目标函数是找到一个好的平衡点,使得对顾客的服务水平及运输费用总和最优。顾客的服务水平由工件到达顾客的时间函数来刻画,本文选择用所有工件运送到客户的加权完工时间和来刻画;总的运输费用由固定费用和由车辆选择不同路线的可变费用构成。我们研究两类问题,一类是对运输车辆的数量不加限制,另一类则对运输车辆的数量进行限制。对于车辆数量无约束的情形,针对单客户和多客户两种情况,分别给出了动态规划求解方法,并给出了时间复杂度性分析。对于车辆数量有约束的情形,只对单客户的情况给出动态规划求解方法。 【英文摘要】One important issue in production and logistics management is the coordination of activities between production and delivery. In order to make the supply chain achieving good operation performance, the links of production and transportation must be coordinated together. In our research problem, we develop a single-machine scheduling model and the jobs are first processed in a processing facility and then delivered to the customers directly without intermediate inventory. The aim is to find a joint schedule of production and distribution such that an objective function that takes into account both customer service level and total distribution cost is optimized. Customer service level is measured by a function of the times when the jobs are delivered to the customers. In these models, customer service is measured by the sum of job weighted average time when the jobs are delivered to the customers. The distribution cost of a delivery shipment consists of a fixed charge and a variable cost proportional to the total distance of the route taken by the shipment. We study two classes of problems, In the first class of problems, the number of vehicles is unlimited; in the second class, the number of vehicles is limited. When the number of vehicles is unlimited, for the single customer and more customers situation, we give dynamic programming to solve them respectively,and then give the time complexity analysis. In the second case, we only give the dynamic programming method. 【关键词】排序 单机 供应链 动态规划 【英文关键词】scheduling single-machine supply chain dynamic programming 【目录】单机供应链排序集成性研究 摘要 5-6

您可能关注的文档

文档评论(0)

zhengshumian + 关注
实名认证
文档贡献者

该用户很懒,什么也没介绍

1亿VIP精品文档

相关文档