Chaotic PSO algorithm is proposed to solve NP-hard IPPS problem.
Ten chaotic maps are implemented to avoid premature convergence to local optimum.
Makespan, balanced level of machine utilization and mean flow time are observed.
Five experimental studies show that cPSO outperforms GA, SA, and hybrid algorithm.
Scheduling plans are tested by mobile robot within a laboratory environment.