(2作 2015 Ruhul Sarker)Memetic algorithms for solving job-shop scheduling problems
Abstract背景介绍Thejob-shopschedulingproblemiswellknownforitscomplexityasanNP-hardproblem.WehaveconsideredJSSPswithanobjectiveofminimizingmakespanwhilesatisfyinganumberofhardconstraints.作为NP难问题,作业车间调度问题以其