Limited Search Space-Based Algorithm for Dual Resource Constrained Scheduling Problem with Multilevel Product Structure

• Published in: Applied sciences Vol. 9; no. 19; p. 4005
• Main Authors: Yang, Geunho, Chung, Byung Do, Lee, Sang Jin
• Format: Journal Article
• Language: English
• Published: Basel MDPI AG 01.10.2019
• Subjects: Algorithms; dual resource; flexible job shop scheduling; heuristic algorithm; Integer programming; Job shops; Manufacturing; multilevel product structure; Scheduling; Workers
• ISSN: 2076-3417; 2076-3417
• DOI: 10.3390/app9194005

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.