Using GA / PSO To Solve n/(F_2∕)⁄((∑_(j=1)^n▒E_j )+U_j)Problem In Machine Scheduling

Abstract

This paper set by a Genetic Algorithm (GA), Particle Swarm Optimization (PSO) methods tosequence a number of n jobs a flow shop to minimize multi objective  function: minimize the total earliness and the number of tardy jobs this problems is NP-hard  solved  with up to 4000 jobs.