A Novel Memetic Algorithm Integrated with Variable Neighborhood Search for the Job Shop Scheduling Problem
Guoyun Zhang, Huaiyin He, Yuqi Zhao, Haoyu Wang et autres
The job shop scheduling problem (JSSP) is a challenging NP-hard combinatorial optimization task aimed at minimizing the makespan for scheduling jobs on machines with precedence and resource constraints. This paper proposes a novel memetic algorithm integrated with variable neighborhood search (MA-VNS), combining …
cn (code pays fourni par la source)
0 citations