A reactive scheduling method for disturbances in aircraft moving assembly line

Zhu, Huixin; Liu, Zhiqiang; Lu, Chenyao; Ren, Yifei

doi:10.1080/00207543.2020.1771456

Cited by 8 publications

(1 citation statement)

References 30 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Though many studies have developed effective approaches for RCMPSP and approach for other problems can be referenced (Bes ikci et al, 2015;Ren and Lu, 2019;Zhang and Xu, 2020;Lu et al, 2019;Zhu et al, 2020;Zhou and Zhu, 2020;He et al, 2020), they are mainly suitable for a deterministic environment and stay short of copying with the real assembly environment where uncertainties such as faults and failures may occur (Wu et al, 2019;Wu et al, 2020). Given the complexity of large-scale equipment and the requirement of overall reliability, the detection of overall assembly performance is indispensable (Zhu et al, 2018).…”

Section: Introductionmentioning

confidence: 99%

Modeling and algorithm for resource-constrained multi-project scheduling problem based on detection and rework

Zhu

Liu

et al. 2021

Self Cite

View full text Add to dashboard Cite

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.

show abstract