An improved backtracking search algorithm for the flexible job shop rescheduling problem with new job insertions

Caldeira, Rylan H.; Gnanavelbabu, A.

doi:10.1504/ejie.2022.119365

Cited by 4 publications

(2 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In the production rescheduling with interference, Caldeira et al, 2022 [24] considered the flexible job shop rescheduling problem with new job insertion (fjsrp) to minimize the completion time. An improved discrete backtracking search algorithm and an insertion rescheduling strategy based on relaxation are proposed to solve this problem.…”

Section: Introductionmentioning

confidence: 99%

Yard Crane Rescheduling under the Influence of Random Fault

et al. 2023

View full text Add to dashboard Cite

In the operation of the imported container area of the container yard, the fault of the yard crane often occurs, and the fault is random and unpredictable, which greatly affects the operational efficiency of the container yard. To improve the operation efficiency of the container yard, this paper studies the rescheduling optimization problem of the multi-container area and multi-yard crane when random faults occur in container lifting operations in the container import area. Considering the different impacts of different fault conditions on the container yard operation, the fault impact judgment mechanism is established. The waiting time of external container trucks and customer satisfaction is considered for yard crane rescheduling. Yard crane rescheduling model after the fault is constructed, aiming at the minimum deviation from the original scheduling scheme. And the AEA (annealing evolution algorithm) algorithm is used to solve it. The effectiveness of magic and the specificity of the algorithm are verified by the analysis of numerical examples in different scales. The research data of Dalian Port is used to carry out experiments, and the experimental analysis of examples in different scales verifies the effectiveness of the model and the scientific nature of the algorithm. Compared with the existing scheme, this scheme is more practical, which can not only give the treatment scheme immediately when the fault occurs but also effectively improve the working efficiency of the container yard and provide a reference for the port to enhance customer satisfaction.

show abstract

Section: Introductionmentioning

confidence: 99%

Yard Crane Rescheduling under the Influence of Random Fault

et al. 2023

View full text Add to dashboard Cite

show abstract

“…Rescheduling studies have involved various manufacturing systems, including single machine system, [27][28][29] parallel machine system, [30][31][32] flow shop, [33][34][35] job shop, [36][37][38] and flexible manufacturing systems. 39,40 As far as the authors know, few studies have dealt with the rescheduling problem of assembly job shop.…”

Section: Introductionmentioning

confidence: 99%

Self-reconfiguration and rescheduling of aero-engine assembly shop with rework disruption in knowledgeable manufacturing environment

Yan

Wan

2022

Proceedings of the Institution of Mechanical Engineers, Part B:

View full text Add to dashboard Cite

An aero-engine has to be assembled twice or more to satisfy stringent technical standards. Substandard engines are required to re-enter for additional reassembly, which may trigger rework disruption. Work groups with flexible skills are responsible for the operations and can be reassigned when rescheduling triggers. An integrated problem of rescheduling of engines and reconfiguration of work groups with rework disruption is formulated here. A heuristic is proposed to solve the problem. In self-reconfiguration optimization, work groups are reassigned in accordance with the workload balance criterion without violating the assembly skills constraints. In rescheduling optimization, locally optimal sequencing propositions of operations are derived and applied to generate a feasible schedule. Three neighborhood structures are defined, and a variable neighborhood search is implemented to optimize the assignment and the schedule of operations on parallel work groups. The effectiveness of the proposed algorithm is tested by several numerical experiments. The results show that the proposed algorithm promises apparently lower total cost and more desirable assignment of work groups by scheduling.

show abstract