Purpose

To meet the requirement of establishing an effective schedule for the assembly process with overall detection and rework, this paper aims to address a new problem named resource-constrained multi-project scheduling problem based on detection and rework (RCMPSP-DR).

Design/methodology/approach

First, to satisfy both online and offline scheduling, a mixed integer programming model is established with a weighted bi-objective minimizing the expected makespan and the solution robustness. Second, an algorithm that combines a tabu search framework with a critical chain-based baseline generation scheme is designed. The tabu search framework focuses on searching for a reasonable resource flow representing the execution sequence of activities, while the critical chain-based baseline generation scheme establishes a buffered baseline schedule by estimating the tradeoff between two aspects of bi-objective.

Findings

The proposed algorithm can get solutions with gaps from −4.45% to 2.33% when compared with those obtained by the commercial MIP solver CPLEX. Moreover, the algorithm outperforms four other algorithms in terms of both objective performance and stability over instances with different weighting parameters, which reveals its effectiveness.

Originality/value

The represented RCMPSP-DR considering the overall detection and rework is an extension of the scheduling problem for large-scale equipment. An effective algorithm is proposed to establish the baseline schedule and determine the execution sequence of activities for the assembly process, which is significant for practical engineering applications.

中文翻译：

---

基于检测与返工的资源受限多项目调度问题建模与算法

目的

为满足建立有效的装配过程整体检测和返工调度的要求，本文旨在解决一个新的问题，即基于检测和返工的资源受限多项目调度问题（RCMPSP-DR）。 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

设计/方法/方法

首先，为了同时满足在线和离线调度，建立一个混合整数规划模型，加权双目标最小化预期完工时间和解决方案的鲁棒性。其次，设计了一种将禁忌搜索框架与基于关键链的基线生成方案相结合的算法。禁忌搜索框架侧重于搜索表示活动执行顺序的合理资源流，而基于关键链的基线生成方案通过估计双目标的两个方面之间的权衡来建立缓冲的基线计划。

发现

与商业 MIP 求解器 CPLEX 获得的解相比，所提出的算法可以得到具有 -4.45% 到 2.33% 间隙的解。此外，该算法在具有不同权重参数的实例上的客观性能和稳定性方面均优于其他四种算法，这表明了其有效性。

原创性/价值

所代表的 RCMPSP-DR 考虑整体检测和返工是大型设备调度问题的扩展。提出了一种有效的算法来建立基线计划并确定装配过程活动的执行顺序，这对实际工程应用具有重要意义。