Flow Shop Scheduling Problem with Four Machines N-Job for Minimizing Makespan

Flow Shop Scheduling Problem with Four Machines N-Job for Minimizing Makespan
Authors : Sayali Choudhari, Dr. Ritu Khanna
Publication Date: 27-02-2017


Author(s):  Sayali Choudhari, Dr. Ritu Khanna

Published in:   International Journal of Engineering Research & Technology

License:  This work is licensed under a Creative Commons Attribution 4.0 International License.

Website: www.ijert.org

Volume/Issue:   Volume. 6 - Issue. 01 , February - 2017

e-ISSN:   2278-0181

 DOI:  http://dx.doi.org/10.17577/IJERTV6IS020284


In this paper we try to find algorithm for flow shop scheduling problem of 4 machines with n-jobs. Every job has to process on all machines which are arranged in series. After finishing of each job on first machine it will be transferred on second machine without delay with the help of transporting agent and so on. We also identify other factors which are responsible for scheduling like importance of jobs for arranging in sequence that is weightage assigned to each job, breakdown interval of machine, transportation time of jobs etc. By using Johnson’s rule we try to explain the mathematical modelling, structure, suppositions, theorem with its statement and proof which is applicable to solve the numerical problem.


Number of Citations for this article:  Data not Available


Key Word(s):    


Number of Downloads:     36

7   Paper(s) Found related to your topic:    

Call for Papers - May - 2017



                 Call for Thesis - 2017 

     Publish your Ph.D/Master's Thesis Online

              Publish Ph.D Master Thesis Online as Book