Abstract
Article history: Received April 17, 2012 Accepted 11 June 2012 Available online June 14 2012 In this paper, we consider job shop scheduling and machine location problem, simultaneously. Processing, transportation, and setup times are defined as deterministic parameters. The purpose of this paper is to determine machine location and job scheduling such that the make span and transportation cost is minimized. Therefore, the proposed model is a multi-objective problem one, where the first objective function minimizes make span and another minimizes the transportation cost. To solve the multi-objective problem, two methods are evaluated. Considering combination of job shop scheduling problem and machine location problem makes the proposed model more complex than job shop scheduling problem, which is an NP-hard problem. Therefore, to solve the proposed model, genetic algorithm as a meta-heuristic algorithm is implemented. To show the efficiency of the proposed genetic algorithm, 6×6 job shop scheduling problems are considered. © 2012 Growing Science Ltd. All rights reserved.
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.
