A new parallel genetic algorithm for solving ... - Semantic Scholar

Download PDF
3 downloads 8497 Views 44KB Size Report
Comment
Aug 13, 2008 - The number of earliness jobs and the number of tardiness jobs are respectively given as follows: Nearliness = n. ∑ j=1 esign(j), Ntardiness = n.