Abstract
The job shop scheduling problem (JSSP) and the facility layout planning (FLP) are two important factors influencing productivity and cost-controlling activities in any manufacturing system. In the past, a number of attempts have been made to solve these stubborn problems. Although, these two problems are strongly interconnected and solution of one significantly impacts the performance of other, so far, these problems are solved independently. Also, the majority of studies on JSSPs assume that the transportation delays among machines are negligible. In this paper, we introduce a general method using multi-objective genetic algorithm for solving the integrated problems of the FLP and the JSSP considering transportation delay having three objectives to optimize: makespan, total material handling costs, and closeness rating score. The proposed method makes use of Pareto dominance relationship to optimize multiple objectives simultaneously and a set of non-dominated solutions are obtained providing additional degrees of freedom for the production manager.
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.
