...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Journal of the Chinese Society of Mechanical Engineers, Series C: Transactions of the Chinese Society of Mechanical Engineers >On scheduling of a reentrant line with a hub
【24h】

On scheduling of a reentrant line with a hub

机译：调度具有中心的可重入生产线

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

摘要

For products such as IC wafers and golf-club heads, certain work stations are visited by a product a number of times during the manufacturing process. These work stations are called hubs. We consider that there is only one hub which a product enters many times. Between two successive visits to the hub, the products are processed on other machines. Our objective is to determine a schedule such that the total cost of the difference of the actual and the target WIP inventories of the hub and the holding and backordering costs of the end product is minimized. Intuitively, the optimal solution should bring the inventories of the WIP and the finished goods to the targets as soon as possible. The intuition approach is frequently used by the practitioners, but we prove it is wrong. The problem is formulated as a discrete-time optimal control problem. The relations of the state and the control variables are expressed as a system of difference equations. Since the time lags exist only between two successive entries, we propose a simple and efficient approach based on derivatives to solving the problem without removing the time lags. Propositions are proved to manifest the properties of the optimal solutions to this problem. Based on these proved propositions, we develop algorithms to obtain the solutions in an efficient way. Computational experiments show that our approach obtains the optimal or near-optimal solutions efficiently.
机译：对于诸如IC晶片和高尔夫球杆头的产品，产品在制造过程中会多次访问某些工作站。这些工作站称为集线器。我们认为，只有一个枢纽可以使产品多次进入。在连续两次访问中心之后，将在其他机器上处理产品。我们的目标是确定时间表，以使轮毂的实际在制品和目标在制品的差异与最终产品的持有和补货成本之差的总成本最小化。凭直觉，最佳解决方案应尽快将在制品和制成品的库存达到目标。直觉方法经常被从业者使用，但是我们证明它是错误的。该问题被表述为离散时间最优控制问题。状态和控制变量之间的关系表示为差分方程组。由于时滞仅存在于两个连续的条目之间，因此我们提出了一种基于导数的简单有效的方法来解决该问题，而不会消除时滞。命题被证明可以证明该问题最优解的性质。基于这些已证明的命题，我们开发了算法来以有效的方式获得解决方案。计算实验表明，我们的方法有效地获得了最优或接近最优的解决方案。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号