code.m

采用遗传算法对于加工问题的排序,使其最快.

function [a,b]=code(job_total,pop_size)
for m=1:pop_size
    for k=1:job_total*(ceil(log2(job_total))+1)
    a(m,k)=rand*2-1;
    b(m,k)=sqrt(1-a(m,k)^2)*sign(randn);
    end
end