Solving Optimization Problem with Particle Swarm Optimization: Solving Hybrid Flow Shop Scheduling Problem with Particle Swarm Optimization Algorithm
Fatma Selen Madenoğlu ()
Additional contact information
Fatma Selen Madenoğlu: Abdullah Gül University
Chapter Chapter 14 in Applying Particle Swarm Optimization, 2021, pp 263-277 from Springer
Abstract The 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.
Keywords: Hybrid flow shop; Combinatorial optimization; Makespan; Particle swarm optimization (search for similar items in EconPapers)
References: Add references at CitEc
Citations: Track citations by RSS feed
There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
Persistent link: https://EconPapers.repec.org/RePEc:spr:isochp:978-3-030-70281-6_14
Ordering information: This item can be ordered from
Access Statistics for this chapter
More chapters in International Series in Operations Research & Management Science from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().