Juan-Juan Xu

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
The flowshop scheduling problem (FSP) is a typical non-deterministic polynomial-time (NP) hard combinatorial optimization problem with strong engineering background in semiconductor manufacturing, assembly line, and ship building et al. In the last decade, Memetic Algorithms (MAs) have been demonstrated to achieve superior performance to their counterparts(More)
  • 1