Impact Factor: 7.883
Submit Paper
Volume 3, Issue 8 (August 2017)

Solving Flow Shop Scheduling Problem Using Genetic Algorithm And Simulated Annealing

Impact Factor
7.883
Call For Paper
Volume 12 Issue 07

July 2026

Download Paper Format
Paper Format
Copyright Form
Copy Right Format
Under License Of
IJSART License
Creative Commons Attribution-NonCommercial
4.0 International License
Share on:

Author(s)

Suganya.R Dr.B.S.E.Zoraida

Abstract

Flow Shop Scheduling Is One Of The Most Interesting NP-hard Problems. As The Flow Shop Scheduling Is An Optimization Problem, In This Work, Genetic Algorithm (GA) Was Selected To Solve For The Benchmark Problem To Minimize The Makespan. Selection Scheme I

Keywords

Genetic Algorithm Makespan Selection Schemes Simulated Annealing.

Paper ID

IJSARTV3I817340

Publication Date

August 31, 2017

Research Area

Computer Science Engineering And Applications

Download Full Article

Submit Your Paper to IJSART

Join the global research community with IJSART. Submit your paper, share your work, and gain worldwide recognition!

Submit Your Paper