Madenoğlu, Fatma Selen2024-08-022024-08-02202108848289https://doi.org/10.1007/978-3-030-70281-6_14https://hdl.handle.net/20.500.12573/2317The flow shop scheduling problem is widely discussed in the literature since it is frequently applied in real industry. This paper presents a variant of flow shop scheduling problem with parallel machines. The proposed problem includes multistage and identical parallel machines at each stage, and the sequence-dependent setup time and transportation time are considered. The objective function is minimization of makespan. The particle swarm optimization algorithm (PSO) is addressed to solve the problem and compared with genetic algorithm and heuristics. The benchmark instances are generated to demonstrate the performance of the PSO. The numerical results show that the PSO significantly outperforms the comparison set.enginfo:eu-repo/semantics/closedAccessCombinatorial optimizationHybrid flow shopMakespanParticle swarm optimizationbookPart306263277