• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>The International Journal of Advanced Manufacturing Technology >Bid construction scheme for job flow time reduction in auction-based fully-distributed manufacturing systems
【24h】

Bid construction scheme for job flow time reduction in auction-based fully-distributed manufacturing systems

机译：基于竞价的分布式制造系统中减少工作流时间的投标施工方案

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

摘要

This study presents a novel bid construction scheme for an auction-based fully-distributed manufacturing system. The scheme is applied to the planning and control of manufacturing activities. A set of independent machining resources in the system, each with several ongoing set-up dependent jobs, compete for an upcoming job. The manner in which a resource constructs a bid determines job allocation and resource utilization and, consequently, job flow times. Resources that employ simple heuristic methods (e.g., based on a first-come-first-served scheme) to construct bids, often neglecting setup considerations, limit their applicability and performance quality. Here, the bid construction problem of a resource is formulated as a setup-sequencing (SS) problem. The optimal sequencing theory is then applied to develop a dynamic programming (DP)-based bid construction algorithm. The proposed algorithm has a computational complexity lower than that of the best-known algorithm for the SS problem. Additionally, parallel and distributed computing technology is utilized to model and implement this auction-based manufacturing control system in order to gain further insights into the effectiveness of the proposed DP-based bid construction scheme. Experimental results demonstrate that the proposed bid construction scheme performs well, and its contribution becomes obvious in the case of larger setup times and lot sizes.
机译：这项研究为基于拍卖的完全分布式制造系统提出了一种新颖的投标构建方案。该方案适用于制造活动的计划和控制。系统中一组独立的加工资源，每个资源都有多个正在进行的与设置有关的工作，它们竞争即将到来的工作。资源构造投标的方式决定了工作分配和资源利用率，进而决定了工作流程时间。采用简单的启发式方法（例如，基于先到先得的方案）来构造出价的资源，通常会忽略设置注意事项，从而限制了其适用性和效果质量。在此，将资源的投标构建问题表述为建立排序（SS）问题。然后，将最佳排序理论应用于开发基于动态规划（DP）的出价构建算法。所提出的算法的计算复杂度低于最著名的SS问题算法。另外，并行和分布式计算技术被用来对基于拍卖的制造控制系统进行建模和实施，以进一步了解所提出的基于DP的投标构建方案的有效性。实验结果表明，所提出的投标施工方案效果良好，并且在准备时间和批量较大的情况下，其贡献显而易见。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号