Abstract
This paper describes a new algorithm for solving the flow-shop scheduling problem of n/m/F/F max to minimize maximum flow time. A set of 2000 randomly produced problems of different sizes was solved and compared with three well-known heuristics. The result reveals that the new algorithm improves the best heuristics in performance measures by a significant percentage. Also, because the number of necessary operations for solving problems in this algorithm is independent of the number of machines involved, it is apt for systems with large numbers of machines. This work helps in solving flow-shop scheduling problems for manufacturing systems with large numbers of machines.
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.
