Key points are not available for this paper at this time.
Due to the severity of resource consumption and uncertainty in orders, new challenges have arisen for production scheduling in enterprises. This paper studies the scheduling problem of minimising the total weighted tardiness for jobs with fuzzy processing times and due dates on identical parallel machines with resource constraint. To address this research problem, we first propose methods to calculate the upper bound of resource consumption and the maximum number of machines that can be used, effectively reducing the search space and improving the algorithm's efficiency. Secondly, a local search algorithm based on job swapping is proposed to enhance the algorithm's performance. Then, repair algorithms based on job removal and job swapping are designed to repair infeasible solutions. Finally, we propose a fuzzy genetic algorithm (FGALS) to solve the problem based on the above elements. Through extensive simulation experiments, the effectiveness and efficiency of the FGALS algorithm are verified by comparing it with commercial solver Gurobi and several meta-heuristic algorithms.
Li et al. (Wed,) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: