Hybrid Metaheuristics for Solving a Fuzzy Single Batch-Processing Machine Scheduling Problem

الملخص EN

This paper deals with a problem of minimizing total weighted tardiness of jobs in a real-world single batch-processing machine (SBPM) scheduling in the presence of fuzzy due date.

In this paper, first a fuzzy mixed integer linear programming model is developed.

Then, due to the complexity of the problem, which is NP-hard, we design two hybrid metaheuristics called GA-VNS and VNS-SA applying the advantages of genetic algorithm (GA), variable neighborhood search (VNS), and simulated annealing (SA) frameworks.

Besides, we propose three fuzzy earliest due date heuristics to solve the given problem.

Through computational experiments with several random test problems, a robust calibration is applied on the parameters.

Finally, computational results on different-scale test problems are presented to compare the proposed algorithms.