Abstract
Scheduling problem exists almost everywhere in our day to day real life and at the same time industrial problems related to service sector. Two machine flow shop scheduling problem (FSSP) was solved by Johnson in the mid of 1954. In case of tie, he has chosen the processing times arbitrarily. In this paper, we have given crystal clear idea that how to solve two machine FSSP when tie occurs by giving two priority rules to check for consistency in solving the problem for the objective of minimizing the total completion time. Computational results show that the algorithm with Longest Processing Time (LPT) priority rule provides better results than the algorithm with Shortest Processing Time (SPT) priority rule when the machine order is reversed.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
