• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>International Journal of Computer Integrated Manufacturing >Supply chain scheduling with batching, production and distribution
【24h】

Supply chain scheduling with batching, production and distribution

机译：具有批处理，生产和分配的供应链计划

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

In this paper, the authors study a class of supply chain scheduling problems. The manufacturer has batch-processing machines with limited capacity and provides products for the customers. The products are in different sizes which are ordered by the customer and when processed, the products are divided into batches given that the total size of a batch does not exceed the machine capacity. After the completion of products, they are delivered to customers by vehicles of the manufacturer. The authors investigate two classes of problems where the manufacturer has single customer and multiple customers, respectively. In each class of problems, two machine configurations are considered including single machine and identical parallel machines. The authors analyse the computational complexity of the problems and present integer programming models. Then the authors propose polynomial time algorithms using approximation algorithms and dynamic programming. For each algorithm, the time complexity and the performance guarantee are analysed.
机译：在本文中，作者研究了一类供应链调度问题。制造商拥有容量有限的批处理机，并为客户提供产品。客户可以订购不同尺寸的产品，并且在加工时，如果批量的总尺寸不超过机器的生产能力，则将产品分为几批。产品完成后，将通过制造商的车辆将其交付给客户。作者研究了两类问题，其中制造商分别拥有一个客户和多个客户。在每类问题中，都考虑了两种机器配置，包括单台机器和相同的并行机。作者分析了问题的计算复杂性，并提出了整数规划模型。然后作者提出了使用逼近算法和动态规划的多项式时间算法。对于每种算法，分析了时间复杂度和性能保证。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号