This paper focuses on three very similar evolutionary algorithms: genetic algorithm (GA), particle swarm optimization
(PSO), and differential evolution (DE). While GA is more suitable for discrete optimization, PSO and DE are more
natural for continuous optimization. The paper first gives a brief introduction to the three EA techniques to highlight
the common computational procedures. The general observations on the similarities and differences among the three
algorithms based on computational steps are discussed, contrasting the basic performances of algorithms. Summary of
relevant literatures is given on job shop, flexible job shop, vehicle routing, location-allocation, and multimode resource
constrained project scheduling problems.