首页> 外文OA文献 >A resource-constrained assembly job shop scheduling problem with Lot Streaming technique
【2h】

A resource-constrained assembly job shop scheduling problem with Lot Streaming technique

机译:资源很多的流水作业的装配车间作业调度问题

摘要

To ensure effective shop floor production, it is vital to consider the capital investment. Among most of the operational costs, resource must be one of the critical cost components. Since each operation consumes resources, the determination of resource level is surely a strategic decision. For the first time, the application of Lot Streaming (LS) technique is extended to a Resource-Constrained Assembly Job Shop Scheduling Problem (RC_AJSSP). In general, AJSSP first starts with Job Shop Scheduling Problem (JSSP) and then appends an assembly stage for final product assembly. The primary objective of the model is the minimization of total lateness cost of all final products. To enhance the model usefulness, two more experimental factors are introduced as common part ratio and workload index. Hence, an innovative approach with Genetic Algorithm (GA) is proposed. To examine its goodness, Particle Swarm Optimization (PSO) is the benchmarked method. Computational results suggest that GA can outperform PSO in terms of optimization power and computational effort for all test problems.
机译:为了确保有效的车间生产,考虑资本投资至关重要。在大多数运营成本中,资源必须是关键成本组成部分之一。由于每个操作都会消耗资源,因此确定资源级别无疑是一项战略决策。第一次,批量流(LS)技术的应用扩展到资源受限的装配车间计划问题(RC_AJSSP)。通常,AJSSP首先从Job Shop Scheduling Problem(JSSP)开始,然后为最终产品组装附加一个组装阶段。该模型的主要目的是使所有最终产品的总延迟成本最小化。为了提高模型的实用性,引入了另外两个实验因素:通用零件比和工作负荷指数。因此,提出了一种创新的遗传算法(GA)方法。为了检查其优点,粒子群优化(PSO)是基准测试方法。计算结果表明,在所有测试问题的优化能力和计算量方面,GA的性能均优于PSO。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号