首页> 外文会议>International Conference on Automation Science and Engineering >A Modified Heuristic Algorithm for Resource Constrained Multi-project Scheduling Problem based on Inspection and Rework
【24h】

A Modified Heuristic Algorithm for Resource Constrained Multi-project Scheduling Problem based on Inspection and Rework

机译:基于检查和返工的资源受限多项目调度问题修改的启发式算法

获取原文

摘要

Reworking inevitably takes place in aircraft assembly once one or several assembly faults are detected through inspections. In this paper, we propose a resource constrained multi-project scheduling problem based on inspection and rework The objective of the mathematical model is to minimize the weighted expected makespan and weighted deviation between original activity actual starting times and their scheduled starting times. The proposed modified heuristic algorithm combines a tabu search framework with a STC-based baseline generation scheme. The tabu search framework is designed to search a reasonable resource flow, while the STC based baseline generation scheme establishes a buffered baseline by delaying original activities. Finally, computational experiments are carried out by using modified instances, and results reveal that the proposed algorithm can efficiently solve the problem, especially in a particular situation.
机译:一旦通过检查检测到一个或多个装配故障,就不可避免地在飞机组件中进行重新加工。在本文中,我们提出了基于检查和返工的资源受限的多项目调度问题,数学模型的目的是最小化原始活动实际开始时间和预定开始时间之间的加权预期薄荷和加权偏差。所提出的修改后启发式算法将禁忌搜索框架与基于STC的基线生成方案相结合。禁忌搜索框架旨在搜索合理的资源流,而基于STC的基线生成方案通过延迟原始活动来建立缓冲基线。最后,通过使用修改的实例进行计算实验,结果表明,所提出的算法可以有效地解决问题,尤其是在特定情况下。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号