Abstract
No-wait flow shop scheduling is a type of manufacturing scheduling which finds applications in advanced manufacturing systems and falls under the category of NP-hard combinatorial optimization problem. Heuristic methods are found to be the most suitable ones for obtaining solutions to these problems. We propose a heuristic method based on Vogel’s Approximation Method for developing the solution for the objective of minimizing total flow time in no-wait flow shop. The computational results are compared with the results of the well known existing heuristics in no-wait flow shop for minimizing the total flow time criterion. The results reveal that the proposed method significantly outperforms the existing heuristics, with comparable computational time. Statistical tests are used to validate the performance of the proposed method.
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.
