Abstract
Abstract Two-stage assembly flow shops are integral part of several manufacturing systems such as computer and engine manufacturing lines. This paper explores three objectives of makespan, total tardiness, and total completion times for two-stage assembly flow shop with release time. To the best of our knowledge, these performance measures have not been addressed simultaneously in assembly flow shops. We derive polynomial optimal solutions for special cases of this problem with a single objective and then develop heuristics with promising starting solutions for the multi-objective case. Due to NP-hardness of the problem, we apply a customized reference-based Non-dominated Sorting Genetic Algorithm (NSGA-III) and Multi-Objective Particle Swarm Optimization (MOPSO) as solution procedures. Finally, we present extensive computational analysis to compare the performance of employed heuristic and metaheuristics on randomly generated instances. Results show that both NSGA-III and MOPSO generate competitive solutions for the presented problem. However, NSGA-III generates significantly better results than MOPSO based on one of the three performance metrics.
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.
