The IRMA Community
Newsletters
Research IRM
Click a keyword to search titles using our InfoSci-OnDemand powered search:
|
Solving Flow Shop Scheduling Problems with Blocking by using Genetic Algorithm
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.
Related Content
|
Shailendra Aote, Mukesh M. Raghuwanshi.
© 2021.
34 pages.
|
|
Anjana Mishra, Bighnaraj Naik, Suresh Kumar Srichandan.
© 2021.
15 pages.
|
|
Thendral Puyalnithi, Madhuviswanatham Vankadara.
© 2021.
15 pages.
|
|
Geng Zhang, Xiansheng Gong, Xirui Chen.
© 2021.
13 pages.
|
|
Jhuma Ray, Siddhartha Bhattacharyya, N. Bhupendro Singh.
© 2021.
19 pages.
|
|
Pijush Samui, Viswanathan R., Jagan J., Pradeep U. Kurup.
© 2021.
18 pages.
|
|
Ravinesh C. Deo, Sujan Ghimire, Nathan J. Downs, Nawin Raj.
© 2021.
32 pages.
|
|
|