Solving Flow Shop Scheduling Problems with Blocking by using Genetic Algorithm

Harendra Kumar, Pankaj Kumar and Manisha Sharma
Additional contact information
Harendra Kumar: Gurukula Kangri Vishwavidyalaya, Haridwar, India
Pankaj Kumar: Gurukula Kangri Vishwavidyalaya, Haridwar, India
Manisha Sharma: Panjab University, Chandigarh,, India

International Journal of Applied Logistics (IJAL), 2019, vol. 9, issue 2, 20-38

Abstract: Flow shop scheduling problems have been analyzed worldwide due to their various applications in industry. In this article, a new genetic algorithm (NGA) is developed to obtain the optimum schedule for the minimization of total completion time of n-jobs in an m-machine flow shop operating without buffers. The working process of the present algorithm is very efficient to implement and effective to find the best results. To implement the proposed algorithm more effectively, similar job order crossover operators and inversion mutation operators have been used. Numerous examples are illustrated to explain proposed approach. Finally, the computational results indicate that present NGA performs much superior to the heuristics for blocking flow shop developed in the literature.

Date: 2019
References: Add references at CitEc
Citations:

Downloads: (external link)
http://services.igi-global.com/resolvedoi/resolve. ... 4018/IJAL.2019070102 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:igg:jal000:v:9:y:2019:i:2:p:20-38

Access Statistics for this article

International Journal of Applied Logistics (IJAL) is currently edited by Lincoln C. Wood

More articles in International Journal of Applied Logistics (IJAL) from IGI Global
Bibliographic data for series maintained by Journal Editor ().