Amirteimoori, ArashMahdavi, IrajSolimanpur, MaghsudAli, Sadia SamarTirkolaee, Erfan Babaee2022-11-072022-11-072022Amirteimoori, A., Mahdavi, I., Solimanpur, M., Ali, S. S., & Tirkolaee, E. B. (2022). A parallel hybrid PSO-GA algorithm for the flexible flow-shop scheduling with transportation. Computers and Industrial Engineering, 173 doi:10.1016/j.cie.2022.108672https://doi.org/10.1016/j.cie.2022.108672https://hdl.handle.net/20.500.12713/3236In this paper, a Mixed-Integer Linear Programming (MILP) model to simultaneously schedule jobs and transporters in a flexible flow shop system is suggested. Wherein multiple jobs, finite transporters, and stages with parallel unrelated machines are considered. In addition to the mentioned technicalities, the jobs are able to omit one or more stages, and may not be executable by all the machines, and similarly, transportable by all the transporters. To the best of our knowledge, no study in the literature has featured efficacy of the parallel computing in simultaneous scheduling of jobs and transporters in the flexible flow shop system which remarkably shortens run time if the solution approaches are designed accordingly. To this end, we employ Gurobi solver, Parallel Genetic Algorithm (PGA), Parallel Particle Swarm Optimization (PPSO) and hybrid Parallel PSO-GA Algorithm (PPSOGA) to deal with the problem instances. Furthermore, a parallel version of Ant Colony Optimization (ACO) algorithm adapted from the state-of-the-art literature is developed to verify the performance of our suggested solution methods. Using 60 problem instances generated via uniform distribution, the suggested solution approaches are compared against one another. After assessing the results of the computational experiments, it is deduced that PPSOGA algorithm outperforms PGA, PPSO, Parallel Ant Colony Optimization (PACO) and Gurobi solver in terms of the quality of the solutions. The efficiency and run time of the suggested approaches are then assessed through two prominent statistical tests (i.e., Wald and Analysis of Variance (ANOVA)). Eventually, it comes to spotlight that PPSOGA algorithm is computationally rewarding and dependable.eninfo:eu-repo/semantics/closedAccessFlexible Flow Shop SchedulingHybrid Parallel PSO-GA AlgorithmMetaheuristicsMixed-Integer Linear ProgrammingParallel ComputingArticle173WOS:0008758537000032-s2.0-85139332388Q110.1016/j.cie.2022.108672N/A