Abstract
In this paper we develop a more realistic algorithm which addresses the job shop scheduling problem with sequence dependent setup times, and some complex constraints such as multiple machines, multiple resources, and alternate routes; then, we evaluate the performance of the algorithm relative to the performance criteria used in the real world shops. To illustrate the potential impact of addressed problem, we simulate the scheduling jobs using three different approaches under a variety of conditions. Experimental designs are used to find the difference among these approaches, and to justify the value of the more realistic approach.
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.
