• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>International Journal of Computer Integrated Manufacturing >A tabu search approach for group scheduling in buffer-constrained flow shop cells
【24h】

A tabu search approach for group scheduling in buffer-constrained flow shop cells

机译：在缓冲受限的流水车间单元中进行群调度的禁忌搜索方法

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

摘要

The scheduling problem in a cellular manufacturing system (CMS) has been named as group scheduling in the literature. Due to the similarities in the processing route of the parts being in a group, it is mostly referred to as flow shop group scheduling. This problem consists of two interrelated sub-problems, namely intra-group scheduling and inter-group scheduling. On the other hand, mostly there are limited buffers between successive machines in which the work-in-process inventories can be stored. This article investigates the flow shop group scheduling with limited buffers to minimise the total completion time (makespan). Regarding the NP-hardness of this problem, two tabu search algorithms are proposed for solving each sub-problem. The effectiveness of the proposed algorithms is evaluated on 270 randomly generated problems classified under 27 categories. The results of the proposed algorithm are compared with those of the heuristic published by Solimanpur-Vrat-Shankar (SVS). Computational results demonstrate significant reduction in the average makespan over the SVS-algorithm.
机译：蜂窝制造系统（CMS）中的调度问题在文献中已被称为组调度。由于零件的处理路径在一组中的相似性，因此通常将其称为流水车间组调度。此问题包括两个相互关联的子问题，即组内调度和组间调度。另一方面，大多数连续机器之间的缓冲区有限，可以在其中存储在制品库存。本文研究使用有限缓冲区的流水车间组调度，以最大程度地减少总完成时间（makespan）。关于此问题的NP难点，提出了两种禁忌搜索算法来解决每个子问题。在分类为27个类别的270个随机生成的问题上评估了所提出算法的有效性。将该算法的结果与Solimanpur-Vrat-Shankar（SVS）发表的启发式算法的结果进行了比较。计算结果表明，与SVS算法相比，平均有效期显着降低。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号