This study addresses the dual resource constrained flexible job shop scheduling problem (DRCFJSP) with a multilevel product structure. The DRCFJSP is a strong NP-hard problem, and an efficient algorithm is essential for DRCFJSP. In this study, we propose an algorithm for the DRCFJSP with a multilevel product structure to minimize the lateness, makespan, and deviation of the workload with preemptive priorities. To efficiently solve the problem within a limited time, the search space is limited based on the possible start and end time, and focus is placed on the intensification rather than diversification, which can help the algorithm spend more time to find an optimal solution in a reasonable solution space. The performance of the proposed algorithm is compared with those of a genetic algorithm and a hybrid genetic algorithm with variable neighborhood search. The numerical experiments demonstrate that the strategy limiting the search space is effective for large and complex problems.
All Science Journal Classification (ASJC) codes
- Materials Science(all)
- Process Chemistry and Technology
- Computer Science Applications
- Fluid Flow and Transfer Processes