An Improved particle swarm algorithm to find optimal scheduling in two-stage hybrid flow shop problem
Abstract This paper deals with the two-stage hybrid flow shop problem , in which the first stage consists of three machines , the second stage consists of two machines . The aim is to find out the optimal scheduling for n jobs when processing in this environment when the makespan is minimum....
Main Author: | MANAL A . ZEIDAN |
---|---|
Format: | Article |
Language: | Arabic |
Published: |
College of Computer Science and Mathematics, University of Mosul
2013-08-01
|
Series: | المجلة العراقية للعلوم الاحصائية |
Online Access: | https://stats.mosuljournals.com/article_80693_c890b9d5dcdbb00fb0a4cdd3a5eac90d.pdf |
Similar Items
-
Evolutionary Hybrid Particle Swarm Optimization Algorithm for Solving NP-Hard No-Wait Flow Shop Scheduling Problems
by: Laxmi A. Bewoor, et al.
Published: (2017-10-01) -
A GENETIC ALGORITHM TO MINIMIZE THE MAKESPAN FOR THREE MACHINE FLOW SHOP SCHEDULING
by: MANAL ABDULKAREEM ZEIDAN
Published: (2013-04-01) -
A particle swarm optimization approach for permutation flow shop scheduling problem
by: Radha Ramanan T., et al.
Published: (2014-01-01) -
The impact of local search strategies on chaotic hybrid firefly particle swarm optimization algorithm in flow-shop scheduling
by: Abdülkadir Gümüşçü, et al.
Published: (2022-09-01) -
Application of particle swarm optimization in job shop scheduling problem /
by: Milad Ansari, 1987-, et al.
Published: (2013)