Abstract
The objective of this paper is to minimize the makespan for two machines flow shop scheduling, in which processing time, setup time each are under fuzzy environment including the significant transportation time. Further a single transporting agent which carries the jobs from first machine to second machine and returns back to first machine is considered. An algorithm to find the optimal sequence of jobs processing, minimizing the total flow time is discussed. The optimality of the solution is verified by a mathematical theorem. A numerical illustration at the end is also given to justify the proposed algorithm.
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.
